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: weighted distance</title> <meta name="description" content="Search results for: weighted distance"> <meta name="keywords" content="weighted 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="weighted 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="weighted 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> 2548</div> </div> </div> </div> <h1 class="mt-3 mb-3 text-center" style="font-size:1.6rem;">Search results for: weighted distance</h1> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">2548</span> Weighted-Distance Sliding Windows and Cooccurrence Graphs for Supporting Entity-Relationship Discovery in Unstructured Text</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Paolo%20Fantozzi">Paolo Fantozzi</a>, <a href="https://publications.waset.org/abstracts/search?q=Luigi%20Laura"> Luigi Laura</a>, <a href="https://publications.waset.org/abstracts/search?q=Umberto%20Nanni"> Umberto Nanni</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The problem of Entity relation discovery in structured data, a well covered topic in literature, consists in searching within unstructured sources (typically, text) in order to find connections among entities. These can be a whole dictionary, or a specific collection of named items. In many cases machine learning and/or text mining techniques are used for this goal. These approaches might be unfeasible in computationally challenging problems, such as processing massive data streams. A faster approach consists in collecting the cooccurrences of any two words (entities) in order to create a graph of relations - a cooccurrence graph. Indeed each cooccurrence highlights some grade of semantic correlation between the words because it is more common to have related words close each other than having them in the opposite sides of the text. Some authors have used sliding windows for such problem: they count all the occurrences within a sliding windows running over the whole text. In this paper we generalise such technique, coming up to a Weighted-Distance Sliding Window, where each occurrence of two named items within the window is accounted with a weight depending on the distance between items: a closer distance implies a stronger evidence of a relationship. We develop an experiment in order to support this intuition, by applying this technique to a data set consisting in the text of the Bible, split into verses. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=cooccurrence%20graph" title="cooccurrence graph">cooccurrence graph</a>, <a href="https://publications.waset.org/abstracts/search?q=entity%20relation%20graph" title=" entity relation graph"> entity relation graph</a>, <a href="https://publications.waset.org/abstracts/search?q=unstructured%20text" title=" unstructured text"> unstructured text</a>, <a href="https://publications.waset.org/abstracts/search?q=weighted%20distance" title=" weighted distance"> weighted distance</a> </p> <a href="https://publications.waset.org/abstracts/96407/weighted-distance-sliding-windows-and-cooccurrence-graphs-for-supporting-entity-relationship-discovery-in-unstructured-text" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/96407.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">151</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">2547</span> Notes on Frames in Weighted Hardy Spaces and Generalized Weighted Composition Operators</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Shams%20Alyusof">Shams Alyusof</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This work is to enrich the studies of the frames due to their prominent role in pure mathematics as well as in applied mathematics and many applications in computer science and engineering. Recently, there are remarkable studies of operators that preserve frames on some spaces, and this research could be considered as an extension of such studies. Indeed, this paper is to we characterize weighted composition operators that preserve frames in weighted Hardy spaces on the open unit disk. Moreover, it shows that this characterization does not apply to generalized weighted composition operators on such spaces. Nevertheless, this study could be extended to provide more specific characterizations. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=frames" title="frames">frames</a>, <a href="https://publications.waset.org/abstracts/search?q=generalized%20weighted%20composition%20operators" title=" generalized weighted composition operators"> generalized weighted composition operators</a>, <a href="https://publications.waset.org/abstracts/search?q=weighted%20Hardy%20spaces" title=" weighted Hardy spaces"> weighted Hardy spaces</a>, <a href="https://publications.waset.org/abstracts/search?q=analytic%20functions" title=" analytic functions"> analytic functions</a> </p> <a href="https://publications.waset.org/abstracts/156372/notes-on-frames-in-weighted-hardy-spaces-and-generalized-weighted-composition-operators" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/156372.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">121</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">2546</span> Some Results for F-Minimal Hypersurfaces in Manifolds with Density</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=M.%20Abdelmalek">M. Abdelmalek</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this work, we study the hypersurfaces of constant weighted mean curvature embedded in weighted manifolds. We give a condition about these hypersurfaces to be minimal. This condition is given by the ellipticity of the weighted Newton transformations. We especially prove that two compact hypersurfaces of constant weighted mean curvature embedded in space forms and with the intersection in at least a point of the boundary must be transverse. The method is based on the calculus of the matrix of the second fundamental form in a boundary point and then the matrix associated with the Newton transformations. By equality, we find the weighted elementary symmetric function on the boundary of the hypersurface. We give in the end some examples and applications. Especially in Euclidean space, we use the above result to prove the Alexandrov spherical caps conjecture for the weighted case. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=weighted%20mean%20curvature" title="weighted mean curvature">weighted mean curvature</a>, <a href="https://publications.waset.org/abstracts/search?q=weighted%20manifolds" title=" weighted manifolds"> weighted manifolds</a>, <a href="https://publications.waset.org/abstracts/search?q=ellipticity" title=" ellipticity"> ellipticity</a>, <a href="https://publications.waset.org/abstracts/search?q=Newton%20transformations" title=" Newton transformations"> Newton transformations</a> </p> <a href="https://publications.waset.org/abstracts/160174/some-results-for-f-minimal-hypersurfaces-in-manifolds-with-density" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/160174.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">93</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">2545</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">2544</span> Post-Contrast Susceptibility Weighted Imaging vs. Post-Contrast T1 Weighted Imaging for Evaluation of Brain Lesions</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Sujith%20Rajashekar%20Swamy">Sujith Rajashekar Swamy</a>, <a href="https://publications.waset.org/abstracts/search?q=Meghana%20Rajashekara%20Swamy"> Meghana Rajashekara Swamy</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Although T1-weighted gadolinium-enhanced imaging (T1-Gd) has its established clinical role in diagnosing brain lesions of infectious and metastatic origins, the use of post-contrast susceptibility-weighted imaging (SWI) has been understudied. This observational study aims to explore and compare the prominence of brain parenchymal lesions between T1-Gd and SWI-Gd images. A cross-sectional study design was utilized to analyze 58 patients with brain parenchymal lesions using T1-Gd and SWI-Gd scanning techniques. Our results indicated that SWI-Gd enhanced the conspicuity of metastatic as well as infectious brain lesions when compared to T1-Gd. Consequently, it can be used as an adjunct to T1-Gd for post-contrast imaging, thereby avoiding additional contrast administration. Improved conspicuity of brain lesions translates directly to enhanced patient outcomes, and hence SWI-Gd imaging proves useful to meet that endpoint. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=susceptibility%20weighted" title="susceptibility weighted">susceptibility weighted</a>, <a href="https://publications.waset.org/abstracts/search?q=T1%20weighted" title=" T1 weighted"> T1 weighted</a>, <a href="https://publications.waset.org/abstracts/search?q=brain%20lesions" title=" brain lesions"> brain lesions</a>, <a href="https://publications.waset.org/abstracts/search?q=gadolinium%20contrast" title=" gadolinium contrast"> gadolinium contrast</a> </p> <a href="https://publications.waset.org/abstracts/160957/post-contrast-susceptibility-weighted-imaging-vs-post-contrast-t1-weighted-imaging-for-evaluation-of-brain-lesions" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/160957.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">2543</span> A Weighted Approach to Unconstrained Iris Recognition</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Yao-Hong%20Tsai">Yao-Hong Tsai</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper presents a weighted approach to unconstrained iris recognition. Nowadays, commercial systems are usually characterized by strong acquisition constraints based on the subject’s cooperation. However, it is not always achievable for real scenarios in our daily life. Researchers have been focused on reducing these constraints and maintaining the performance of the system by new techniques at the same time. With large variation in the environment, there are two main improvements to develop the proposed iris recognition system. For solving extremely uneven lighting condition, statistic based illumination normalization is first used on eye region to increase the accuracy of iris feature. The detection of the iris image is based on Adaboost algorithm. Secondly, the weighted approach is designed by Gaussian functions according to the distance to the center of the iris. Furthermore, local binary pattern (LBP) histogram is then applied to texture classification with the weight. Experiment showed that the proposed system provided users a more flexible and feasible way to interact with the verification system through iris recognition. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=authentication" title="authentication">authentication</a>, <a href="https://publications.waset.org/abstracts/search?q=iris%20recognition" title=" iris recognition"> iris recognition</a>, <a href="https://publications.waset.org/abstracts/search?q=adaboost" title=" adaboost"> adaboost</a>, <a href="https://publications.waset.org/abstracts/search?q=local%20binary%20pattern" title=" local binary pattern"> local binary pattern</a> </p> <a href="https://publications.waset.org/abstracts/3876/a-weighted-approach-to-unconstrained-iris-recognition" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/3876.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">224</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">2542</span> Optimization of Monitoring Networks for Air Quality Management in Urban Hotspots</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Vethathirri%20Ramanujam%20Srinivasan">Vethathirri Ramanujam Srinivasan</a>, <a href="https://publications.waset.org/abstracts/search?q=S.%20M.%20Shiva%20Nagendra"> S. M. Shiva Nagendra</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Air quality management in urban areas is a serious concern in both developed and developing countries. In this regard, more number of air quality monitoring stations are planned to mitigate air pollution in urban areas. In India, Central Pollution Control Board has set up 574 air quality monitoring stations across the country and proposed to set up another 500 stations in the next few years. The number of monitoring stations for each city has been decided based on population data. The setting up of ambient air quality monitoring stations and their operation and maintenance are highly expensive. Therefore, there is a need to optimize monitoring networks for air quality management. The present paper discusses the various methods such as Indian Standards (IS) method, US EPA method and European Union (EU) method to arrive at the minimum number of air quality monitoring stations. In addition, optimization of rain-gauge method and Inverse Distance Weighted (IDW) method using Geographical Information System (GIS) are also explored in the present work for the design of air quality network in Chennai city. In summary, additionally 18 stations are required for Chennai city, and the potential monitoring locations with their corresponding land use patterns are ranked and identified from the 1km x 1km sized grids. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=air%20quality%20monitoring%20network" title="air quality monitoring network">air quality monitoring network</a>, <a href="https://publications.waset.org/abstracts/search?q=inverse%20distance%20weighted%20method" title=" inverse distance weighted method"> inverse distance weighted method</a>, <a href="https://publications.waset.org/abstracts/search?q=population%20based%20method" title=" population based method"> population based method</a>, <a href="https://publications.waset.org/abstracts/search?q=spatial%20variation" title=" spatial variation"> spatial variation</a> </p> <a href="https://publications.waset.org/abstracts/88309/optimization-of-monitoring-networks-for-air-quality-management-in-urban-hotspots" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/88309.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">189</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">2541</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">317</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">2540</span> Variogram Fitting Based on the Wilcoxon Norm</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Hazem%20Al-Mofleh">Hazem Al-Mofleh</a>, <a href="https://publications.waset.org/abstracts/search?q=John%20Daniels"> John Daniels</a>, <a href="https://publications.waset.org/abstracts/search?q=Joseph%20McKean"> Joseph McKean</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Within geostatistics research, effective estimation of the variogram points has been examined, particularly in developing robust alternatives. The parametric fit of these variogram points which eventually defines the kriging weights, however, has not received the same attention from a robust perspective. This paper proposes the use of the non-linear Wilcoxon norm over weighted non-linear least squares as a robust variogram fitting alternative. First, we introduce the concept of variogram estimation and fitting. Then, as an alternative to non-linear weighted least squares, we discuss the non-linear Wilcoxon estimator. Next, the robustness properties of the non-linear Wilcoxon are demonstrated using a contaminated spatial data set. Finally, under simulated conditions, increasing levels of contaminated spatial processes have their variograms points estimated and fit. In the fitting of these variogram points, both non-linear Weighted Least Squares and non-linear Wilcoxon fits are examined for efficiency. At all levels of contamination (including 0%), using a robust estimation and robust fitting procedure, the non-weighted Wilcoxon outperforms weighted Least Squares. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=non-linear%20wilcoxon" title="non-linear wilcoxon">non-linear wilcoxon</a>, <a href="https://publications.waset.org/abstracts/search?q=robust%20estimation" title=" robust estimation"> robust estimation</a>, <a href="https://publications.waset.org/abstracts/search?q=variogram%20estimation" title=" variogram estimation"> variogram estimation</a>, <a href="https://publications.waset.org/abstracts/search?q=wilcoxon%20norm" title=" wilcoxon norm"> wilcoxon norm</a> </p> <a href="https://publications.waset.org/abstracts/50377/variogram-fitting-based-on-the-wilcoxon-norm" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/50377.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">458</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">2539</span> A Comparative Analysis of Grade Weighted Average and Comprehensive Examination Result of Non Board Passers and Board Passers</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Rob%20Gesley%20Capistrano">Rob Gesley Capistrano</a>, <a href="https://publications.waset.org/abstracts/search?q=Jasper%20James%20Isaac"> Jasper James Isaac</a>, <a href="https://publications.waset.org/abstracts/search?q=Rose%20Mae%20Moralda"> Rose Mae Moralda</a>, <a href="https://publications.waset.org/abstracts/search?q=Therese%20Anne%20Peleo"> Therese Anne Peleo</a>, <a href="https://publications.waset.org/abstracts/search?q=Danica%20Rillo"> Danica Rillo</a>, <a href="https://publications.waset.org/abstracts/search?q=Maria%20Virginia%20Santillian"> Maria Virginia Santillian</a> </p> <p class="card-text"><strong>Abstract:</strong></p> One of the valuable things that shows the intelligence among individuals is the academic background specifically their Grade Weighted Average and the significant result of the Comprehensive Examination. The general objective of the researchers to this study is to determine if there is a significant difference between General Weighted Average and Comprehensive Examination Result of Psychometrician Board Passers and Non-Board Passers. The respondents of this study composed of board passers and non-board passers. The researchers used purposive sampling technique. The result utilized by using T-test Independent Sample to determine the comparison of General Weighted Average and Comprehensive Examination Result of Board Passers and Non Board Passers. At the end, it concluded that the General Weighted Average of Board Passers and Non-Board Passers shows that there is no significant difference, but the average showed a minimal variation. The Comprehensive Examination Result of Board Passers and Non-Board Passers result revealed that there is a significant difference. The performance of comprehensive examination that will test the overall knowledge of an individual and will determine whose more proficient will likely to have a higher score. The result of the comprehensive examination had an impact in the passing performance of board examination. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=board%20passers" title="board passers">board passers</a>, <a href="https://publications.waset.org/abstracts/search?q=comprehensive%20examination%20result" title=" comprehensive examination result"> comprehensive examination result</a>, <a href="https://publications.waset.org/abstracts/search?q=grade%20weighted%20average" title=" grade weighted average"> grade weighted average</a>, <a href="https://publications.waset.org/abstracts/search?q=non%20board%20passers" title=" non board passers"> non board passers</a> </p> <a href="https://publications.waset.org/abstracts/101314/a-comparative-analysis-of-grade-weighted-average-and-comprehensive-examination-result-of-non-board-passers-and-board-passers" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/101314.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">189</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">2538</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">2537</span> Weighted G2 Multi-Degree Reduction of Bezier Curves</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Salisu%20ibrahim">Salisu ibrahim</a>, <a href="https://publications.waset.org/abstracts/search?q=Abdalla%20Rababah"> Abdalla Rababah</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this research, we use Weighted G2-Multi-degree reduction of Bezier curve of degree n to a Bezier curve of degree m, m < n. The degree reduction of Bezier curves is used to represent a given Bezier curve of n by a Bezier curve of degree m, m < n. Exact degree reduction is not possible, and degree reduction is approximate process in nature. We derive a weighted degree reducing method that is geometrically continuous at the end points. Different norms will be considered, several error minimizations will be given. The proposed methods produce error function that are less than the errors of existing methods. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=Bezier%20curves" title="Bezier curves">Bezier curves</a>, <a href="https://publications.waset.org/abstracts/search?q=multiple%20degree%20reduction" title=" multiple degree reduction"> multiple degree reduction</a>, <a href="https://publications.waset.org/abstracts/search?q=geometric%20continuity" title=" geometric continuity"> geometric continuity</a>, <a href="https://publications.waset.org/abstracts/search?q=error%20function" title=" error function"> error function</a> </p> <a href="https://publications.waset.org/abstracts/18669/weighted-g2-multi-degree-reduction-of-bezier-curves" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/18669.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">481</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">2536</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">2535</span> Solving Process Planning, Weighted Earliest Due Date Scheduling and Weighted Due Date Assignment Using Simulated Annealing and Evolutionary Strategies</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Halil%20Ibrahim%20Demir">Halil Ibrahim Demir</a>, <a href="https://publications.waset.org/abstracts/search?q=Abdullah%20Hulusi%20Kokcam"> Abdullah Hulusi Kokcam</a>, <a href="https://publications.waset.org/abstracts/search?q=Fuat%20Simsir"> Fuat Simsir</a>, <a href="https://publications.waset.org/abstracts/search?q=%C3%96zer%20Uygun"> Özer Uygun</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Traditionally, three important manufacturing functions which are process planning, scheduling and due-date assignment are performed sequentially and separately. Although there are numerous works on the integration of process planning and scheduling and plenty of works focusing on scheduling with due date assignment, there are only a few works on integrated process planning, scheduling and due-date assignment. Although due-dates are determined without taking into account of weights of the customers in the literature, here weighted due-date assignment is employed to get better performance. Jobs are scheduled according to weighted earliest due date dispatching rule and due dates are determined according to some popular due date assignment methods by taking into account of the weights of each job. Simulated Annealing, Evolutionary Strategies, Random Search, hybrid of Random Search and Simulated Annealing, and hybrid of Random Search and Evolutionary Strategies, are applied as solution techniques. Three important manufacturing functions are integrated step-by-step and higher integration levels are found better. Search meta-heuristics are found to be very useful while improving performance measure. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=process%20planning" title="process planning">process planning</a>, <a href="https://publications.waset.org/abstracts/search?q=weighted%20scheduling" title=" weighted scheduling"> weighted scheduling</a>, <a href="https://publications.waset.org/abstracts/search?q=weighted%20due-date%20assignment" title=" weighted due-date assignment"> weighted due-date assignment</a>, <a href="https://publications.waset.org/abstracts/search?q=simulated%20annealing" title=" simulated annealing"> simulated annealing</a>, <a href="https://publications.waset.org/abstracts/search?q=evolutionary%20strategies" title=" evolutionary strategies"> evolutionary strategies</a>, <a href="https://publications.waset.org/abstracts/search?q=hybrid%20searches" title=" hybrid searches"> hybrid searches</a> </p> <a href="https://publications.waset.org/abstracts/67706/solving-process-planning-weighted-earliest-due-date-scheduling-and-weighted-due-date-assignment-using-simulated-annealing-and-evolutionary-strategies" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/67706.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">462</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">2534</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">2533</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">2532</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">2531</span> Solving Process Planning, Weighted Apparent Tardiness Cost Dispatching, and Weighted Processing plus Weight Due-Date Assignment Simultaneously Using a Hybrid Search</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Halil%20Ibrahim%20Demir">Halil Ibrahim Demir</a>, <a href="https://publications.waset.org/abstracts/search?q=Caner%20Erden"> Caner Erden</a>, <a href="https://publications.waset.org/abstracts/search?q=Abdullah%20Hulusi%20Kokcam"> Abdullah Hulusi Kokcam</a>, <a href="https://publications.waset.org/abstracts/search?q=Mumtaz%20Ipek"> Mumtaz Ipek</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Process planning, scheduling, and due date assignment are three important manufacturing functions which are studied independently in literature. There are hundreds of works on IPPS and SWDDA problems but a few works on IPPSDDA problem. Integrating these three functions is very crucial due to the high relationship between them. Since the scheduling problem is in the NP-Hard problem class without any integration, an integrated problem is even harder to solve. This study focuses on the integration of these functions. Sum of weighted tardiness, earliness, and due date related costs are used as a penalty function. Random search and hybrid metaheuristics are used to solve the integrated problem. Marginal improvement in random search is very high in the early iterations and reduces enormously in later iterations. At that point directed search contribute to marginal improvement more than random search. In this study, random and genetic search methods are combined to find better solutions. Results show that overall performance becomes better as the integration level increases. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=process%20planning" title="process planning">process planning</a>, <a href="https://publications.waset.org/abstracts/search?q=genetic%20algorithm" title=" genetic algorithm"> genetic algorithm</a>, <a href="https://publications.waset.org/abstracts/search?q=hybrid%20search" title=" hybrid search"> hybrid search</a>, <a href="https://publications.waset.org/abstracts/search?q=random%20search" title=" random search"> random search</a>, <a href="https://publications.waset.org/abstracts/search?q=weighted%20due-date%20assignment" title=" weighted due-date assignment"> weighted due-date assignment</a>, <a href="https://publications.waset.org/abstracts/search?q=weighted%20scheduling" title=" weighted scheduling"> weighted scheduling</a> </p> <a href="https://publications.waset.org/abstracts/68613/solving-process-planning-weighted-apparent-tardiness-cost-dispatching-and-weighted-processing-plus-weight-due-date-assignment-simultaneously-using-a-hybrid-search" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/68613.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">361</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">2530</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">2529</span> Approximation by Generalized Lupaş-Durrmeyer Operators with Two Parameter α and β</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Preeti%20Sharma">Preeti Sharma</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper deals with the Stancu type generalization of Lupaş-Durrmeyer operators. We establish some direct results in the polynomial weighted space of continuous functions defined on the interval [0, 1]. Also, Voronovskaja type theorem is studied. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=Lupas-Durrmeyer%20operators" title="Lupas-Durrmeyer operators">Lupas-Durrmeyer operators</a>, <a href="https://publications.waset.org/abstracts/search?q=polya%20distribution" title=" polya distribution"> polya distribution</a>, <a href="https://publications.waset.org/abstracts/search?q=weighted%20approximation" title=" weighted approximation"> weighted approximation</a>, <a href="https://publications.waset.org/abstracts/search?q=rate%20of%20convergence" title=" rate of convergence"> rate of convergence</a>, <a href="https://publications.waset.org/abstracts/search?q=modulus%20of%20continuity" title=" modulus of continuity"> modulus of continuity</a> </p> <a href="https://publications.waset.org/abstracts/47660/approximation-by-generalized-lupas-durrmeyer-operators-with-two-parameter-a-and-v" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/47660.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">345</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">2528</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">2527</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">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">2526</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">2525</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">2524</span> Local Directional Encoded Derivative Binary Pattern Based Coral Image Classification Using Weighted Distance Gray Wolf Optimization Algorithm</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Annalakshmi%20G.">Annalakshmi G.</a>, <a href="https://publications.waset.org/abstracts/search?q=Sakthivel%20Murugan%20S."> Sakthivel Murugan S.</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper presents a local directional encoded derivative binary pattern (LDEDBP) feature extraction method that can be applied for the classification of submarine coral reef images. The classification of coral reef images using texture features is difficult due to the dissimilarities in class samples. In coral reef image classification, texture features are extracted using the proposed method called local directional encoded derivative binary pattern (LDEDBP). The proposed approach extracts the complete structural arrangement of the local region using local binary batten (LBP) and also extracts the edge information using local directional pattern (LDP) from the edge response available in a particular region, thereby achieving extra discriminative feature value. Typically the LDP extracts the edge details in all eight directions. The process of integrating edge responses along with the local binary pattern achieves a more robust texture descriptor than the other descriptors used in texture feature extraction methods. Finally, the proposed technique is applied to an extreme learning machine (ELM) method with a meta-heuristic algorithm known as weighted distance grey wolf optimizer (GWO) to optimize the input weight and biases of single-hidden-layer feed-forward neural networks (SLFN). In the empirical results, ELM-WDGWO demonstrated their better performance in terms of accuracy on all coral datasets, namely RSMAS, EILAT, EILAT2, and MLC, compared with other state-of-the-art algorithms. The proposed method achieves the highest overall classification accuracy of 94% compared to the other state of art methods. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=feature%20extraction" title="feature extraction">feature extraction</a>, <a href="https://publications.waset.org/abstracts/search?q=local%20directional%20pattern" title=" local directional pattern"> local directional pattern</a>, <a href="https://publications.waset.org/abstracts/search?q=ELM%20classifier" title=" ELM classifier"> ELM classifier</a>, <a href="https://publications.waset.org/abstracts/search?q=GWO%20optimization" title=" GWO optimization"> GWO optimization</a> </p> <a href="https://publications.waset.org/abstracts/142439/local-directional-encoded-derivative-binary-pattern-based-coral-image-classification-using-weighted-distance-gray-wolf-optimization-algorithm" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/142439.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">163</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">2523</span> Integrating Process Planning, WMS Dispatching, and WPPW Weighted Due Date Assignment Using a Genetic Algorithm</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Halil%20Ibrahim%20Demir">Halil Ibrahim Demir</a>, <a href="https://publications.waset.org/abstracts/search?q=Tar%C4%B1k%20Cakar"> Tarık Cakar</a>, <a href="https://publications.waset.org/abstracts/search?q=Ibrahim%20Cil"> Ibrahim Cil</a>, <a href="https://publications.waset.org/abstracts/search?q=Muharrem%20Dugenci"> Muharrem Dugenci</a>, <a href="https://publications.waset.org/abstracts/search?q=Caner%20Erden"> Caner Erden</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Conventionally, process planning, scheduling, and due-date assignment functions are performed separately and sequentially. The interdependence of these functions requires integration. Although integrated process planning and scheduling, and scheduling with due date assignment problems are popular research topics, only a few works address the integration of these three functions. This work focuses on the integration of process planning, WMS scheduling, and WPPW due date assignment. Another novelty of this work is the use of a weighted due date assignment. In the literature, due dates are generally assigned without considering the importance of customers. However, in this study, more important customers get closer due dates. Typically, only tardiness is punished, but the JIT philosophy punishes both earliness and tardiness. In this study, all weighted earliness, tardiness, and due date related costs are penalized. As no customer desires distant due dates, such distant due dates should be penalized. In this study, various levels of integration of these three functions are tested and genetic search and random search are compared both with each other and with ordinary solutions. Higher integration levels are superior, while search is always useful. Genetic searches outperformed random searches. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=process%20planning" title="process planning">process planning</a>, <a href="https://publications.waset.org/abstracts/search?q=weighted%20scheduling" title=" weighted scheduling"> weighted scheduling</a>, <a href="https://publications.waset.org/abstracts/search?q=weighted%20due-date%20assignment" title=" weighted due-date assignment"> weighted due-date assignment</a>, <a href="https://publications.waset.org/abstracts/search?q=genetic%20algorithm" title=" genetic algorithm"> genetic algorithm</a>, <a href="https://publications.waset.org/abstracts/search?q=random%20search" title=" random search"> random search</a> </p> <a href="https://publications.waset.org/abstracts/51544/integrating-process-planning-wms-dispatching-and-wppw-weighted-due-date-assignment-using-a-genetic-algorithm" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/51544.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">394</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">2522</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">350</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">2521</span> Solving Weighted Number of Operation Plus Processing Time Due-Date Assignment, Weighted Scheduling and Process Planning Integration Problem Using Genetic and Simulated Annealing Search Methods</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Halil%20Ibrahim%20Demir">Halil Ibrahim Demir</a>, <a href="https://publications.waset.org/abstracts/search?q=Caner%20Erden"> Caner Erden</a>, <a href="https://publications.waset.org/abstracts/search?q=Mumtaz%20Ipek"> Mumtaz Ipek</a>, <a href="https://publications.waset.org/abstracts/search?q=Ozer%20Uygun"> Ozer Uygun</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Traditionally, the three important manufacturing functions, which are process planning, scheduling and due-date assignment, are performed separately and sequentially. For couple of decades, hundreds of studies are done on integrated process planning and scheduling problems and numerous researches are performed on scheduling with due date assignment problem, but unfortunately the integration of these three important functions are not adequately addressed. Here, the integration of these three important functions is studied by using genetic, random-genetic hybrid, simulated annealing, random-simulated annealing hybrid and random search techniques. As well, the importance of the integration of these three functions and the power of meta-heuristics and of hybrid heuristics are studied. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=process%20planning" title="process planning">process planning</a>, <a href="https://publications.waset.org/abstracts/search?q=weighted%20scheduling" title=" weighted scheduling"> weighted scheduling</a>, <a href="https://publications.waset.org/abstracts/search?q=weighted%20due-date%20assignment" title=" weighted due-date assignment"> weighted due-date assignment</a>, <a href="https://publications.waset.org/abstracts/search?q=genetic%20search" title=" genetic search"> genetic search</a>, <a href="https://publications.waset.org/abstracts/search?q=simulated%20annealing" title=" simulated annealing"> simulated annealing</a>, <a href="https://publications.waset.org/abstracts/search?q=hybrid%20meta-heuristics" title=" hybrid meta-heuristics"> hybrid meta-heuristics</a> </p> <a href="https://publications.waset.org/abstracts/57629/solving-weighted-number-of-operation-plus-processing-time-due-date-assignment-weighted-scheduling-and-process-planning-integration-problem-using-genetic-and-simulated-annealing-search-methods" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/57629.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">469</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">2520</span> Weighted Rank Regression with Adaptive Penalty Function</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Kang-Mo%20Jung">Kang-Mo Jung</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The use of regularization for statistical methods has become popular. The least absolute shrinkage and selection operator (LASSO) framework has become the standard tool for sparse regression. However, it is well known that the LASSO is sensitive to outliers or leverage points. We consider a new robust estimation which is composed of the weighted loss function of the pairwise difference of residuals and the adaptive penalty function regulating the tuning parameter for each variable. Rank regression is resistant to regression outliers, but not to leverage points. By adopting a weighted loss function, the proposed method is robust to leverage points of the predictor variable. Furthermore, the adaptive penalty function gives us good statistical properties in variable selection such as oracle property and consistency. We develop an efficient algorithm to compute the proposed estimator using basic functions in program R. We used an optimal tuning parameter based on the Bayesian information criterion (BIC). Numerical simulation shows that the proposed estimator is effective for analyzing real data set and contaminated data. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=adaptive%20penalty%20function" title="adaptive penalty function">adaptive penalty function</a>, <a href="https://publications.waset.org/abstracts/search?q=robust%20penalized%20regression" title=" robust penalized regression"> robust penalized regression</a>, <a href="https://publications.waset.org/abstracts/search?q=variable%20selection" title=" variable selection"> variable selection</a>, <a href="https://publications.waset.org/abstracts/search?q=weighted%20rank%20regression" title=" weighted rank regression"> weighted rank regression</a> </p> <a href="https://publications.waset.org/abstracts/79449/weighted-rank-regression-with-adaptive-penalty-function" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/79449.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">2519</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> <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=weighted%20distance&page=2">2</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=weighted%20distance&page=3">3</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=weighted%20distance&page=4">4</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=weighted%20distance&page=5">5</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=weighted%20distance&page=6">6</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=weighted%20distance&page=7">7</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=weighted%20distance&page=8">8</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=weighted%20distance&page=9">9</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=weighted%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=weighted%20distance&page=84">84</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=weighted%20distance&page=85">85</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=weighted%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>