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: optimal distance</title> <meta name="description" content="Search results for: optimal distance"> <meta name="keywords" content="optimal distance"> <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="optimal distance" 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="optimal distance"> <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> 5005</div> </div> </div> </div> <h1 class="mt-3 mb-3 text-center" style="font-size:1.6rem;">Search results for: optimal distance</h1> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">5005</span> On the Construction of Some Optimal Binary Linear Codes</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Skezeer%20John%20B.%20Paz">Skezeer John B. Paz</a>, <a href="https://publications.waset.org/abstracts/search?q=Ederlina%20G.%20Nocon"> Ederlina G. Nocon</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Finding an optimal binary linear code is a central problem in coding theory. A binary linear code C = [n, k, d] is called optimal if there is no linear code with higher minimum distance d given the length n and the dimension k. There are bounds giving limits for the minimum distance d of a linear code of fixed length n and dimension k. The lower bound which can be taken by construction process tells that there is a known linear code having this minimum distance. The upper bound is given by theoretic results such as Griesmer bound. One way to find an optimal binary linear code is to make the lower bound of d equal to its higher bound. That is, to construct a binary linear code which achieves the highest possible value of its minimum distance d, given n and k. Some optimal binary linear codes were presented by Andries Brouwer in his published table on bounds of the minimum distance d of binary linear codes for 1 ≤ n ≤ 256 and k ≤ n. This was further improved by Markus Grassl by giving a detailed construction process for each code exhibiting the lower bound. In this paper, we construct new optimal binary linear codes by using some construction processes on existing binary linear codes. Particularly, we developed an algorithm applied to the codes already constructed to extend the list of optimal binary linear codes up to 257 ≤ n ≤ 300 for k ≤ 7. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=bounds%20of%20linear%20codes" title="bounds of linear codes">bounds of linear codes</a>, <a href="https://publications.waset.org/abstracts/search?q=Griesmer%20bound" title=" Griesmer bound"> Griesmer bound</a>, <a href="https://publications.waset.org/abstracts/search?q=construction%20of%20linear%20codes" title=" construction of linear codes"> construction of linear codes</a>, <a href="https://publications.waset.org/abstracts/search?q=optimal%20binary%20linear%20codes" title=" optimal binary linear codes"> optimal binary linear codes</a> </p> <a href="https://publications.waset.org/abstracts/31628/on-the-construction-of-some-optimal-binary-linear-codes" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/31628.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">755</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">5004</span> Multi-Objective Random Drift Particle Swarm Optimization Algorithm Based on RDPSO and Crowding Distance Sorting</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Yiqiong%20Yuan">Yiqiong Yuan</a>, <a href="https://publications.waset.org/abstracts/search?q=Jun%20Sun"> Jun Sun</a>, <a href="https://publications.waset.org/abstracts/search?q=Dongmei%20Zhou"> Dongmei Zhou</a>, <a href="https://publications.waset.org/abstracts/search?q=Jianan%20Sun"> Jianan Sun</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, we presented a Multi-Objective Random Drift Particle Swarm Optimization algorithm (MORDPSO-CD) based on RDPSO and crowding distance sorting to improve the convergence and distribution with less computation cost. MORDPSO-CD makes the most of RDPSO to approach the true Pareto optimal solutions fast. We adopt the crowding distance sorting technique to update and maintain the archived optimal solutions. Introducing the crowding distance technique into MORDPSO can make the leader particles find the true Pareto solution ultimately. The simulation results reveal that the proposed algorithm has better convergence and distribution <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=multi-objective%20optimization" title="multi-objective optimization">multi-objective optimization</a>, <a href="https://publications.waset.org/abstracts/search?q=random%20drift%20particle%20swarm%20optimization" title=" random drift particle swarm optimization"> random drift particle swarm optimization</a>, <a href="https://publications.waset.org/abstracts/search?q=crowding%20distance%20sorting" title=" crowding distance sorting"> crowding distance sorting</a>, <a href="https://publications.waset.org/abstracts/search?q=pareto%20optimal%20solution" title=" pareto optimal solution"> pareto optimal solution</a> </p> <a href="https://publications.waset.org/abstracts/44631/multi-objective-random-drift-particle-swarm-optimization-algorithm-based-on-rdpso-and-crowding-distance-sorting" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/44631.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">255</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">5003</span> The K-Distance Neighborhood Polynomial of a Graph</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Soner%20Nandappa%20D.">Soner Nandappa D.</a>, <a href="https://publications.waset.org/abstracts/search?q=Ahmed%20Mohammed%20Naji"> Ahmed Mohammed Naji</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In a graph G = (V, E), the distance from a vertex v to a vertex u is the length of shortest v to u path. The eccentricity e(v) of v is the distance to a farthest vertex from v. The diameter diam(G) is the maximum eccentricity. The k-distance neighborhood of v, for 0 ≤ k ≤ e(v), is Nk(v) = {u ϵ V (G) : d(v, u) = k}. In this paper, we introduce a new distance degree based topological polynomial of a graph G is called a k- distance neighborhood polynomial, denoted Nk(G, x). It is a polynomial with the coefficient of the term k, for 0 ≤ k ≤ e(v), is the sum of the cardinalities of Nk(v) for every v ϵ V (G). Some properties of k- distance neighborhood polynomials are obtained. Exact formulas of the k- distance neighborhood polynomial for some well-known graphs, Cartesian product and join of graphs are presented. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=vertex%20degrees" title="vertex degrees">vertex degrees</a>, <a href="https://publications.waset.org/abstracts/search?q=distance%20in%20graphs" title=" distance in graphs"> distance in graphs</a>, <a href="https://publications.waset.org/abstracts/search?q=graph%20operation" title=" graph operation"> graph operation</a>, <a href="https://publications.waset.org/abstracts/search?q=Nk-polynomials" title=" Nk-polynomials"> Nk-polynomials</a> </p> <a href="https://publications.waset.org/abstracts/52946/the-k-distance-neighborhood-polynomial-of-a-graph" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/52946.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">549</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">5002</span> Energy Saving Study of Mass Rapid Transit by Optimal Train Coasting Operation</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Artiya%20Sopharak">Artiya Sopharak</a>, <a href="https://publications.waset.org/abstracts/search?q=Tosaphol%20Ratniyomchai"> Tosaphol Ratniyomchai</a>, <a href="https://publications.waset.org/abstracts/search?q=Thanatchai%20Kulworawanichpong"> Thanatchai Kulworawanichpong</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper presents an energy-saving study of Mass Rapid Transit (MRT) using an optimal train coasting operation. For the dynamic train movement with four modes of operation, including accelerating mode, constant speed or cruising mode, coasting mode, and braking mode are considered in this study. The acceleration rate, the deceleration rate, and the starting coasting point are taken into account the optimal train speed profile during coasting mode with considering the energy saving and acceptable travel time comparison to the based case with no coasting operation. In this study, the mathematical method as a Quadratic Search Method (QDS) is conducted to carry out the optimization problem. A single train of MRT services between two stations with a distance of 2 km and a maximum speed of 80 km/h is taken to be the case study. Regarding the coasting mode operation, the results show that the longer distance of costing mode, the less energy consumption in cruising mode and the less braking energy. On the other hand, the shorter distance of coasting mode, the more energy consumption in cruising mode and the more braking energy. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=energy%20saving" title="energy saving">energy saving</a>, <a href="https://publications.waset.org/abstracts/search?q=coasting%20mode" title=" coasting mode"> coasting mode</a>, <a href="https://publications.waset.org/abstracts/search?q=mass%20rapid%20transit" title=" mass rapid transit"> mass rapid transit</a>, <a href="https://publications.waset.org/abstracts/search?q=quadratic%20search%20method" title=" quadratic search method"> quadratic search method</a> </p> <a href="https://publications.waset.org/abstracts/122572/energy-saving-study-of-mass-rapid-transit-by-optimal-train-coasting-operation" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/122572.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">302</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">5001</span> Clustering Performance Analysis using New Correlation-Based Cluster Validity Indices</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Nathakhun%20Wiroonsri">Nathakhun Wiroonsri</a> </p> <p class="card-text"><strong>Abstract:</strong></p> There are various cluster validity measures used for evaluating clustering results. One of the main objectives of using these measures is to seek the optimal unknown number of clusters. Some measures work well for clusters with different densities, sizes and shapes. Yet, one of the weaknesses that those validity measures share is that they sometimes provide only one clear optimal number of clusters. That number is actually unknown and there might be more than one potential sub-optimal option that a user may wish to choose based on different applications. We develop two new cluster validity indices based on a correlation between an actual distance between a pair of data points and a centroid distance of clusters that the two points are located in. Our proposed indices constantly yield several peaks at different numbers of clusters which overcome the weakness previously stated. Furthermore, the introduced correlation can also be used for evaluating the quality of a selected clustering result. Several experiments in different scenarios, including the well-known iris data set and a real-world marketing application, have been conducted to compare the proposed validity indices with several well-known ones. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=clustering%20algorithm" title="clustering algorithm">clustering algorithm</a>, <a href="https://publications.waset.org/abstracts/search?q=cluster%20validity%20measure" title=" cluster validity measure"> cluster validity measure</a>, <a href="https://publications.waset.org/abstracts/search?q=correlation" title=" correlation"> correlation</a>, <a href="https://publications.waset.org/abstracts/search?q=data%20partitions" title=" data partitions"> data partitions</a>, <a href="https://publications.waset.org/abstracts/search?q=iris%20data%20set" title=" iris data set"> iris data set</a>, <a href="https://publications.waset.org/abstracts/search?q=marketing" title=" marketing"> marketing</a>, <a href="https://publications.waset.org/abstracts/search?q=pattern%20recognition" title=" pattern recognition"> pattern recognition</a> </p> <a href="https://publications.waset.org/abstracts/147709/clustering-performance-analysis-using-new-correlation-based-cluster-validity-indices" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/147709.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">103</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">5000</span> Near Optimal Closed-Loop Guidance Gains Determination for Vector Guidance Law, from Impact Angle Errors and Miss Distance Considerations</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Karthikeyan%20Kalirajan">Karthikeyan Kalirajan</a>, <a href="https://publications.waset.org/abstracts/search?q=Ashok%20Joshi"> Ashok Joshi</a> </p> <p class="card-text"><strong>Abstract:</strong></p> An optimization problem is to setup to maximize the terminal kinetic energy of a maneuverable reentry vehicle (MaRV). The target location, the impact angle is given as constraints. The MaRV uses an explicit guidance law called Vector guidance. This law has two gains which are taken as decision variables. The problem is to find the optimal value of these gains which will result in minimum miss distance and impact angle error. Using a simple 3DOF non-rotating flat earth model and Lockheed martin HP-MARV as the reentry vehicle, the nature of solutions of the optimization problem is studied. This is achieved by carrying out a parametric study for a range of closed loop gain values and the corresponding impact angle error and the miss distance values are generated. The results show that there are well defined lower and upper bounds on the gains that result in near optimal terminal guidance solution. It is found from this study, that there exist common permissible regions (values of gains) where all constraints are met. Moreover, the permissible region lies between flat regions and hence the optimization algorithm has to be chosen carefully. It is also found that, only one of the gain values is independent and that the other dependent gain value is related through a simple straight-line expression. Moreover, to reduce the computational burden of finding the optimal value of two gains, a guidance law called Diveline guidance is discussed, which uses single gain. The derivation of the Diveline guidance law from Vector guidance law is discussed in this paper. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=Marv%20guidance" title="Marv guidance">Marv guidance</a>, <a href="https://publications.waset.org/abstracts/search?q=reentry%20trajectory" title=" reentry trajectory"> reentry trajectory</a>, <a href="https://publications.waset.org/abstracts/search?q=trajectory%20optimization" title=" trajectory optimization"> trajectory optimization</a>, <a href="https://publications.waset.org/abstracts/search?q=guidance%20gain%20selection" title=" guidance gain selection"> guidance gain selection</a> </p> <a href="https://publications.waset.org/abstracts/35646/near-optimal-closed-loop-guidance-gains-determination-for-vector-guidance-law-from-impact-angle-errors-and-miss-distance-considerations" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/35646.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">427</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">4999</span> Mechanism to Optimize Landing Distance in Order to Minimize Tyre Wear during Braking</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=H.%20V.%20H.%20De%20Soysa">H. V. H. De Soysa</a>, <a href="https://publications.waset.org/abstracts/search?q=N.%20D.%20Hiripitiya"> N. D. Hiripitiya</a>, <a href="https://publications.waset.org/abstracts/search?q=H.%20S.%20U.%20Thrimavithana"> H. S. U. Thrimavithana</a>, <a href="https://publications.waset.org/abstracts/search?q=B.%20R.%20Epitawala"> B. R. Epitawala</a>, <a href="https://publications.waset.org/abstracts/search?q=K.%20A.%20D.%20D.%20Kuruppu"> K. A. D. D. Kuruppu</a>, <a href="https://publications.waset.org/abstracts/search?q=D.%20J.%20K.%20Lokupathirage"> D. J. K. Lokupathirage</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This research was based on developing a mechanism in order to optimize the landing distance. Short distance braking and long distance braking may cause several issues for the aircraft including tyre wearing. The worst case occurs with short distance landing. The issues related to short distance landing were identified after conducting interviews with pilots, aeronautical engineers and technicians. A model was constructed in order to optimize the landing distance. The device started to function at the point where the main wheels of the aircraft touchdown the runway. It was found that implementing this device to the aircraft benefits to optimize the landing distance. This could lead to rectifying several issues occurred due to improper braking distances. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=aircraft" title="aircraft">aircraft</a>, <a href="https://publications.waset.org/abstracts/search?q=mechanism" title=" mechanism"> mechanism</a>, <a href="https://publications.waset.org/abstracts/search?q=optimize%20landing%20distance" title=" optimize landing distance"> optimize landing distance</a>, <a href="https://publications.waset.org/abstracts/search?q=runway" title=" runway"> runway</a> </p> <a href="https://publications.waset.org/abstracts/57454/mechanism-to-optimize-landing-distance-in-order-to-minimize-tyre-wear-during-braking" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/57454.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">4998</span> Speed up Vector Median Filtering by Quasi Euclidean Norm</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Vinai%20K.%20Singh">Vinai K. Singh</a> </p> <p class="card-text"><strong>Abstract:</strong></p> For reducing impulsive noise without degrading image contours, median filtering is a powerful tool. In multiband images as for example colour images or vector fields obtained by optic flow computation, a vector median filter can be used. Vector median filters are defined on the basis of a suitable distance, the best performing distance being the Euclidean. Euclidean distance is evaluated by using the Euclidean norms which is quite demanding from the point of view of computation given that a square root is required. In this paper an optimal piece-wise linear approximation of the Euclidean norm is presented which is applied to vector median filtering. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=euclidean%20norm" title="euclidean norm">euclidean norm</a>, <a href="https://publications.waset.org/abstracts/search?q=quasi%20euclidean%20norm" title=" quasi euclidean norm"> quasi euclidean norm</a>, <a href="https://publications.waset.org/abstracts/search?q=vector%20median%20filtering" title=" vector median filtering"> vector median filtering</a>, <a href="https://publications.waset.org/abstracts/search?q=applied%20mathematics" title=" applied mathematics"> applied mathematics</a> </p> <a href="https://publications.waset.org/abstracts/21942/speed-up-vector-median-filtering-by-quasi-euclidean-norm" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/21942.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">474</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">4997</span> Hybridized Approach for Distance Estimation Using K-Means Clustering</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Ritu%20Vashistha">Ritu Vashistha</a>, <a href="https://publications.waset.org/abstracts/search?q=Jitender%20Kumar"> Jitender Kumar</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Clustering using the K-means algorithm is a very common way to understand and analyze the obtained output data. When a similar object is grouped, this is called the basis of Clustering. There is K number of objects and C number of cluster in to single cluster in which k is always supposed to be less than C having each cluster to be its own centroid but the major problem is how is identify the cluster is correct based on the data. Formulation of the cluster is not a regular task for every tuple of row record or entity but it is done by an iterative process. Each and every record, tuple, entity is checked and examined and similarity dissimilarity is examined. So this iterative process seems to be very lengthy and unable to give optimal output for the cluster and time taken to find the cluster. To overcome the drawback challenge, we are proposing a formula to find the clusters at the run time, so this approach can give us optimal results. The proposed approach uses the Euclidian distance formula as well melanosis to find the minimum distance between slots as technically we called clusters and the same approach we have also applied to Ant Colony Optimization(ACO) algorithm, which results in the production of two and multi-dimensional matrix. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=ant%20colony%20optimization" title="ant colony optimization">ant colony optimization</a>, <a href="https://publications.waset.org/abstracts/search?q=data%20clustering" title=" data clustering"> data clustering</a>, <a href="https://publications.waset.org/abstracts/search?q=centroids" title=" centroids"> centroids</a>, <a href="https://publications.waset.org/abstracts/search?q=data%20mining" title=" data mining"> data mining</a>, <a href="https://publications.waset.org/abstracts/search?q=k-means" title=" k-means"> k-means</a> </p> <a href="https://publications.waset.org/abstracts/147011/hybridized-approach-for-distance-estimation-using-k-means-clustering" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/147011.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">128</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">4996</span> Evaluation of the Power Generation Effect Obtained by Inserting a Piezoelectric Sheet in the Backlash Clearance of a Circular Arc Helical Gear</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Barenten%20Suciu">Barenten Suciu</a>, <a href="https://publications.waset.org/abstracts/search?q=Yuya%20Nakamoto"> Yuya Nakamoto</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Power generation effect, obtained by inserting a piezo- electric sheet in the backlash clearance of a circular arc helical gear, is evaluated. Such type of screw gear is preferred since, in comparison with the involute tooth profile, the circular arc profile leads to reduced stress-concentration effects, and improved life of the piezoelectric film. Firstly, geometry of the circular arc helical gear, and properties of the piezoelectric sheet are presented. Then, description of the test-rig, consisted of a right-hand thread gear meshing with a left-hand thread gear, and the voltage measurement procedure are given. After creating the tridimensional (3D) model of the meshing gears in SolidWorks, they are 3D-printed in acrylonitrile butadiene styrene (ABS) resin. Variation of the generated voltage versus time, during a meshing cycle of the circular arc helical gear, is measured for various values of the center distance. Then, the change of the maximal, minimal, and peak-to-peak voltage versus the center distance is illustrated. Optimal center distance of the gear, to achieve voltage maximization, is found and its significance is discussed. Such results prove that the contact pressure of the meshing gears can be measured, and also, the electrical power can be generated by employing the proposed technique. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=circular%20arc%20helical%20gear" title="circular arc helical gear">circular arc helical gear</a>, <a href="https://publications.waset.org/abstracts/search?q=contact%20problem" title=" contact problem"> contact problem</a>, <a href="https://publications.waset.org/abstracts/search?q=optimal%20center%20distance" title=" optimal center distance"> optimal center distance</a>, <a href="https://publications.waset.org/abstracts/search?q=piezoelectric%20sheet" title=" piezoelectric sheet"> piezoelectric sheet</a>, <a href="https://publications.waset.org/abstracts/search?q=power%20generation" title=" power generation"> power generation</a> </p> <a href="https://publications.waset.org/abstracts/112480/evaluation-of-the-power-generation-effect-obtained-by-inserting-a-piezoelectric-sheet-in-the-backlash-clearance-of-a-circular-arc-helical-gear" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/112480.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">167</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">4995</span> Distance Protection Performance Analysis</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Abdelsalam%20Omar">Abdelsalam Omar </a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper presents simulation-based case study that indicate the need for accurate dynamic modeling of distance protection relay. In many cases, a static analysis based on current and voltage phasors may be sufficient to assess the performance of distance protection. There are several circumstances under which such a simplified study does not provide the depth of analysis necessary to obtain accurate results, however. This letter present study of the influences of magnetizing inrush and power swing on the performance of distance protection relay. One type of numerical distance protection relay has been investigated: 7SA511. The study has been performed in order to demonstrate the relay response when dynamic model of distance relay is utilized. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=distance%20protection" title="distance protection">distance protection</a>, <a href="https://publications.waset.org/abstracts/search?q=magnitizing%20inrush" title=" magnitizing inrush"> magnitizing inrush</a>, <a href="https://publications.waset.org/abstracts/search?q=power%20swing" title=" power swing"> power swing</a>, <a href="https://publications.waset.org/abstracts/search?q=dynamic%20model%20of%20protection%20relays" title=" dynamic model of protection relays"> dynamic model of protection relays</a>, <a href="https://publications.waset.org/abstracts/search?q=simulatio" title=" simulatio"> simulatio</a> </p> <a href="https://publications.waset.org/abstracts/21116/distance-protection-performance-analysis" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/21116.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">488</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">4994</span> Determination of Optimal Stress Locations in 2D–9 Noded Element in Finite Element Technique</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Nishant%20Shrivastava">Nishant Shrivastava</a>, <a href="https://publications.waset.org/abstracts/search?q=D.%20K.%20Sehgal"> D. K. Sehgal</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In Finite Element Technique nodal stresses are calculated through displacement as nodes. In this process, the displacement calculated at nodes is sufficiently good enough but stresses calculated at nodes are not sufficiently accurate. Therefore, the accuracy in the stress computation in FEM models based on the displacement technique is obviously matter of concern for computational time in shape optimization of engineering problems. In the present work same is focused to find out unique points within the element as well as the boundary of the element so, that good accuracy in stress computation can be achieved. Generally, major optimal stress points are located in domain of the element some points have been also located at boundary of the element where stresses are fairly accurate as compared to nodal values. Then, it is subsequently concluded that there is an existence of unique points within the element, where stresses have higher accuracy than other points in the elements. Therefore, it is main aim is to evolve a generalized procedure for the determination of the optimal stress location inside the element as well as at the boundaries of the element and verify the same with results from numerical experimentation. The results of quadratic 9 noded serendipity elements are presented and the location of distinct optimal stress points is determined inside the element, as well as at the boundaries. The theoretical results indicate various optimal stress locations are in local coordinates at origin and at a distance of 0.577 in both directions from origin. Also, at the boundaries optimal stress locations are at the midpoints of the element boundary and the locations are at a distance of 0.577 from the origin in both directions. The above findings were verified through experimentation and findings were authenticated. For numerical experimentation five engineering problems were identified and the numerical results of 9-noded element were compared to those obtained by using the same order of 25-noded quadratic Lagrangian elements, which are considered as standard. Then root mean square errors are plotted with respect to various locations within the elements as well as the boundaries and conclusions were drawn. After numerical verification it is noted that in a 9-noded element, origin and locations at a distance of 0.577 from origin in both directions are the best sampling points for the stresses. It was also noted that stresses calculated within line at boundary enclosed by 0.577 midpoints are also very good and the error found is very less. When sampling points move away from these points, then it causes line zone error to increase rapidly. Thus, it is established that there are unique points at boundary of element where stresses are accurate, which can be utilized in solving various engineering problems and are also useful in shape optimizations. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=finite%20elements" title="finite elements">finite elements</a>, <a href="https://publications.waset.org/abstracts/search?q=Lagrangian" title=" Lagrangian"> Lagrangian</a>, <a href="https://publications.waset.org/abstracts/search?q=optimal%20stress%20location" title=" optimal stress location"> optimal stress location</a>, <a href="https://publications.waset.org/abstracts/search?q=serendipity" title=" serendipity "> serendipity </a> </p> <a href="https://publications.waset.org/abstracts/125656/determination-of-optimal-stress-locations-in-2d-9-noded-element-in-finite-element-technique" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/125656.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">105</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">4993</span> A Polynomial Time Clustering Algorithm for Solving the Assignment Problem in the Vehicle Routing Problem</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Lydia%20Wahid">Lydia Wahid</a>, <a href="https://publications.waset.org/abstracts/search?q=Mona%20F.%20Ahmed"> Mona F. Ahmed</a>, <a href="https://publications.waset.org/abstracts/search?q=Nevin%20Darwish"> Nevin Darwish</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The vehicle routing problem (VRP) consists of a group of customers that needs to be served. Each customer has a certain demand of goods. A central depot having a fleet of vehicles is responsible for supplying the customers with their demands. The problem is composed of two subproblems: The first subproblem is an assignment problem where the number of vehicles that will be used as well as the customers assigned to each vehicle are determined. The second subproblem is the routing problem in which for each vehicle having a number of customers assigned to it, the order of visits of the customers is determined. Optimal number of vehicles, as well as optimal total distance, should be achieved. In this paper, an approach for solving the first subproblem (the assignment problem) is presented. In the approach, a clustering algorithm is proposed for finding the optimal number of vehicles by grouping the customers into clusters where each cluster is visited by one vehicle. Finding the optimal number of clusters is NP-hard. This work presents a polynomial time clustering algorithm for finding the optimal number of clusters and solving the assignment problem. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=vehicle%20routing%20problems" title="vehicle routing problems">vehicle routing problems</a>, <a href="https://publications.waset.org/abstracts/search?q=clustering%20algorithms" title=" clustering algorithms"> clustering algorithms</a>, <a href="https://publications.waset.org/abstracts/search?q=Clarke%20and%20Wright%20Saving%20Method" title=" Clarke and Wright Saving Method"> Clarke and Wright Saving Method</a>, <a href="https://publications.waset.org/abstracts/search?q=agglomerative%20hierarchical%20clustering" title=" agglomerative hierarchical clustering"> agglomerative hierarchical clustering</a> </p> <a href="https://publications.waset.org/abstracts/85552/a-polynomial-time-clustering-algorithm-for-solving-the-assignment-problem-in-the-vehicle-routing-problem" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/85552.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">393</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">4992</span> The Τraits Τhat Facilitate Successful Student Performance in Distance Education: The Case of the Distance Education Unit at European University Cyprus</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Dimitrios%20Vlachopoulos">Dimitrios Vlachopoulos</a>, <a href="https://publications.waset.org/abstracts/search?q=George%20Tsokkas"> George Tsokkas</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Although it is not intended to identify distance education students as a homogeneous group, recent research has demonstrated that there are some demographic and personality common traits among most of them that provide the basis for the description of a typical distance learning student. The purpose of this paper is to describe these common traits and to facilitate their learning journey within a distance education program. The described research is an initiative of the Distance Education Unit at the European University Cyprus (Laureate International Universities) in the context of its action for the improvement of the students’ performance. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=distance%20education%20students" title="distance education students">distance education students</a>, <a href="https://publications.waset.org/abstracts/search?q=successful%20student%20performance" title=" successful student performance"> successful student performance</a>, <a href="https://publications.waset.org/abstracts/search?q=European%20University%20Cyprus" title=" European University Cyprus"> European University Cyprus</a>, <a href="https://publications.waset.org/abstracts/search?q=common%20traits" title=" common traits"> common traits</a> </p> <a href="https://publications.waset.org/abstracts/21141/the-traits-that-facilitate-successful-student-performance-in-distance-education-the-case-of-the-distance-education-unit-at-european-university-cyprus" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/21141.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">486</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">4991</span> A Simulation for Behaviors of Preys to Avoid Pursuit of Predator</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Jae%20Moon%20Lee">Jae Moon Lee</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Generally the predator will continuously aim to attack the prey, while the prey will maintain a safe distance from the predator in order to avoid it . If the predator has enough energy to chase a certain amount of distance, it will begin to attack the prey. The prey needs to approach the predator for various reasons such as getting food. However, it will also try to keep a safe distance because of the threat of predators. The safe distance is dependent on the amount of the energy of predator, and the behaviors of prey is changed according to the size of the safe distance. This paper is to simulate the behaviors of preys to avoid the pursuit of predator based on the safe distance. The simulations will be executed experimentally under single predator and multiple preys. The results of the simulations show that the amount of energy of predator gives a great influence on the behavior of the prey. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=predator" title="predator">predator</a>, <a href="https://publications.waset.org/abstracts/search?q=prey" title=" prey"> prey</a>, <a href="https://publications.waset.org/abstracts/search?q=energy" title=" energy"> energy</a>, <a href="https://publications.waset.org/abstracts/search?q=safe%20distance" title=" safe distance"> safe distance</a>, <a href="https://publications.waset.org/abstracts/search?q=simulation" title=" simulation"> simulation</a> </p> <a href="https://publications.waset.org/abstracts/27952/a-simulation-for-behaviors-of-preys-to-avoid-pursuit-of-predator" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/27952.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">265</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">4990</span> Classification of Hyperspectral Image Using Mathematical Morphological Operator-Based Distance Metric</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Geetika%20Barman">Geetika Barman</a>, <a href="https://publications.waset.org/abstracts/search?q=B.%20S.%20Daya%20Sagar"> B. S. Daya Sagar</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this article, we proposed a pixel-wise classification of hyperspectral images using a mathematical morphology operator-based distance metric called “dilation distance” and “erosion distance”. This method involves measuring the spatial distance between the spectral features of a hyperspectral image across the bands. The key concept of the proposed approach is that the “dilation distance” is the maximum distance a pixel can be moved without changing its classification, whereas the “erosion distance” is the maximum distance that a pixel can be moved before changing its classification. The spectral signature of the hyperspectral image carries unique class information and shape for each class. This article demonstrates how easily the dilation and erosion distance can measure spatial distance compared to other approaches. This property is used to calculate the spatial distance between hyperspectral image feature vectors across the bands. The dissimilarity matrix is then constructed using both measures extracted from the feature spaces. The measured distance metric is used to distinguish between the spectral features of various classes and precisely distinguish between each class. This is illustrated using both toy data and real datasets. Furthermore, we investigated the role of flat vs. non-flat structuring elements in capturing the spatial features of each class in the hyperspectral image. In order to validate, we compared the proposed approach to other existing methods and demonstrated empirically that mathematical operator-based distance metric classification provided competitive results and outperformed some of them. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=dilation%20distance" title="dilation distance">dilation distance</a>, <a href="https://publications.waset.org/abstracts/search?q=erosion%20distance" title=" erosion distance"> erosion distance</a>, <a href="https://publications.waset.org/abstracts/search?q=hyperspectral%20image%20classification" title=" hyperspectral image classification"> hyperspectral image classification</a>, <a href="https://publications.waset.org/abstracts/search?q=mathematical%20morphology" title=" mathematical morphology"> mathematical morphology</a> </p> <a href="https://publications.waset.org/abstracts/166292/classification-of-hyperspectral-image-using-mathematical-morphological-operator-based-distance-metric" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/166292.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">87</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">4989</span> Distances over Incomplete Diabetes and Breast Cancer Data Based on Bhattacharyya Distance</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Loai%20AbdAllah">Loai AbdAllah</a>, <a href="https://publications.waset.org/abstracts/search?q=Mahmoud%20Kaiyal"> Mahmoud Kaiyal</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Missing values in real-world datasets are a common problem. Many algorithms were developed to deal with this problem, most of them replace the missing values with a fixed value that was computed based on the observed values. In our work, we used a distance function based on Bhattacharyya distance to measure the distance between objects with missing values. Bhattacharyya distance, which measures the similarity of two probability distributions. The proposed distance distinguishes between known and unknown values. Where the distance between two known values is the Mahalanobis distance. When, on the other hand, one of them is missing the distance is computed based on the distribution of the known values, for the coordinate that contains the missing value. This method was integrated with Wikaya, a digital health company developing a platform that helps to improve prevention of chronic diseases such as diabetes and cancer. In order for Wikaya’s recommendation system to work distance between users need to be measured. Since there are missing values in the collected data, there is a need to develop a distance function distances between incomplete users profiles. To evaluate the accuracy of the proposed distance function in reflecting the actual similarity between different objects, when some of them contain missing values, we integrated it within the framework of k nearest neighbors (kNN) classifier, since its computation is based only on the similarity between objects. To validate this, we ran the algorithm over diabetes and breast cancer datasets, standard benchmark datasets from the UCI repository. Our experiments show that kNN classifier using our proposed distance function outperforms the kNN using other existing methods. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=missing%20values" title="missing values">missing values</a>, <a href="https://publications.waset.org/abstracts/search?q=incomplete%20data" title=" incomplete data"> incomplete data</a>, <a href="https://publications.waset.org/abstracts/search?q=distance" title=" distance"> distance</a>, <a href="https://publications.waset.org/abstracts/search?q=incomplete%20diabetes%20data" title=" incomplete diabetes data"> incomplete diabetes data</a> </p> <a href="https://publications.waset.org/abstracts/95506/distances-over-incomplete-diabetes-and-breast-cancer-data-based-on-bhattacharyya-distance" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/95506.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">225</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">4988</span> Decision Trees Constructing Based on K-Means Clustering Algorithm</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Loai%20Abdallah">Loai Abdallah</a>, <a href="https://publications.waset.org/abstracts/search?q=Malik%20Yousef"> Malik Yousef</a> </p> <p class="card-text"><strong>Abstract:</strong></p> A domain space for the data should reflect the actual similarity between objects. Since objects belonging to the same cluster usually share some common traits even though their geometric distance might be relatively large. In general, the Euclidean distance of data points that represented by large number of features is not capturing the actual relation between those points. In this study, we propose a new method to construct a different space that is based on clustering to form a new distance metric. The new distance space is based on ensemble clustering (EC). The EC distance space is defined by tracking the membership of the points over multiple runs of clustering algorithm metric. Over this distance, we train the decision trees classifier (DT-EC). The results obtained by applying DT-EC on 10 datasets confirm our hypotheses that embedding the EC space as a distance metric would improve the performance. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=ensemble%20clustering" title="ensemble clustering">ensemble clustering</a>, <a href="https://publications.waset.org/abstracts/search?q=decision%20trees" title=" decision trees"> decision trees</a>, <a href="https://publications.waset.org/abstracts/search?q=classification" title=" classification"> classification</a>, <a href="https://publications.waset.org/abstracts/search?q=K%20nearest%20neighbors" title=" K nearest neighbors"> K nearest neighbors</a> </p> <a href="https://publications.waset.org/abstracts/89656/decision-trees-constructing-based-on-k-means-clustering-algorithm" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/89656.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">190</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">4987</span> The Effect of Irradiation Distance on Microhardness of Hybrid Resin Composite Polymerization Using Light-Emitting Diodes</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Deli%20Mona">Deli Mona</a>, <a href="https://publications.waset.org/abstracts/search?q=Rafika%20Husni"> Rafika Husni</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The aim of this research is to evaluate the effect of lighting distance on surface hardness of light composite resin. We held laboratory experimental research with post-test only group design. The samples used are 30 disc-like hybrid composite resins with the diameter is 6 mm and the thickness is 2 mm, lighted by an LED for 20 seconds. They were divided into 3 groups, and every group was consisted by 10 samples, which were 0 mm, 2 mm, and 5 mm lighting distance group. Every samples group was treated with hardness test, Vicker Hardness Test, then analyzed with one-way ANOVA test to evaluate the effect of lighting distance differences on surface hardness of light composite resin. Statistic test result shown hardness mean change of composite renin between 0 mm and 2 mm lighting distance with 0.00 significance (p<0.05), between 0 mm and 5 mm lighting distance with 0.00 significance (p<0.05), and 2 mm and 5 mm lighting distance with 0.05 significance (p<0.05). According to the result of this research, we concluded that the further lighting distance, the more surface hardness decline of hybrid composite resin. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=composite%20resin%20hybrid" title="composite resin hybrid">composite resin hybrid</a>, <a href="https://publications.waset.org/abstracts/search?q=tip%20distance" title=" tip distance"> tip distance</a>, <a href="https://publications.waset.org/abstracts/search?q=microhardness" title=" microhardness"> microhardness</a>, <a href="https://publications.waset.org/abstracts/search?q=light%20curing%20LED" title=" light curing LED"> light curing LED</a> </p> <a href="https://publications.waset.org/abstracts/72306/the-effect-of-irradiation-distance-on-microhardness-of-hybrid-resin-composite-polymerization-using-light-emitting-diodes" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/72306.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">346</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">4986</span> The Net as a Living Experience of Distance Motherhood within Italian Culture</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=C.%20Papapicco">C. Papapicco</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Motherhood is an existential human relationship that lasts for the whole life and is always interwoven with subjectivity and culture. As a result of the brain drain, the motherhood becomes motherhood at distance. Starting from the hypothesis that re-signification of the mother at distance practices is culturally relevant; the research aims to understand the experience of mother at a distance in order to extrapolate the strategies of management of the empty nest. Specifically, the research aims to evaluate the experience of a brain drain’s mother, who created a blog that intends to take care of other parents at a distance. Actually, the blog is the only artifact symbol of the Italian culture of motherhood at distance. In the research, a Netnographic Analysis of the blog mammedicervelliinfuga.com is offered with the aim of understanding if the online world becomes an opportunity to manage the role of mother at a distance. A narrative interview with the blog creator was conducted and then the texts were analyzed by means of a Diatextual Analysis approach. It emerged that the migration projects of talented children take on different meanings and representations for parents. Thus, it is shown that the blog becomes a new form of understanding and practicing motherhood at a distance. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=brain%20drain" title="brain drain">brain drain</a>, <a href="https://publications.waset.org/abstracts/search?q=diatextual%20analysis" title=" diatextual analysis"> diatextual analysis</a>, <a href="https://publications.waset.org/abstracts/search?q=distance%20motherhood%20blog" title=" distance motherhood blog"> distance motherhood blog</a>, <a href="https://publications.waset.org/abstracts/search?q=online%20and%20offline%20narrations" title=" online and offline narrations"> online and offline narrations</a> </p> <a href="https://publications.waset.org/abstracts/118170/the-net-as-a-living-experience-of-distance-motherhood-within-italian-culture" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/118170.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">129</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">4985</span> Analytical Solution for Stellar Distance Based on Photon Dominated Cosmic Expansion Model</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Xiaoyun%20Li">Xiaoyun Li</a>, <a href="https://publications.waset.org/abstracts/search?q=Suoang%20Longzhou"> Suoang Longzhou</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper derives the analytical solution of stellar distance according to its redshift based on the photon-dominated universe expansion model. Firstly, it calculates stellar separation speed and the farthest distance of observable stars via simulation. Then the analytical solution of stellar distance according to its redshift is derived. It shows that when the redshift is large, the stellar distance (and its separation speed) is not proportional to its redshift due to the relativity effect. It also reveals the relationship between stellar age and its redshift. The correctness of the analytical solution is verified by the latest astronomic observations of Ia supernovas in 2020. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=redshift" title="redshift">redshift</a>, <a href="https://publications.waset.org/abstracts/search?q=cosmic%20expansion%20model" title=" cosmic expansion model"> cosmic expansion model</a>, <a href="https://publications.waset.org/abstracts/search?q=analytical%20solution" title=" analytical solution"> analytical solution</a>, <a href="https://publications.waset.org/abstracts/search?q=stellar%20distance" title=" stellar distance"> stellar distance</a> </p> <a href="https://publications.waset.org/abstracts/132729/analytical-solution-for-stellar-distance-based-on-photon-dominated-cosmic-expansion-model" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/132729.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">161</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">4984</span> Assessing Distance Education Practices: Teachers Experience and Perceptions</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Mohammed%20Amraouy">Mohammed Amraouy</a>, <a href="https://publications.waset.org/abstracts/search?q=Mostafa%20Bellafkih"> Mostafa Bellafkih</a>, <a href="https://publications.waset.org/abstracts/search?q=Abdellah%20Bennane"> Abdellah Bennane</a>, <a href="https://publications.waset.org/abstracts/search?q=Aziza%20Benomar"> Aziza Benomar</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Distance education has become popular due to their ability to provide learning from almost anywhere and anytime. COVID-19 forced educational institutions to urgently introduce distance education to ensure pedagogical continuity, so all stakeholders were invited to adapt to this new paradigm. In order to identify strengths and weaknesses, the research focuses on the need to create an effective mechanism for evaluating distance education. The aims of this research were to explore and evaluate the use of digital media in general and official platforms in particular in distance education practices. To this end, we have developed and validated a questionnaire before administering it to a sample of 431 teachers in Morocco. Teachers reported lower knowledge and skills in the didactic use of ICT in the distance education process. In addition, although age and educative experience of the teachers continue to modulate the level of instrumental skills. Therefore, resources (digital resources and infrastructure) and the teachers’ ICT training present serious limitations, which require a training more focused on the distance educational paradigm and educational environments that allow teachers to create educational activities able to promote and facilitate the distance learning process. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=distance%20education" title="distance education">distance education</a>, <a href="https://publications.waset.org/abstracts/search?q=e-learning" title=" e-learning"> e-learning</a>, <a href="https://publications.waset.org/abstracts/search?q=teachers%E2%80%99%20perceptions" title=" teachers’ perceptions"> teachers’ perceptions</a>, <a href="https://publications.waset.org/abstracts/search?q=assessment" title=" assessment"> assessment</a> </p> <a href="https://publications.waset.org/abstracts/147342/assessing-distance-education-practices-teachers-experience-and-perceptions" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/147342.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">4983</span> Evaluation of Distance Education Needs of Athletes</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Yunus%20Emre%20Karakaya">Yunus Emre Karakaya</a>, <a href="https://publications.waset.org/abstracts/search?q=Sebahattin%20Devecioglu"> Sebahattin Devecioglu</a>, <a href="https://publications.waset.org/abstracts/search?q=Bilal%20Coban"> Bilal Coban</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Today, information technology’s presence is felt in every field of life. Fields of education and sports sciences have their own share too. Especially developments in informatics technologies changed the perspectives of these fields. The altered technological conditions made distance education argumentative in these fields. Due to advantages distance education provides to students, they can access the desired education without concerns about time and place. Education facilities are seen to head for distance education in this manner and expedite the process. Distance education applications, which was first started to be applied in the mid-1800s, have been implemented in Turkey since 1970s and still continues today. In this study, the historical development of distance education in the world and Turkey and the problems athletes face in education were discussed. Accordingly, suggestions were made evaluating the importance and requirements of distance education in sports education facilities at higher education level. Additionally, Questions of “Is distance education important in sports education in Turkey?”, “What are the problems of athletes in the education field in Turkey?” and similar questions were attempted to be answered. Finally, in Turkey, distance sports education applications in universities should be launched to ensure that athletes’ educations are not deficit and unfinished. Within this framework, legal regulations should be implemented by “Council of Higher Education” to develop the distance sports education in Turkey and utilize distance education efficiently in solving the sports education problems. By ensuring the advancement of athletes with this method, it is expected for athletes to contribute to sports in the country in both government and the private sector in the medium and long terms. Individuals who participated in the distance sports education will set an example in extending the country’s youth to national and international fields. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=athletes" title="athletes">athletes</a>, <a href="https://publications.waset.org/abstracts/search?q=distance%20education" title=" distance education"> distance education</a>, <a href="https://publications.waset.org/abstracts/search?q=higher%20education" title=" higher education"> higher education</a>, <a href="https://publications.waset.org/abstracts/search?q=sports%20education" title=" sports education"> sports education</a>, <a href="https://publications.waset.org/abstracts/search?q=Turkey" title=" Turkey"> Turkey</a> </p> <a href="https://publications.waset.org/abstracts/55677/evaluation-of-distance-education-needs-of-athletes" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/55677.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">351</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">4982</span> Distance and Coverage: An Assessment of Location-Allocation Models for Fire Stations in Kuwait City, Kuwait</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Saad%20M.%20Algharib">Saad M. Algharib</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The major concern of planners when placing fire stations is finding their optimal locations such that the fire companies can reach fire locations within reasonable response time or distance. Planners are also concerned with the numbers of fire stations that are needed to cover all service areas and the fires, as demands, with standard response time or distance. One of the tools for such analysis is location-allocation models. Location-allocation models enable planners to determine the optimal locations of facilities in an area in order to serve regional demands in the most efficient way. The purpose of this study is to examine the geographic distribution of the existing fire stations in Kuwait City. This study utilized location-allocation models within the Geographic Information System (GIS) environment and a number of statistical functions to assess the current locations of fire stations in Kuwait City. Further, this study investigated how well all service areas are covered and how many and where additional fire stations are needed. Four different location-allocation models were compared to find which models cover more demands than the others, given the same number of fire stations. This study tests many ways to combine variables instead of using one variable at a time when applying these models in order to create a new measurement that influences the optimal locations for locating fire stations. This study also tests how location-allocation models are sensitive to different levels of spatial dependency. The results indicate that there are some districts in Kuwait City that are not covered by the existing fire stations. These uncovered districts are clustered together. This study also identifies where to locate the new fire stations. This study provides users of these models a new variable that can assist them to select the best locations for fire stations. The results include information about how the location-allocation models behave in response to different levels of spatial dependency of demands. The results show that these models perform better with clustered demands. From the additional analysis carried out in this study, it can be concluded that these models applied differently at different spatial patterns. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=geographic%20information%20science" title="geographic information science">geographic information science</a>, <a href="https://publications.waset.org/abstracts/search?q=GIS" title=" GIS"> GIS</a>, <a href="https://publications.waset.org/abstracts/search?q=location-allocation%20models" title=" location-allocation models"> location-allocation models</a>, <a href="https://publications.waset.org/abstracts/search?q=geography" title=" geography"> geography</a> </p> <a href="https://publications.waset.org/abstracts/103764/distance-and-coverage-an-assessment-of-location-allocation-models-for-fire-stations-in-kuwait-city-kuwait" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/103764.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">177</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">4981</span> The Vertex Degree Distance of One Vertex Union of the Cycle and the Star</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Ying%20Wang">Ying Wang</a>, <a href="https://publications.waset.org/abstracts/search?q=Haiyan%20Xie"> Haiyan Xie</a>, <a href="https://publications.waset.org/abstracts/search?q=Aoming%20Zhang"> Aoming Zhang</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The degree distance of a graph is a graph invariant that is more sensitive than the Wiener index. In this paper, we calculate the vertex degree distances of one vertex union of the cycle and the star, and the degree distance of one vertex union of the cycle and the star. These results lay a foundation for further study on the extreme value of the vertex degree distances, and the distribution of the vertices with the extreme value in one vertex union of the cycle and the star. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=degree%20distance" title="degree distance">degree distance</a>, <a href="https://publications.waset.org/abstracts/search?q=vertex-degree-distance" title=" vertex-degree-distance"> vertex-degree-distance</a>, <a href="https://publications.waset.org/abstracts/search?q=one%20vertex%20union%20of%20a%20cycle%20and%20a%20star" title=" one vertex union of a cycle and a star"> one vertex union of a cycle and a star</a>, <a href="https://publications.waset.org/abstracts/search?q=graph" title=" graph"> graph</a> </p> <a href="https://publications.waset.org/abstracts/127232/the-vertex-degree-distance-of-one-vertex-union-of-the-cycle-and-the-star" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/127232.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">4980</span> Numerical Analysis of Shallow Footing Rested on Geogrid Reinforced Sandy Soil </h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Seyed%20Abolhasan%20Naeini">Seyed Abolhasan Naeini</a>, <a href="https://publications.waset.org/abstracts/search?q=Javad%20%20Shamsi%20Soosahab"> Javad Shamsi Soosahab</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The use of geosynthetic reinforcement within the footing soils is a very effective and useful method to avoid the construction of costly deep foundations. This study investigated the use of geosynthetics for soil improvement based on numerical modeling using FELA software. Pressure settlement behavior and bearing capacity ratio of foundation on geogrid reinforced sand is investigated and the effect of different parameters like as number of geogrid layers and vertical distance between elements in three different relative density soil is studied. The effects of geometrical parameters of reinforcement layers were studied for determining the optimal values to reach to maximum bearing capacity. The results indicated that the optimum range of the distance ratio between the reinforcement layers was achieved at 0.5 to 0.6 and after number of geogrid layers of 4, no significant effect on increasing the bearing capacity of footing on reinforced sandy with geogrid <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=geogrid" title="geogrid">geogrid</a>, <a href="https://publications.waset.org/abstracts/search?q=reinforced%20sand" title=" reinforced sand"> reinforced sand</a>, <a href="https://publications.waset.org/abstracts/search?q=FELA%20software" title=" FELA software"> FELA software</a>, <a href="https://publications.waset.org/abstracts/search?q=distance%20ratio" title=" distance ratio"> distance ratio</a>, <a href="https://publications.waset.org/abstracts/search?q=number%20of%20geogrid%20layers" title=" number of geogrid layers"> number of geogrid layers</a> </p> <a href="https://publications.waset.org/abstracts/127329/numerical-analysis-of-shallow-footing-rested-on-geogrid-reinforced-sandy-soil" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/127329.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">148</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">4979</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">4978</span> Optimal Concentration of Fluorescent Nanodiamonds in Aqueous Media for Bioimaging and Thermometry Applications</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Francisco%20Pedroza-Montero">Francisco Pedroza-Montero</a>, <a href="https://publications.waset.org/abstracts/search?q=Jes%C3%BAs%20Na%C3%ADn%20Pedroza-Montero"> Jesús Naín Pedroza-Montero</a>, <a href="https://publications.waset.org/abstracts/search?q=Diego%20Soto-Puebla"> Diego Soto-Puebla</a>, <a href="https://publications.waset.org/abstracts/search?q=Osiris%20Alvarez-Bajo"> Osiris Alvarez-Bajo</a>, <a href="https://publications.waset.org/abstracts/search?q=Beatriz%20Castaneda"> Beatriz Castaneda</a>, <a href="https://publications.waset.org/abstracts/search?q=Sof%C3%ADa%20Navarro-Espinoza"> Sofía Navarro-Espinoza</a>, <a href="https://publications.waset.org/abstracts/search?q=Mart%C3%ADn%20Pedroza-Montero"> Martín Pedroza-Montero</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Nanodiamonds have been widely studied for their physical properties, including chemical inertness, biocompatibility, optical transparency from the ultraviolet to the infrared region, high thermal conductivity, and mechanical strength. In this work, we studied how the fluorescence spectrum of nanodiamonds quenches concerning the concentration in aqueous solutions systematically ranging from 0.1 to 10 mg/mL. Our results demonstrated a non-linear fluorescence quenching as the concentration increases for both of the NV zero-phonon lines; the 5 mg/mL concentration shows the maximum fluorescence emission. Furthermore, this behaviour is theoretically explained as an electronic recombination process that modulates the intensity in the NV centres. Finally, to gain more insight, the FRET methodology is used to determine the fluorescence efficiency in terms of the fluorophores' separation distance. Thus, the concentration level is simulated as follows, a small distance between nanodiamonds would be considered a highly concentrated system, whereas a large distance would mean a low concentrated one. Although the 5 mg/mL concentration shows the maximum intensity, our main interest is focused on the concentration of 0.5 mg/mL, which our studies demonstrate the optimal human cell viability (99%). In this respect, this concentration has the feature of being as biocompatible as water giving the possibility to internalize it in cells without harming the living media. To this end, not only can we track nanodiamonds on the surface or inside the cell with excellent precision due to their fluorescent intensity, but also, we can perform thermometry tests transforming a fluorescence contrast image into a temperature contrast image. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=nanodiamonds" title="nanodiamonds">nanodiamonds</a>, <a href="https://publications.waset.org/abstracts/search?q=fluorescence%20spectroscopy" title=" fluorescence spectroscopy"> fluorescence spectroscopy</a>, <a href="https://publications.waset.org/abstracts/search?q=concentration" title=" concentration"> concentration</a>, <a href="https://publications.waset.org/abstracts/search?q=bioimaging" title=" bioimaging"> bioimaging</a>, <a href="https://publications.waset.org/abstracts/search?q=thermometry" title=" thermometry"> thermometry</a> </p> <a href="https://publications.waset.org/abstracts/142223/optimal-concentration-of-fluorescent-nanodiamonds-in-aqueous-media-for-bioimaging-and-thermometry-applications" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/142223.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">405</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">4977</span> Gender and Parenthood in Web 2.0.: Research on Role Distance in a Bulgarian Weblog Dedicated to Motherhood</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Gergana%20Nenova">Gergana Nenova</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The persistence of gender arrangements in childcare has been well-documented and theorized, but we know little on how they have been represented in Web 2.0. by the social actors themselves. This paper relies on Goffman’s concept of role distance to explore the online self-representations of mothers as a group and thus the complicated relationship between gender and parenthood. The object of research is a popular Bulgarian weblog dedicated to motherhood, and its content has been analyzed through content analysis. The results demonstrate that the concept of role distance can be successfully used to illuminate the ways the gendered expectations and norms of parenting are being questioned online. The research contributes both to the understanding of the relevance of the concept of role distance in explaining gender relations and of its increasing importance in Web 2.0. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=gender" title="gender">gender</a>, <a href="https://publications.waset.org/abstracts/search?q=parenthood" title=" parenthood"> parenthood</a>, <a href="https://publications.waset.org/abstracts/search?q=role%20distance" title=" role distance"> role distance</a>, <a href="https://publications.waset.org/abstracts/search?q=Web%202.0" title=" Web 2.0"> Web 2.0</a> </p> <a href="https://publications.waset.org/abstracts/66208/gender-and-parenthood-in-web-20-research-on-role-distance-in-a-bulgarian-weblog-dedicated-to-motherhood" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/66208.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">340</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">4976</span> Cost Benefit Analysis: Evaluation among the Millimetre Wavebands and SHF Bands of Small Cell 5G Networks</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Emanuel%20Teixeira">Emanuel Teixeira</a>, <a href="https://publications.waset.org/abstracts/search?q=Anderson%20Ramos"> Anderson Ramos</a>, <a href="https://publications.waset.org/abstracts/search?q=Marisa%20Louren%C3%A7o"> Marisa Lourenço</a>, <a href="https://publications.waset.org/abstracts/search?q=Fernando%20J.%20Velez"> Fernando J. Velez</a>, <a href="https://publications.waset.org/abstracts/search?q=Jon%20M.%20Peha"> Jon M. Peha</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This article discusses the benefit cost analysis aspects of millimetre wavebands (mmWaves) and Super High Frequency (SHF). The devaluation along the distance of the carrier-to-noise-plus-interference ratio with the coverage distance is assessed by considering two different path loss models, the two-slope urban micro Line-of-Sight (UMiLoS) for the SHF band and the modified Friis propagation model, for frequencies above 24 GHz. The equivalent supported throughput is estimated at the 5.62, 28, 38, 60 and 73 GHz frequency bands and the influence of carrier-to-noise-plus-interference ratio in the radio and network optimization process is explored. Mostly owing to the lessening caused by the behaviour of the two-slope propagation model for SHF band, the supported throughput at this band is higher than at the millimetre wavebands only for the longest cell lengths. The benefit cost analysis of these pico-cellular networks was analysed for regular cellular topologies, by considering the unlicensed spectrum. For shortest distances, we can distinguish an optimal of the revenue in percentage terms for values of the cell length, R ≈ 10 m for the millimeter wavebands and for longest distances an optimal of the revenue can be observed at R ≈ 550 m for the 5.62 GHz. It is possible to observe that, for the 5.62 GHz band, the profit is slightly inferior than for millimetre wavebands, for the shortest Rs, and starts to increase for cell lengths approximately equal to the ratio between the break-point distance and the co-channel reuse factor, achieving a maximum for values of R approximately equal to 550 m. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=millimetre%20wavebands" title="millimetre wavebands">millimetre wavebands</a>, <a href="https://publications.waset.org/abstracts/search?q=SHF%20band" title=" SHF band"> SHF band</a>, <a href="https://publications.waset.org/abstracts/search?q=SINR" title=" SINR"> SINR</a>, <a href="https://publications.waset.org/abstracts/search?q=cost%20benefit%20analysis" title=" cost benefit analysis"> cost benefit analysis</a>, <a href="https://publications.waset.org/abstracts/search?q=5G" title=" 5G"> 5G</a> </p> <a href="https://publications.waset.org/abstracts/126666/cost-benefit-analysis-evaluation-among-the-millimetre-wavebands-and-shf-bands-of-small-cell-5g-networks" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/126666.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">141</span> </span> </div> </div> <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=optimal%20distance&page=2">2</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=optimal%20distance&page=3">3</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=optimal%20distance&page=4">4</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=optimal%20distance&page=5">5</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=optimal%20distance&page=6">6</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=optimal%20distance&page=7">7</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=optimal%20distance&page=8">8</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=optimal%20distance&page=9">9</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=optimal%20distance&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=optimal%20distance&page=166">166</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=optimal%20distance&page=167">167</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=optimal%20distance&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>