CINXE.COM
Search results for: distance constraints
<!DOCTYPE html> <html lang="en" dir="ltr"> <head> <!-- Google tag (gtag.js) --> <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> <!-- Yandex.Metrika counter --> <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> <!-- /Yandex.Metrika counter --> <!-- Matomo --> <!-- End Matomo Code --> <title>Search results for: distance constraints</title> <meta name="description" content="Search results for: distance constraints"> <meta name="keywords" content="distance constraints"> <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="distance constraints" 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="distance constraints"> <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> 3193</div> </div> </div> </div> <h1 class="mt-3 mb-3 text-center" style="font-size:1.6rem;">Search results for: distance constraints</h1> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">3193</span> Solutions to Probabilistic Constrained Optimal Control Problems Using Concentration Inequalities</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Tomoaki%20Hashimoto">Tomoaki Hashimoto</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Recently, optimal control problems subject to probabilistic constraints have attracted much attention in many research field. Although probabilistic constraints are generally intractable in optimization problems, several methods haven been proposed to deal with probabilistic constraints. In most methods, probabilistic constraints are transformed to deterministic constraints that are tractable in optimization problems. This paper examines a method for transforming probabilistic constraints into deterministic constraints for a class of probabilistic constrained optimal control problems. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=optimal%20control" title="optimal control">optimal control</a>, <a href="https://publications.waset.org/abstracts/search?q=stochastic%20systems" title=" stochastic systems"> stochastic systems</a>, <a href="https://publications.waset.org/abstracts/search?q=discrete-time%20systems" title=" discrete-time systems"> discrete-time systems</a>, <a href="https://publications.waset.org/abstracts/search?q=probabilistic%20constraints" title=" probabilistic constraints"> probabilistic constraints</a> </p> <a href="https://publications.waset.org/abstracts/57973/solutions-to-probabilistic-constrained-optimal-control-problems-using-concentration-inequalities" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/57973.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">278</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">3192</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">3191</span> Semi-Supervised Hierarchical Clustering Given a Reference Tree of Labeled Documents</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Ying%20Zhao">Ying Zhao</a>, <a href="https://publications.waset.org/abstracts/search?q=Xingyan%20Bin"> Xingyan Bin</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Semi-supervised clustering algorithms have been shown effective to improve clustering process with even limited supervision. However, semi-supervised hierarchical clustering remains challenging due to the complexities of expressing constraints for agglomerative clustering algorithms. This paper proposes novel semi-supervised agglomerative clustering algorithms to build a hierarchy based on a known reference tree. We prove that by enforcing distance constraints defined by a reference tree during the process of hierarchical clustering, the resultant tree is guaranteed to be consistent with the reference tree. We also propose a framework that allows the hierarchical tree generation be aware of levels of levels of the agglomerative tree under creation, so that metric weights can be learned and adopted at each level in a recursive fashion. The experimental evaluation shows that the additional cost of our contraint-based semi-supervised hierarchical clustering algorithm (HAC) is negligible, and our combined semi-supervised HAC algorithm outperforms the state-of-the-art algorithms on real-world datasets. The experiments also show that our proposed methods can improve clustering performance even with a small number of unevenly distributed labeled data. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=semi-supervised%20clustering" title="semi-supervised clustering">semi-supervised clustering</a>, <a href="https://publications.waset.org/abstracts/search?q=hierarchical%0D%0Aagglomerative%20clustering" title=" hierarchical agglomerative clustering"> hierarchical agglomerative clustering</a>, <a href="https://publications.waset.org/abstracts/search?q=reference%20trees" title=" reference trees"> reference trees</a>, <a href="https://publications.waset.org/abstracts/search?q=distance%20constraints" title=" distance constraints "> distance constraints </a> </p> <a href="https://publications.waset.org/abstracts/19478/semi-supervised-hierarchical-clustering-given-a-reference-tree-of-labeled-documents" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/19478.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">547</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">3190</span> A Survey on Compression Methods for Table Constraints</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=N.%20Gharbi">N. Gharbi</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Constraint Satisfaction problems are mathematical problems that are often used to model many real-world problems for which we look if there exists a solution satisfying all its constraints. Table constraints are important for modeling parts of many problems since they list all combinations of allowed or forbidden values. However, they admit practical limitations because they are sometimes too large to be represented in a direct way. In this paper, we present a survey of the different categories of the proposed approaches to compress table constraints in order to reduce both space and time complexities. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=constraint%20programming" title="constraint programming">constraint programming</a>, <a href="https://publications.waset.org/abstracts/search?q=compression" title=" compression"> compression</a>, <a href="https://publications.waset.org/abstracts/search?q=data%20mining" title=" data mining"> data mining</a>, <a href="https://publications.waset.org/abstracts/search?q=table%20constraints" title=" table constraints"> table constraints</a> </p> <a href="https://publications.waset.org/abstracts/49933/a-survey-on-compression-methods-for-table-constraints" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/49933.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">325</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">3189</span> The Role of Interactive White Boards towards Achieving Transactional Learning in the Context of Open Distance Learning</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=M.%20Van%20Zyl">M. Van Zyl</a>, <a href="https://publications.waset.org/abstracts/search?q=M.%20H.%20A.%20Combrinck"> M. H. A. Combrinck</a>, <a href="https://publications.waset.org/abstracts/search?q=E.%20J.%20Spamer"> E. J. Spamer</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Due to the need for higher education in South Africa, the country experiences a rapid growth in open distance learning, especially in rural areas. It is difficult for people to enrol fulltime at contact universities, owing to work and financial constraints. The Unit for Open Distance Learning (UODL) at the North-West University (NWU), Potchefstroom campus, South Africa was established in 2013 with its main function to deliver open distance learning programmes to 30 000 students from the Faculties of Education Sciences, Theology and Health Sciences. With the use of interactive whiteboards (IWBs), the NWU and UODL are now able to deliver lectures to students concurrently at 60 regional open learning centres across Southern Africa as well as to an unlimited number of individuals with Internet access worldwide. Although IWBs are not new, our initiative is to use them more extensively in order to create more contact between lecturers and students. To be able to ensure and enhance quality education it is vital to determine students’ perceptions on the delivery of programmes by means of IWBs. Therefore, the aim of the study is to explore students’ perceptions for the use of IWBs in the delivery of programmes in terms of Moore’s Theory of Transactional Distance. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=interactive%20white%20board" title="interactive white board">interactive white board</a>, <a href="https://publications.waset.org/abstracts/search?q=open%20distance%20learning" title=" open distance learning"> open distance learning</a>, <a href="https://publications.waset.org/abstracts/search?q=technology" title=" technology"> technology</a>, <a href="https://publications.waset.org/abstracts/search?q=transactional%20learning" title=" transactional learning"> transactional learning</a> </p> <a href="https://publications.waset.org/abstracts/34975/the-role-of-interactive-white-boards-towards-achieving-transactional-learning-in-the-context-of-open-distance-learning" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/34975.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">454</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">3188</span> Synchronous Courses Attendance in Distance Higher Education: Case Study of a Computer Science Department</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Thierry%20Eude">Thierry Eude</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The use of videoconferencing platforms adapted to teaching offers students the opportunity to take distance education courses in much the same way as traditional in-class training. The sessions can be recorded and they allow students the option of following the courses synchronously or asynchronously. Three typical profiles can then be distinguished: students who choose to follow the courses synchronously, students who could attend the course in synchronous mode but choose to follow the session off-line, and students who follow the course asynchronously as they cannot attend the course when it is offered because of professional or personal constraints. Our study consists of observing attendance at all distance education courses offered in the synchronous mode by the Computer Science and Software Engineering Department at Laval University during 10 consecutive semesters. The aim is to identify factors that influence students in their choice of attending the distance courses in synchronous mode. It was found that participation tends to be relatively stable over the years for any one semester (fall, winter summer) and is similar from one course to another, although students may be increasingly familiar with the synchronous distance education courses. Average participation is around 28%. There may be deviations, but they concern only a few courses during certain semesters, suggesting that these deviations would only have occurred because of the composition of particular promotions during specific semesters. Furthermore, course schedules have a great influence on the attendance rate. The highest rates are all for courses which are scheduled outside office hours. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=attendance" title="attendance">attendance</a>, <a href="https://publications.waset.org/abstracts/search?q=distance%20undergraduate%20education%20in%20computer%20science" title=" distance undergraduate education in computer science"> distance undergraduate education in computer science</a>, <a href="https://publications.waset.org/abstracts/search?q=student%20behavior" title=" student behavior"> student behavior</a>, <a href="https://publications.waset.org/abstracts/search?q=synchronous%20e-learning" title=" synchronous e-learning"> synchronous e-learning</a> </p> <a href="https://publications.waset.org/abstracts/57165/synchronous-courses-attendance-in-distance-higher-education-case-study-of-a-computer-science-department" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/57165.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">284</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">3187</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">3186</span> Conservativeness of Probabilistic Constrained Optimal Control Method for Unknown Probability Distribution</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Tomoaki%20Hashimoto">Tomoaki Hashimoto</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In recent decades, probabilistic constrained optimal control problems have attracted much attention in many research field. Although probabilistic constraints are generally intractable in an optimization problem, several tractable methods haven been proposed to handle probabilistic constraints. In most methods, probabilistic constraints are reduced to deterministic constraints that are tractable in an optimization problem. However, there is a gap between the transformed deterministic constraints in case of known and unknown probability distribution. This paper examines the conservativeness of probabilistic constrained optimization method with the unknown probability distribution. The objective of this paper is to provide a quantitative assessment of the conservatism for tractable constraints in probabilistic constrained optimization with the unknown probability distribution. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=optimal%20control" title="optimal control">optimal control</a>, <a href="https://publications.waset.org/abstracts/search?q=stochastic%20systems" title=" stochastic systems"> stochastic systems</a>, <a href="https://publications.waset.org/abstracts/search?q=discrete%20time%20systems" title=" discrete time systems"> discrete time systems</a>, <a href="https://publications.waset.org/abstracts/search?q=probabilistic%20constraints" title=" probabilistic constraints"> probabilistic constraints</a> </p> <a href="https://publications.waset.org/abstracts/35585/conservativeness-of-probabilistic-constrained-optimal-control-method-for-unknown-probability-distribution" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/35585.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">580</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">3185</span> Business Constraints and Growth Potential of Smes: Case Study of Electrical Industry in Pakistan</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Muhammad%20Waseem%20Akram">Muhammad Waseem Akram</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The current study attempts to analyze the impact of business constraints on the growth potential and performance of Small and Medium Enterprises (SMEs) in the electrical industry of Pakistan. Primary data have been utilized for the study collected from the electrical industry cluster in Sargodha, Pakistan. OLS regression is used to assess the impact of business constraints on the performance of SMEs by controlling the effect of Technology Level, Innovations, and Firm Size. To associate business constraints with the growth potential of SMEs, the study utilized Tetrachoric Correlation and Logistic Regression. Findings reveal that all the business constraints negatively affect the performance of SMEs in the electrical industry except Political Instability. Results of Tetrachoric Correlation show that all the business constraints are negatively correlated with the growth potential of SMEs. Logistic Regression results show that Energy Constraint, Inflation and Price Instability, and Bad Business Practices, all three business constraints cause to reduce the probability of income growth in sample SMEs. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=SMEs" title="SMEs">SMEs</a>, <a href="https://publications.waset.org/abstracts/search?q=business%20constraints" title=" business constraints"> business constraints</a>, <a href="https://publications.waset.org/abstracts/search?q=performance" title=" performance"> performance</a>, <a href="https://publications.waset.org/abstracts/search?q=growth%20potential" title=" growth potential"> growth potential</a> </p> <a href="https://publications.waset.org/abstracts/119139/business-constraints-and-growth-potential-of-smes-case-study-of-electrical-industry-in-pakistan" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/119139.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">169</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">3184</span> Preserving Privacy in Workflow Delegation Models</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Noha%20Nagy">Noha Nagy</a>, <a href="https://publications.waset.org/abstracts/search?q=Hoda%20Mokhtar"> Hoda Mokhtar</a>, <a href="https://publications.waset.org/abstracts/search?q=Mohamed%20El%20Sherkawi"> Mohamed El Sherkawi</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The popularity of workflow delegation models and the increasing number of workflow provenance-aware systems motivate the need for finding more strict delegation models. Such models combine different approaches for enhanced security and respecting workflow privacy. Although modern enterprises seek conformance to workflow constraints to ensure correctness of their work, these constraints pose a threat to security, because these constraints can be good seeds for attacking privacy even in secure models. This paper introduces a comprehensive Workflow Delegation Model (WFDM) that utilizes provenance and workflow constraints to prevent malicious delegate from attacking workflow privacy as well as extending the delegation functionalities. In addition, we argue the need for exploiting workflow constraints to improve workflow security models. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=workflow%20delegation%20models" title="workflow delegation models">workflow delegation models</a>, <a href="https://publications.waset.org/abstracts/search?q=secure%20workflow" title=" secure workflow"> secure workflow</a>, <a href="https://publications.waset.org/abstracts/search?q=workflow%20privacy" title=" workflow privacy"> workflow privacy</a>, <a href="https://publications.waset.org/abstracts/search?q=workflow%20provenance" title=" workflow provenance"> workflow provenance</a> </p> <a href="https://publications.waset.org/abstracts/47106/preserving-privacy-in-workflow-delegation-models" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/47106.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">331</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">3183</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">3182</span> Polarimetric Synthetic Aperture Radar Data Classification Using Support Vector Machine and Mahalanobis Distance</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Najoua%20El%20Hajjaji%20El%20Idrissi">Najoua El Hajjaji El Idrissi</a>, <a href="https://publications.waset.org/abstracts/search?q=Necip%20Gokhan%20Kasapoglu"> Necip Gokhan Kasapoglu</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Polarimetric Synthetic Aperture Radar-based imaging is a powerful technique used for earth observation and classification of surfaces. Forest evolution has been one of the vital areas of attention for the remote sensing experts. The information about forest areas can be achieved by remote sensing, whether by using active radars or optical instruments. However, due to several weather constraints, such as cloud cover, limited information can be recovered using optical data and for that reason, Polarimetric Synthetic Aperture Radar (PolSAR) is used as a powerful tool for forestry inventory. In this [14paper, we applied support vector machine (SVM) and Mahalanobis distance to the fully polarimetric AIRSAR P, L, C-bands data from the Nezer forest areas, the classification is based in the separation of different tree ages. The classification results were evaluated and the results show that the SVM performs better than the Mahalanobis distance and SVM achieves approximately 75% accuracy. This result proves that SVM classification can be used as a useful method to evaluate fully polarimetric SAR data with sufficient value of accuracy. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=classification" title="classification">classification</a>, <a href="https://publications.waset.org/abstracts/search?q=synthetic%20aperture%20radar" title=" synthetic aperture radar"> synthetic aperture radar</a>, <a href="https://publications.waset.org/abstracts/search?q=SAR%20polarimetry" title=" SAR polarimetry"> SAR polarimetry</a>, <a href="https://publications.waset.org/abstracts/search?q=support%20vector%20machine" title=" support vector machine"> support vector machine</a>, <a href="https://publications.waset.org/abstracts/search?q=mahalanobis%20distance" title=" mahalanobis distance"> mahalanobis distance</a> </p> <a href="https://publications.waset.org/abstracts/118435/polarimetric-synthetic-aperture-radar-data-classification-using-support-vector-machine-and-mahalanobis-distance" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/118435.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">133</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">3181</span> Near Optimal Closed-Loop Guidance Gains Determination for Vector Guidance Law, from Impact Angle Errors and Miss Distance Considerations</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Karthikeyan%20Kalirajan">Karthikeyan Kalirajan</a>, <a href="https://publications.waset.org/abstracts/search?q=Ashok%20Joshi"> Ashok Joshi</a> </p> <p class="card-text"><strong>Abstract:</strong></p> An optimization problem is to setup to maximize the terminal kinetic energy of a maneuverable reentry vehicle (MaRV). The target location, the impact angle is given as constraints. The MaRV uses an explicit guidance law called Vector guidance. This law has two gains which are taken as decision variables. The problem is to find the optimal value of these gains which will result in minimum miss distance and impact angle error. Using a simple 3DOF non-rotating flat earth model and Lockheed martin HP-MARV as the reentry vehicle, the nature of solutions of the optimization problem is studied. This is achieved by carrying out a parametric study for a range of closed loop gain values and the corresponding impact angle error and the miss distance values are generated. The results show that there are well defined lower and upper bounds on the gains that result in near optimal terminal guidance solution. It is found from this study, that there exist common permissible regions (values of gains) where all constraints are met. Moreover, the permissible region lies between flat regions and hence the optimization algorithm has to be chosen carefully. It is also found that, only one of the gain values is independent and that the other dependent gain value is related through a simple straight-line expression. Moreover, to reduce the computational burden of finding the optimal value of two gains, a guidance law called Diveline guidance is discussed, which uses single gain. The derivation of the Diveline guidance law from Vector guidance law is discussed in this paper. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=Marv%20guidance" title="Marv guidance">Marv guidance</a>, <a href="https://publications.waset.org/abstracts/search?q=reentry%20trajectory" title=" reentry trajectory"> reentry trajectory</a>, <a href="https://publications.waset.org/abstracts/search?q=trajectory%20optimization" title=" trajectory optimization"> trajectory optimization</a>, <a href="https://publications.waset.org/abstracts/search?q=guidance%20gain%20selection" title=" guidance gain selection"> guidance gain selection</a> </p> <a href="https://publications.waset.org/abstracts/35646/near-optimal-closed-loop-guidance-gains-determination-for-vector-guidance-law-from-impact-angle-errors-and-miss-distance-considerations" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/35646.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">427</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">3180</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">3179</span> Portfolio Selection with Constraints on Trading Frequency</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Min%20Dai">Min Dai</a>, <a href="https://publications.waset.org/abstracts/search?q=Hong%20Liu"> Hong Liu</a>, <a href="https://publications.waset.org/abstracts/search?q=Shuaijie%20Qian"> Shuaijie Qian</a> </p> <p class="card-text"><strong>Abstract:</strong></p> We study a portfolio selection problem of an investor who faces constraints on rebalancing frequency, which is common in pension fund investment. We formulate it as a multiple optimal stopping problem and utilize the dynamic programming principle. By numerically solving the corresponding Hamilton-Jacobi-Bellman (HJB) equation, we find a series of free boundaries characterizing optimal strategy, and the constraints significantly impact the optimal strategy. Even in the absence of transaction costs, there is a no-trading region, depending on the number of the remaining trading chances. We also find that the equivalent wealth loss caused by the constraints is large. In conclusion, our model clarifies the impact of the constraints on transaction frequency on the optimal strategy. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=portfolio%20selection" title="portfolio selection">portfolio selection</a>, <a href="https://publications.waset.org/abstracts/search?q=rebalancing%20frequency" title=" rebalancing frequency"> rebalancing frequency</a>, <a href="https://publications.waset.org/abstracts/search?q=optimal%20strategy" title=" optimal strategy"> optimal strategy</a>, <a href="https://publications.waset.org/abstracts/search?q=free%20boundary" title=" free boundary"> free boundary</a>, <a href="https://publications.waset.org/abstracts/search?q=optimal%20stopping" title=" optimal stopping"> optimal stopping</a> </p> <a href="https://publications.waset.org/abstracts/171745/portfolio-selection-with-constraints-on-trading-frequency" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/171745.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">88</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">3178</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">3177</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">3176</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">3175</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">3174</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">3173</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">3172</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">3171</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">3170</span> Design of Visual Repository, Constraint and Process Modeling Tool Based on Eclipse Plug-Ins</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Rushiraj%20Heshi">Rushiraj Heshi</a>, <a href="https://publications.waset.org/abstracts/search?q=Smriti%20Bhandari"> Smriti Bhandari</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Master Data Management requires creation of Central repository, applying constraints on Repository and designing processes to manage data. Designing of Repository, constraints on repository and business processes is very tedious and time consuming task for large Enterprise. Hence Visual Repository, constraints and Process (Workflow) modeling is the most critical step in Master Data Management.In this paper, we realize a Visual Modeling tool for implementing Repositories, Constraints and Processes based on Eclipse Plugin using GMF/EMF which follows principles of Model Driven Engineering (MDE). <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=EMF" title="EMF">EMF</a>, <a href="https://publications.waset.org/abstracts/search?q=GMF" title=" GMF"> GMF</a>, <a href="https://publications.waset.org/abstracts/search?q=GEF" title=" GEF"> GEF</a>, <a href="https://publications.waset.org/abstracts/search?q=repository" title=" repository"> repository</a>, <a href="https://publications.waset.org/abstracts/search?q=constraint" title=" constraint"> constraint</a>, <a href="https://publications.waset.org/abstracts/search?q=process" title=" process"> process</a> </p> <a href="https://publications.waset.org/abstracts/21745/design-of-visual-repository-constraint-and-process-modeling-tool-based-on-eclipse-plug-ins" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/21745.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">497</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">3169</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">3168</span> Singular Value Decomposition Based Optimisation of Design Parameters of a Gearbox </h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Mehmet%20Bozca">Mehmet Bozca</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Singular value decomposition based optimisation of geometric design parameters of a 5-speed gearbox is studied. During the optimisation, a four-degree-of freedom torsional vibration model of the pinion gear-wheel gear system is obtained and the minimum singular value of the transfer matrix is considered as the objective functions. The computational cost of the associated singular value problems is quite low for the objective function, because it is only necessary to compute the largest and smallest singular values (µmax and µmin) that can be achieved by using selective eigenvalue solvers; the other singular values are not needed. The design parameters are optimised under several constraints that include bending stress, contact stress and constant distance between gear centres. Thus, by optimising the geometric parameters of the gearbox such as, the module, number of teeth and face width it is possible to obtain a light-weight-gearbox structure. It is concluded that the all optimised geometric design parameters also satisfy all constraints. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=Singular%20value" title="Singular value">Singular value</a>, <a href="https://publications.waset.org/abstracts/search?q=optimisation" title=" optimisation"> optimisation</a>, <a href="https://publications.waset.org/abstracts/search?q=gearbox" title=" gearbox"> gearbox</a>, <a href="https://publications.waset.org/abstracts/search?q=torsional%20vibration" title=" torsional vibration"> torsional vibration</a> </p> <a href="https://publications.waset.org/abstracts/32486/singular-value-decomposition-based-optimisation-of-design-parameters-of-a-gearbox" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/32486.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">359</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">3167</span> The Vertex Degree Distance of One Vertex Union of the Cycle and the Star</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Ying%20Wang">Ying Wang</a>, <a href="https://publications.waset.org/abstracts/search?q=Haiyan%20Xie"> Haiyan Xie</a>, <a href="https://publications.waset.org/abstracts/search?q=Aoming%20Zhang"> Aoming Zhang</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The degree distance of a graph is a graph invariant that is more sensitive than the Wiener index. In this paper, we calculate the vertex degree distances of one vertex union of the cycle and the star, and the degree distance of one vertex union of the cycle and the star. These results lay a foundation for further study on the extreme value of the vertex degree distances, and the distribution of the vertices with the extreme value in one vertex union of the cycle and the star. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=degree%20distance" title="degree distance">degree distance</a>, <a href="https://publications.waset.org/abstracts/search?q=vertex-degree-distance" title=" vertex-degree-distance"> vertex-degree-distance</a>, <a href="https://publications.waset.org/abstracts/search?q=one%20vertex%20union%20of%20a%20cycle%20and%20a%20star" title=" one vertex union of a cycle and a star"> one vertex union of a cycle and a star</a>, <a href="https://publications.waset.org/abstracts/search?q=graph" title=" graph"> graph</a> </p> <a href="https://publications.waset.org/abstracts/127232/the-vertex-degree-distance-of-one-vertex-union-of-the-cycle-and-the-star" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/127232.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">154</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">3166</span> Exploring the Relationship among Job Stress, Travel Constraints, and Job Satisfaction of the Employees in Casino Hotels: The Case of Macau</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Tao%20Zhang">Tao Zhang</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Job stress appears nearly everywhere especially in the hospitality industry because employees in this industry usually have to work long time and try to meet conflicting demands of their customers, managers, and company. To reduce job stress, employees of casino hotels try to perform leisure activities or tourism. However, casino employees often meet many obstacles or constraints when they plan to travel. Until now, there is little understanding as to why casino hotel employees often face many travel constraints or leisure barriers. What is more, few studies explore the relationship between travel constraints and job stress of casino employees. Therefore, this study is to explore the construct of casino hotel employees' travel constraints and the relationship among job stress, travel constraints, and job satisfaction. Using convenient sampling method, this study planned to investigate 500 front line employees and managers of ten casino hotels in Macau. A total of 500 questionnaires were distributed, and 414 valid questionnaires were received. The return rate of valid questionnaires is 82.8%. Several statistical techniques such as factor analysis, t-test, one-way ANOVA, and regression analysis were applied to analyze the collected data. The findings of this study are as follows. Firstly, by using factor analysis, this study found the travel constraints of casino employees include intrapersonal constraints, interpersonal constraints, and structural constraints. Secondly, by using regression analysis, the study found travel constraints are positively related with job stress while negatively related with job satisfaction. This means reducing travel constraints may create a chance for casino employees to travel so that they could reduce job stress, therefore raise their job satisfaction. Thirdly, this research divided the research samples into three groups by the degree of job stress. The three groups are low satisfaction group, medium satisfaction group, and high satisfaction group. The means values of these groups were compared by t-test. Results showed that there are significant differences of the means values of interpersonal constraints between low satisfaction group and high satisfaction group. This suggests positive interpersonal relationship especially good family member relationship reduce not only job stress but also travel constraints of casino employees. Interestingly, results of t-test showed there is not a significant difference of the means values of structural constraints between low satisfaction group and high satisfaction group. This suggests structural constraints are outside variables which may be related with tourism destination marketing. Destination marketing organizations (DMO) need use all kinds of tools and techniques to promote their tourism destinations so as to reduce structural constraints of casino employees. This research is significant for both theoretical and practical fields. From the theoretical perspective, the study found the internal relationship between travel constraints, job stress, and job satisfaction and the different roles of three dimensions of travel constraints. From the practical perspective, the study provides useful methods to reduce travel constraints and job stress, therefore, raise job satisfaction of casino employees. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=hotel" title="hotel">hotel</a>, <a href="https://publications.waset.org/abstracts/search?q=job%20satisfaction" title=" job satisfaction"> job satisfaction</a>, <a href="https://publications.waset.org/abstracts/search?q=job%20stress" title=" job stress"> job stress</a>, <a href="https://publications.waset.org/abstracts/search?q=travel%20constraints" title=" travel constraints"> travel constraints</a> </p> <a href="https://publications.waset.org/abstracts/66715/exploring-the-relationship-among-job-stress-travel-constraints-and-job-satisfaction-of-the-employees-in-casino-hotels-the-case-of-macau" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/66715.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">250</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">3165</span> Gender and Parenthood in Web 2.0.: Research on Role Distance in a Bulgarian Weblog Dedicated to Motherhood</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Gergana%20Nenova">Gergana Nenova</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The persistence of gender arrangements in childcare has been well-documented and theorized, but we know little on how they have been represented in Web 2.0. by the social actors themselves. This paper relies on Goffman’s concept of role distance to explore the online self-representations of mothers as a group and thus the complicated relationship between gender and parenthood. The object of research is a popular Bulgarian weblog dedicated to motherhood, and its content has been analyzed through content analysis. The results demonstrate that the concept of role distance can be successfully used to illuminate the ways the gendered expectations and norms of parenting are being questioned online. The research contributes both to the understanding of the relevance of the concept of role distance in explaining gender relations and of its increasing importance in Web 2.0. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=gender" title="gender">gender</a>, <a href="https://publications.waset.org/abstracts/search?q=parenthood" title=" parenthood"> parenthood</a>, <a href="https://publications.waset.org/abstracts/search?q=role%20distance" title=" role distance"> role distance</a>, <a href="https://publications.waset.org/abstracts/search?q=Web%202.0" title=" Web 2.0"> Web 2.0</a> </p> <a href="https://publications.waset.org/abstracts/66208/gender-and-parenthood-in-web-20-research-on-role-distance-in-a-bulgarian-weblog-dedicated-to-motherhood" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/66208.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">340</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">3164</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> <ul class="pagination"> <li class="page-item disabled"><span class="page-link">‹</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=distance%20constraints&page=2">2</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=distance%20constraints&page=3">3</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=distance%20constraints&page=4">4</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=distance%20constraints&page=5">5</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=distance%20constraints&page=6">6</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=distance%20constraints&page=7">7</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=distance%20constraints&page=8">8</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=distance%20constraints&page=9">9</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=distance%20constraints&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=distance%20constraints&page=106">106</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=distance%20constraints&page=107">107</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=distance%20constraints&page=2" rel="next">›</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>