CINXE.COM

<!DOCTYPE html> <html lang="en" dir="ltr"> <head>  <script async src="https://www.googletagmanager.com/gtag/js?id=G-P63WKM1TM1"></script> <script> window.dataLayer = window.dataLayer || []; function gtag(){dataLayer.push(arguments);} gtag('js', new Date()); gtag('config', 'G-P63WKM1TM1'); </script>  <script type="text/javascript" > (function(m,e,t,r,i,k,a){m[i]=m[i]||function(){(m[i].a=m[i].a||[]).push(arguments)}; m[i].l=1*new Date(); for (var j = 0; j < document.scripts.length; j++) {if (document.scripts[j].src === r) { return; }} k=e.createElement(t),a=e.getElementsByTagName(t)[0],k.async=1,k.src=r,a.parentNode.insertBefore(k,a)}) (window, document, "script", "https://mc.yandex.ru/metrika/tag.js", "ym"); ym(55165297, "init", { clickmap:false, trackLinks:true, accurateTrackBounce:true, webvisor:false }); </script> <noscript><div><img src="https://mc.yandex.ru/watch/55165297" style="position:absolute; left:-9999px;" alt="" /></div></noscript>    <title>Search results for: evolutional triangle similarity</title> <meta name="description" content="Search results for: evolutional triangle similarity"> <meta name="keywords" content="evolutional triangle similarity"> <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="evolutional triangle similarity" 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="evolutional triangle similarity"> <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> 776</div> </div> </div> </div> <h1 class="mt-3 mb-3 text-center" style="font-size:1.6rem;">Search results for: evolutional triangle similarity</h1> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">776</span> Study on the Self-Location Estimate by the Evolutional Triangle Similarity Matching Using Artificial Bee Colony Algorithm</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Yuji%20Kageyama">Yuji Kageyama</a>, <a href="https://publications.waset.org/abstracts/search?q=Shin%20Nagata"> Shin Nagata</a>, <a href="https://publications.waset.org/abstracts/search?q=Tatsuya%20Takino"> Tatsuya Takino</a>, <a href="https://publications.waset.org/abstracts/search?q=Izuru%20Nomura"> Izuru Nomura</a>, <a href="https://publications.waset.org/abstracts/search?q=Hiroyuki%20Kamata"> Hiroyuki Kamata</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In previous study, technique to estimate a self-location by using a lunar image is proposed. We consider the improvement of the conventional method in consideration of FPGA implementation in this paper. Specifically, we introduce Artificial Bee Colony algorithm for reduction of search time. In addition, we use fixed point arithmetic to enable high-speed operation on FPGA. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=SLIM" title="SLIM">SLIM</a>, <a href="https://publications.waset.org/abstracts/search?q=Artificial%20Bee%20Colony%20Algorithm" title=" Artificial Bee Colony Algorithm"> Artificial Bee Colony Algorithm</a>, <a href="https://publications.waset.org/abstracts/search?q=location%20estimate" title=" location estimate"> location estimate</a>, <a href="https://publications.waset.org/abstracts/search?q=evolutional%20triangle%20similarity" title=" evolutional triangle similarity"> evolutional triangle similarity</a> </p> <a href="https://publications.waset.org/abstracts/19303/study-on-the-self-location-estimate-by-the-evolutional-triangle-similarity-matching-using-artificial-bee-colony-algorithm" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/19303.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">518</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">775</span> Evolutional Substitution Cipher on Chaotic Attractor</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Adda%20Ali-Pacha">Adda Ali-Pacha</a>, <a href="https://publications.waset.org/abstracts/search?q=Naima%20Hadj-Said"> Naima Hadj-Said</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Nowadays, the security of information is primarily founded on the calculation of algorithms that confidentiality depend on the number of bits necessary to define a cryptographic key. In this work, we introduce a new chaotic cryptosystem that we call evolutional substitution cipher on a chaotic attractor. In this research paper, we take the Henon attractor. The evolutional substitution cipher on Henon attractor is based on the principle of monoalphabetic cipher and it associates the plaintext at a succession of real numbers calculated from the attractor equations. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=cryptography" title="cryptography">cryptography</a>, <a href="https://publications.waset.org/abstracts/search?q=substitution%20cipher" title=" substitution cipher"> substitution cipher</a>, <a href="https://publications.waset.org/abstracts/search?q=chaos%20theory" title=" chaos theory"> chaos theory</a>, <a href="https://publications.waset.org/abstracts/search?q=Henon%20attractor" title=" Henon attractor"> Henon attractor</a>, <a href="https://publications.waset.org/abstracts/search?q=evolutional%20substitution%20cipher" title=" evolutional substitution cipher"> evolutional substitution cipher</a> </p> <a href="https://publications.waset.org/abstracts/4769/evolutional-substitution-cipher-on-chaotic-attractor" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/4769.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">429</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">774</span> A Study of Evolutional Control Systems</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Ti-Jun%20Xiao">Ti-Jun Xiao</a>, <a href="https://publications.waset.org/abstracts/search?q=Zhe%20Xu"> Zhe Xu</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Controllability is one of the fundamental issues in control systems. In this paper, we study the controllability of second order evolutional control systems in Hilbert spaces with memory and boundary controls, which model dynamic behaviors of some viscoelastic materials. Transferring the control problem into a moment problem and showing the Riesz property of a family of functions related to Cauchy problems for some integrodifferential equations, we obtain a general boundary controllability theorem for these second order evolutional control systems. This controllability theorem is applicable to various concrete 1D viscoelastic systems and recovers some previous related results. It is worth noting that Riesz sequences can be used for numerical computations of the control functions and the identification of new Riesz sequence is of independent interest for the basis-function theory. Moreover, using the Riesz sequences, we obtain the existence and uniqueness of (weak) solutions to these second order evolutional control systems in Hilbert spaces. Finally, we derive the exact boundary controllability of a viscoelastic beam equation, as an application of our abstract theorem. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=evolutional%20control%20system" title="evolutional control system">evolutional control system</a>, <a href="https://publications.waset.org/abstracts/search?q=controllability" title=" controllability"> controllability</a>, <a href="https://publications.waset.org/abstracts/search?q=boundary%20control" title=" boundary control"> boundary control</a>, <a href="https://publications.waset.org/abstracts/search?q=existence%20and%20uniqueness" title=" existence and uniqueness"> existence and uniqueness</a> </p> <a href="https://publications.waset.org/abstracts/93935/a-study-of-evolutional-control-systems" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/93935.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">222</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">773</span> A Generalization of Planar Pascal’s Triangle to Polynomial Expansion and Connection with Sierpinski Patterns</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Wajdi%20Mohamed%20Ratemi">Wajdi Mohamed Ratemi</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The very well-known stacked sets of numbers referred to as Pascal’s triangle present the coefficients of the binomial expansion of the form (x+y)n. This paper presents an approach (the Staircase Horizontal Vertical, SHV-method) to the generalization of planar Pascal’s triangle for polynomial expansion of the form (x+y+z+w+r+⋯)n. The presented generalization of Pascal’s triangle is different from other generalizations of Pascal’s triangles given in the literature. The coefficients of the generalized Pascal’s triangles, presented in this work, are generated by inspection, using embedded Pascal’s triangles. The coefficients of I-variables expansion are generated by horizontally laying out the Pascal’s elements of (I-1) variables expansion, in a staircase manner, and multiplying them with the relevant columns of vertically laid out classical Pascal’s elements, hence avoiding factorial calculations for generating the coefficients of the polynomial expansion. Furthermore, the classical Pascal’s triangle has some pattern built into it regarding its odd and even numbers. Such pattern is known as the Sierpinski’s triangle. In this study, a presentation of Sierpinski-like patterns of the generalized Pascal’s triangles is given. Applications related to those coefficients of the binomial expansion (Pascal’s triangle), or polynomial expansion (generalized Pascal’s triangles) can be in areas of combinatorics, and probabilities. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=pascal%E2%80%99s%20triangle" title="pascal’s triangle">pascal’s triangle</a>, <a href="https://publications.waset.org/abstracts/search?q=generalized%20pascal%E2%80%99s%20triangle" title=" generalized pascal’s triangle"> generalized pascal’s triangle</a>, <a href="https://publications.waset.org/abstracts/search?q=polynomial%20expansion" title=" polynomial expansion"> polynomial expansion</a>, <a href="https://publications.waset.org/abstracts/search?q=sierpinski%E2%80%99s%20triangle" title=" sierpinski’s triangle"> sierpinski’s triangle</a>, <a href="https://publications.waset.org/abstracts/search?q=combinatorics" title=" combinatorics"> combinatorics</a>, <a href="https://publications.waset.org/abstracts/search?q=probabilities" title=" probabilities"> probabilities</a> </p> <a href="https://publications.waset.org/abstracts/37988/a-generalization-of-planar-pascals-triangle-to-polynomial-expansion-and-connection-with-sierpinski-patterns" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/37988.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">367</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">772</span> The Algorithm to Solve the Extend General Malfatti’s Problem in a Convex Circular Triangle</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Ching-Shoei%20Chiang">Ching-Shoei Chiang</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The Malfatti’s Problem solves the problem of fitting 3 circles into a right triangle such that these 3 circles are tangent to each other, and each circle is also tangent to a pair of the triangle’s sides. This problem has been extended to any triangle (called general Malfatti’s Problem). Furthermore, the problem has been extended to have 1+2+…+n circles inside the triangle with special tangency properties among circles and triangle sides; we call it extended general Malfatti’s problem. In the extended general Malfatti’s problem, call it Tri(Tn), where Tn is the triangle number, there are closed-form solutions for Tri(T₁) (inscribed circle) problem and Tri(T₂) (3 Malfatti’s circles) problem. These problems become more complex when n is greater than 2. In solving Tri(Tn) problem, n>2, algorithms have been proposed to solve these problems numerically. With a similar idea, this paper proposed an algorithm to find the radii of circles with the same tangency properties. Instead of the boundary of the triangle being a straight line, we use a convex circular arc as the boundary and try to find Tn circles inside this convex circular triangle with the same tangency properties among circles and boundary Carc. We call these problems the Carc(Tn) problems. The CPU time it takes for Carc(T16) problem, which finds 136 circles inside a convex circular triangle with specified tangency properties, is less than one second. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=circle%20packing" title="circle packing">circle packing</a>, <a href="https://publications.waset.org/abstracts/search?q=computer-aided%20geometric%20design" title=" computer-aided geometric design"> computer-aided geometric design</a>, <a href="https://publications.waset.org/abstracts/search?q=geometric%20constraint%20solver" title=" geometric constraint solver"> geometric constraint solver</a>, <a href="https://publications.waset.org/abstracts/search?q=Malfatti%E2%80%99s%20problem" title=" Malfatti’s problem"> Malfatti’s problem</a> </p> <a href="https://publications.waset.org/abstracts/165851/the-algorithm-to-solve-the-extend-general-malfattis-problem-in-a-convex-circular-triangle" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/165851.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">110</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">771</span> The Malfatti’s Problem in Reuleaux Triangle</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Ching-Shoei%20Chiang">Ching-Shoei Chiang</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The Malfatti’s Problem is to ask for fitting 3 circles into a right triangle such that they are tangent to each other, and each circle is also tangent to a pair of the triangle’s side. This problem has been extended to any triangle (called general Malfatti’s Problem). Furthermore, the problem has been extended to have 1+2+…+n circles, we call it extended general Malfatti’s problem, these circles whose tangency graph, using the center of circles as vertices and the edge connect two circles center if these two circles tangent to each other, has the structure as Pascal’s triangle, and the exterior circles of these circles tangent to three sides of the triangle. In the extended general Malfatti’s problem, there are closed-form solutions for n=1, 2, and the problem becomes complex when n is greater than 2. In solving extended general Malfatti’s problem (n>2), we initially give values to the radii of all circles. From the tangency graph and current radii, we can compute angle value between two vectors. These vectors are from the center of the circle to the tangency points with surrounding elements, and these surrounding elements can be the boundary of the triangle or other circles. For each circle C, there are vectors from its center c to its tangency point with its neighbors (count clockwise) pi, i=0, 1,2,..,n. We add all angles between cpi to cp(i+1) mod (n+1), i=0,1,..,n, call it sumangle(C) for circle C. Using sumangle(C), we can reduce/enlarge the radii for all circles in next iteration, until sumangle(C) is equal to 2πfor all circles. With a similar idea, this paper proposed an algorithm to find the radii of circles whose tangency has the structure of Pascal’s triangle, and the exterior circles of these circles are tangent to the unit Realeaux Triangle. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=Malfatti%E2%80%99s%20problem" title="Malfatti’s problem">Malfatti’s problem</a>, <a href="https://publications.waset.org/abstracts/search?q=geometric%20constraint%20solver" title=" geometric constraint solver"> geometric constraint solver</a>, <a href="https://publications.waset.org/abstracts/search?q=computer-aided%20geometric%20design" title=" computer-aided geometric design"> computer-aided geometric design</a>, <a href="https://publications.waset.org/abstracts/search?q=circle%20packing" title=" circle packing"> circle packing</a>, <a href="https://publications.waset.org/abstracts/search?q=data%20visualization" title=" data visualization"> data visualization</a> </p> <a href="https://publications.waset.org/abstracts/148477/the-malfattis-problem-in-reuleaux-triangle" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/148477.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">131</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">770</span> Practical Limitations of the Fraud Triangle Framework in Fraud Prevention</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Alexander%20Glebovskiy">Alexander Glebovskiy</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Practitioners charged with fraud prevention and investigation strongly rely on the Fraud Triangle framework developed by Joseph T. Wells in 1997 while analyzing the causes of fraud at business organizations. The Fraud Triangle model explains fraud by elements such as pressure, opportunity, and rationalization. This view is not fully suitable for effective fraud prevention as the Fraud Triangle model provides limited insight into the causation of fraud. Fraud is a multifaceted phenomenon, the contextual factors of which may not fit into any framework. Employee criminal behavior in business organizations is influenced by environmental, individual, and organizational aspects. Therefore, further criminogenic factors and processes facilitating fraud in organizational settings need to be considered in the root-cause analysis: organizational culture, leadership style, groupthink effect, isomorphic behavior, crime of obedience, displacement of responsibility, lack of critical thinking and unquestioning conformity and loyalty. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=criminogenesis" title="criminogenesis">criminogenesis</a>, <a href="https://publications.waset.org/abstracts/search?q=fraud%20triangle" title=" fraud triangle"> fraud triangle</a>, <a href="https://publications.waset.org/abstracts/search?q=fraud%20prevention" title=" fraud prevention"> fraud prevention</a>, <a href="https://publications.waset.org/abstracts/search?q=organizational%20culture" title=" organizational culture"> organizational culture</a> </p> <a href="https://publications.waset.org/abstracts/117811/practical-limitations-of-the-fraud-triangle-framework-in-fraud-prevention" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/117811.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">300</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">769</span> Limiting Fracture Stress of Composite Ceramics with Symmetric Triangle Eutectic</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Jian%20Zheng">Jian Zheng</a>, <a href="https://publications.waset.org/abstracts/search?q=Jinfeng%20Yu"> Jinfeng Yu</a>, <a href="https://publications.waset.org/abstracts/search?q=Xinhua%20Ni"> Xinhua Ni</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The limiting fracture stress predicting model of composite ceramics with symmetric triangle eutectic was established based on its special microscopic structure. The symmetric triangle eutectic is consisted of matrix, the strong constraint inter-phase and reinforced fiber inclusions which are 120 degrees uniform symmetrical distribution. Considering the conditions of the rupture of the cohesive bond between matrix and fibers in eutectic and the stress concentration effect at the fiber end, the intrinsic fracture stress of eutectic was obtained. Based on the biggest micro-damage strain in eutectic, defining the load function, the macro-damage fracture stress of symmetric triangle eutectic was determined by boundary conditions. Introducing the conception of critical zone, the theoretical limiting fracture stress forecasting model of composite ceramics was got, and the stress was related to the fiber size and fiber volume fraction in eutectic. The calculated results agreed with the experimental results in the literature. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=symmetric%20triangle%20eutectic" title="symmetric triangle eutectic">symmetric triangle eutectic</a>, <a href="https://publications.waset.org/abstracts/search?q=composite%20ceramics" title=" composite ceramics"> composite ceramics</a>, <a href="https://publications.waset.org/abstracts/search?q=limiting%20stress" title=" limiting stress"> limiting stress</a>, <a href="https://publications.waset.org/abstracts/search?q=intrinsic%20fracture%20stress" title=" intrinsic fracture stress"> intrinsic fracture stress</a> </p> <a href="https://publications.waset.org/abstracts/72473/limiting-fracture-stress-of-composite-ceramics-with-symmetric-triangle-eutectic" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/72473.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">258</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">768</span> Multi-Objective Optimal Threshold Selection for Similarity Functions in Siamese Networks for Semantic Textual Similarity Tasks</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Kriuk%20Boris">Kriuk Boris</a>, <a href="https://publications.waset.org/abstracts/search?q=Kriuk%20Fedor"> Kriuk Fedor</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper presents a comparative study of fundamental similarity functions for Siamese networks in semantic textual similarity (STS) tasks. We evaluate various similarity functions using the STS Benchmark dataset, analyzing their performance and stability. Additionally, we introduce a multi-objective approach for optimal threshold selection. Our findings provide insights into the effectiveness of different similarity functions and offer a straightforward method for threshold selection optimization, contributing to the advancement of Siamese network architectures in STS applications. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=siamese%20networks" title="siamese networks">siamese networks</a>, <a href="https://publications.waset.org/abstracts/search?q=semantic%20textual%20similarity" title=" semantic textual similarity"> semantic textual similarity</a>, <a href="https://publications.waset.org/abstracts/search?q=similarity%20functions" title=" similarity functions"> similarity functions</a>, <a href="https://publications.waset.org/abstracts/search?q=STS%20benchmark%20dataset" title=" STS benchmark dataset"> STS benchmark dataset</a>, <a href="https://publications.waset.org/abstracts/search?q=threshold%20selection" title=" threshold selection"> threshold selection</a> </p> <a href="https://publications.waset.org/abstracts/187407/multi-objective-optimal-threshold-selection-for-similarity-functions-in-siamese-networks-for-semantic-textual-similarity-tasks" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/187407.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">37</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">767</span> Supply Chain Resilience Triangle: The Study and Development of a Framework</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=M.%20Bevilacqua">M. Bevilacqua</a>, <a href="https://publications.waset.org/abstracts/search?q=F.%20E.%20Ciarapica"> F. E. Ciarapica</a>, <a href="https://publications.waset.org/abstracts/search?q=G.%20Marcucci"> G. Marcucci</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Supply Chain Resilience has been broadly studied during the last decade, focusing the research on many aspects of Supply Chain performance. Consequently, different definitions of Supply Chain Resilience have been developed by the research community, drawing inspiration also from other fields of study such as ecology, sociology, psychology, economy et al. This way, the definitions so far developed in the extant literature are therefore very heterogeneous, and many authors have pointed out a lack of consensus in this field of analysis. The aim of this research is to find common points between these definitions, through the development of a framework of study: the Resilience Triangle. The Resilience Triangle is a tool developed in the field of civil engineering, with the objective of modeling the loss of resilience of a given structure during and after the occurrence of a disruption such as an earthquake. The Resilience Triangle is a simple yet powerful tool: in our opinion, it can summarize all the features that authors have captured in the Supply Chain Resilience definitions over the years. This research intends to recapitulate within this framework all these heterogeneities in Supply Chain Resilience research. After collecting a various number of Supply Chain Resilience definitions present in the extant literature, the methodology approach provides a taxonomy step with the scope of collecting and analyzing all the data gathered. The next step provides the comparison of the data obtained with the plotting of a disruption profile, in order to contextualize the Resilience Triangle in the Supply Chain context. The tool and the results developed in this research will allow to lay the foundation for future Supply Chain Resilience modeling and measurement work. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=supply%20chain%20resilience" title="supply chain resilience">supply chain resilience</a>, <a href="https://publications.waset.org/abstracts/search?q=resilience%20definition" title=" resilience definition"> resilience definition</a>, <a href="https://publications.waset.org/abstracts/search?q=supply%20chain%20resilience%20triangle" title=" supply chain resilience triangle"> supply chain resilience triangle</a> </p> <a href="https://publications.waset.org/abstracts/62427/supply-chain-resilience-triangle-the-study-and-development-of-a-framework" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/62427.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">318</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">766</span> Design and Evaluation on Sierpinski-Triangle Acoustic Diffusers Based on Fractal Theory</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Lingge%20Tan">Lingge Tan</a>, <a href="https://publications.waset.org/abstracts/search?q=Hongpeng%20Xu"> Hongpeng Xu</a>, <a href="https://publications.waset.org/abstracts/search?q=Jieun%20Yang"> Jieun Yang</a>, <a href="https://publications.waset.org/abstracts/search?q=Maarten%20Hornikx"> Maarten Hornikx</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Acoustic diffusers are important components in enhancing the quality of room acoustics. This paper provides a type of modular diffuser based on the Sierpinski Triangle of the plane and combines it with fractal theory to expand the effective frequency range. In numerical calculations and full-scale model experiments, the effect of fractal design elements on normal-incidence diffusion coefficients is examined. It is demonstrated the reasonable times of iteration of modules is three, and the coverage density is 58.4% in the design frequency from 125Hz to 4kHz. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=acoustic%20diffuser" title="acoustic diffuser">acoustic diffuser</a>, <a href="https://publications.waset.org/abstracts/search?q=fractal" title=" fractal"> fractal</a>, <a href="https://publications.waset.org/abstracts/search?q=Sierpinski-triangle" title=" Sierpinski-triangle"> Sierpinski-triangle</a>, <a href="https://publications.waset.org/abstracts/search?q=diffusion%20coefficient" title=" diffusion coefficient"> diffusion coefficient</a> </p> <a href="https://publications.waset.org/abstracts/132869/design-and-evaluation-on-sierpinski-triangle-acoustic-diffusers-based-on-fractal-theory" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/132869.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">151</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">765</span> An Anatomic Approach to the Lingual Artery in the Carotid Triangle in South Indian Population </h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Ashwin%20Rai">Ashwin Rai</a>, <a href="https://publications.waset.org/abstracts/search?q=Rajalakshmi%20Rai"> Rajalakshmi Rai</a>, <a href="https://publications.waset.org/abstracts/search?q=Rajanigandha%20%20Vadgoankar"> Rajanigandha Vadgoankar</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Lingual artery is the chief artery of the tongue and the neighboring structures pertaining to the oral cavity. At the carotid triangle, this artery arises from the external carotid artery opposite to the tip of greater cornua of hyoid bone, undergoes a tortuous course with its first part being crossed by the hypoglossal nerve and runs beneath the digastric muscle. Then it continues to supply the tongue as the deep lingual artery. The aim of this study is to draw surgeon's attention to the course of lingual artery in this area since it can be accidentally lesioned causing an extensive hemorrhage in certain surgical or dental procedures. The study was conducted on 44 formalin fixed head and neck specimens focusing on the anatomic relations of lingual artery. In this study, we found that the lingual artery is located inferior to the digastric muscle and the hypoglossal nerve contradictory to the classical description. This data would be useful during ligation of lingual artery to avoid injury to the hypoglossal nerve in surgeries related to the anterior triangle of neck. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=anterior%20triangle" title="anterior triangle">anterior triangle</a>, <a href="https://publications.waset.org/abstracts/search?q=digastric%20muscle" title=" digastric muscle"> digastric muscle</a>, <a href="https://publications.waset.org/abstracts/search?q=hypoglossal%20nerve" title=" hypoglossal nerve"> hypoglossal nerve</a>, <a href="https://publications.waset.org/abstracts/search?q=lingual%20artery" title=" lingual artery"> lingual artery</a> </p> <a href="https://publications.waset.org/abstracts/78096/an-anatomic-approach-to-the-lingual-artery-in-the-carotid-triangle-in-south-indian-population" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/78096.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">178</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">764</span> Application of Intelligent City and Hierarchy Intelligent Buildings in Kuala Lumpur</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Jalalludin%20Abdul%20Malek">Jalalludin Abdul Malek</a>, <a href="https://publications.waset.org/abstracts/search?q=Zurinah%20Tahir"> Zurinah Tahir </a> </p> <p class="card-text"><strong>Abstract:</strong></p> When the Multimedia Super Corridor (MSC) was launched in 1995, it became the catalyst for the implementation of the intelligent city concept, an area that covers about 15 x 50 kilometres from Kuala Lumpur City Centre (KLCC), Putrajaya and Kuala Lumpur International Airport (KLIA). The concept of intelligent city means that the city has an advanced infrastructure and infostructure such as information technology, advanced telecommunication systems, electronic technology and mechanical technology to be utilized for the development of urban elements such as industries, health, services, transportation and communications. For example, the Golden Triangle of Kuala Lumpur has also many intelligent buildings developed by the private sector such as the KLCC Tower to implement the intelligent city concept. Consequently, the intelligent buildings in the Golden Triangle can be linked directly to the Putrajaya Intelligent City and Cyberjaya Intelligent City within the confines of the MSC. However, the reality of the situation is that there are not many intelligent buildings within the Golden Triangle Kuala Lumpur scope which can be considered of high-standard intelligent buildings as referred to by the Intelligence Quotient (IQ) building standard. This increases the need to implement the real ‘intelligent city’ concept. This paper aims to show the strengths and weaknesses of the intelligent buildings in the Golden Triangle by taking into account aspects of 'intelligence' in the areas of technology and infrastructure of buildings. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=intelligent%20city%20concepts" title="intelligent city concepts">intelligent city concepts</a>, <a href="https://publications.waset.org/abstracts/search?q=intelligent%20building" title=" intelligent building"> intelligent building</a>, <a href="https://publications.waset.org/abstracts/search?q=Golden%20Triangle" title=" Golden Triangle"> Golden Triangle</a>, <a href="https://publications.waset.org/abstracts/search?q=Kuala%20Lumpur" title=" Kuala Lumpur "> Kuala Lumpur </a> </p> <a href="https://publications.waset.org/abstracts/57007/application-of-intelligent-city-and-hierarchy-intelligent-buildings-in-kuala-lumpur" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/57007.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">297</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">763</span> Approximately Similarity Measurement of Web Sites Using Genetic Algorithms and Binary Trees</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Doru%20Anastasiu%20Popescu">Doru Anastasiu Popescu</a>, <a href="https://publications.waset.org/abstracts/search?q=Dan%20R%C4%83dulescu"> Dan Rădulescu</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, we determine the similarity of two HTML web applications. We are going to use a genetic algorithm in order to determine the most significant web pages of each application (we are not going to use every web page of a site). Using these significant web pages, we will find the similarity value between the two applications. The algorithm is going to be efficient because we are going to use a reduced number of web pages for comparisons but it will return an approximate value of the similarity. The binary trees are used to keep the tags from the significant pages. The algorithm was implemented in Java language. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=Tag" title="Tag">Tag</a>, <a href="https://publications.waset.org/abstracts/search?q=HTML" title=" HTML"> HTML</a>, <a href="https://publications.waset.org/abstracts/search?q=web%20page" title=" web page"> web page</a>, <a href="https://publications.waset.org/abstracts/search?q=genetic%20algorithm" title=" genetic algorithm"> genetic algorithm</a>, <a href="https://publications.waset.org/abstracts/search?q=similarity%20value" title=" similarity value"> similarity value</a>, <a href="https://publications.waset.org/abstracts/search?q=binary%20tree" title=" binary tree"> binary tree</a> </p> <a href="https://publications.waset.org/abstracts/50460/approximately-similarity-measurement-of-web-sites-using-genetic-algorithms-and-binary-trees" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/50460.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">355</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">762</span> Measuring Text-Based Semantics Relatedness Using WordNet</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Madiha%20Khan">Madiha Khan</a>, <a href="https://publications.waset.org/abstracts/search?q=Sidrah%20Ramzan"> Sidrah Ramzan</a>, <a href="https://publications.waset.org/abstracts/search?q=Seemab%20Khan"> Seemab Khan</a>, <a href="https://publications.waset.org/abstracts/search?q=Shahzad%20Hassan"> Shahzad Hassan</a>, <a href="https://publications.waset.org/abstracts/search?q=Kamran%20Saeed"> Kamran Saeed</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Measuring semantic similarity between texts is calculating semantic relatedness between texts using various techniques. Our web application (Measuring Relatedness of Concepts-MRC) allows user to input two text corpuses and get semantic similarity percentage between both using WordNet. Our application goes through five stages for the computation of semantic relatedness. Those stages are: Preprocessing (extracts keywords from content), Feature Extraction (classification of words into Parts-of-Speech), Synonyms Extraction (retrieves synonyms against each keyword), Measuring Similarity (using keywords and synonyms, similarity is measured) and Visualization (graphical representation of similarity measure). Hence the user can measure similarity on basis of features as well. The end result is a percentage score and the word(s) which form the basis of similarity between both texts with use of different tools on same platform. In future work we look forward for a Web as a live corpus application that provides a simpler and user friendly tool to compare documents and extract useful information. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=Graphviz%20representation" title="Graphviz representation">Graphviz representation</a>, <a href="https://publications.waset.org/abstracts/search?q=semantic%20relatedness" title=" semantic relatedness"> semantic relatedness</a>, <a href="https://publications.waset.org/abstracts/search?q=similarity%20measurement" title=" similarity measurement"> similarity measurement</a>, <a href="https://publications.waset.org/abstracts/search?q=WordNet%20similarity" title=" WordNet similarity"> WordNet similarity</a> </p> <a href="https://publications.waset.org/abstracts/95106/measuring-text-based-semantics-relatedness-using-wordnet" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/95106.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">237</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">761</span> Quick Similarity Measurement of Binary Images via Probabilistic Pixel Mapping</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Adnan%20A.%20Y.%20Mustafa">Adnan A. Y. Mustafa</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper we present a quick technique to measure the similarity between binary images. The technique is based on a probabilistic mapping approach and is fast because only a minute percentage of the image pixels need to be compared to measure the similarity, and not the whole image. We exploit the power of the Probabilistic Matching Model for Binary Images (PMMBI) to arrive at an estimate of the similarity. We show that the estimate is a good approximation of the actual value, and the quality of the estimate can be improved further with increased image mappings. Furthermore, the technique is image size invariant; the similarity between big images can be measured as fast as that for small images. Examples of trials conducted on real images are presented. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=big%20images" title="big images">big images</a>, <a href="https://publications.waset.org/abstracts/search?q=binary%20images" title=" binary images"> binary images</a>, <a href="https://publications.waset.org/abstracts/search?q=image%20matching" title=" image matching"> image matching</a>, <a href="https://publications.waset.org/abstracts/search?q=image%20similarity" title=" image similarity"> image similarity</a> </p> <a href="https://publications.waset.org/abstracts/89963/quick-similarity-measurement-of-binary-images-via-probabilistic-pixel-mapping" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/89963.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">196</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">760</span> A Context-Sensitive Algorithm for Media Similarity Search </h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Guang-Ho%20Cha">Guang-Ho Cha</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper presents a context-sensitive media similarity search algorithm. One of the central problems regarding media search is the semantic gap between the low-level features computed automatically from media data and the human interpretation of them. This is because the notion of similarity is usually based on high-level abstraction but the low-level features do not sometimes reflect the human perception. Many media search algorithms have used the Minkowski metric to measure similarity between image pairs. However those functions cannot adequately capture the aspects of the characteristics of the human visual system as well as the nonlinear relationships in contextual information given by images in a collection. Our search algorithm tackles this problem by employing a similarity measure and a ranking strategy that reflect the nonlinearity of human perception and contextual information in a dataset. Similarity search in an image database based on this contextual information shows encouraging experimental results. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=context-sensitive%20search" title="context-sensitive search">context-sensitive search</a>, <a href="https://publications.waset.org/abstracts/search?q=image%20search" title=" image search"> image search</a>, <a href="https://publications.waset.org/abstracts/search?q=similarity%20ranking" title=" similarity ranking"> similarity ranking</a>, <a href="https://publications.waset.org/abstracts/search?q=similarity%20search" title=" similarity search"> similarity search</a> </p> <a href="https://publications.waset.org/abstracts/65150/a-context-sensitive-algorithm-for-media-similarity-search" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/65150.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">365</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">759</span> Review and Suggestions of the Similarity between Employee and Its Workplace</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Gi%20Ryung%20Song">Gi Ryung Song</a>, <a href="https://publications.waset.org/abstracts/search?q=Kyoung%20Seok%20Kim"> Kyoung Seok Kim</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This study reviewed the literature that focused on similarity of various characteristics such as values, personality, or demographics between employee and other elements in its organization for example employee with leader, job, and organization. We divided a body of this study into two parts and organized and demonstrated recent studies in first part. Three issues appeared in this part, which are statistical ways of measuring similarity, supervisor-subordinate similarity, and person-organization fit with person-job fit. In the latter part, based on the three issues of recent studies, we suggested three propositions about points that the recent studies missed or the studies did not orient. First proposition argued about the direction of similarity, which could also be interpreted as there is causal relation between employee and its workplace environments. Second, we suggested a consideration of eliminating common variance buried in one’s characteristics or its profiles. Third proposition was about the similarity of extra role behavior between individual and organization, and we treated this organization’s level of extra role behavior as a kind of its culture. In doing so, similarity of individual’s extra role behavior and organization’s has the meaning that individual’s congruence against their organization culture. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=similarity" title="similarity">similarity</a>, <a href="https://publications.waset.org/abstracts/search?q=person-organization%20fit" title=" person-organization fit"> person-organization fit</a>, <a href="https://publications.waset.org/abstracts/search?q=supervisor-subordinate%20similarity" title=" supervisor-subordinate similarity"> supervisor-subordinate similarity</a>, <a href="https://publications.waset.org/abstracts/search?q=literature%20review" title=" literature review"> literature review</a> </p> <a href="https://publications.waset.org/abstracts/54492/review-and-suggestions-of-the-similarity-between-employee-and-its-workplace" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/54492.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">283</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">758</span> 2D Fingerprint Performance for PubChem Chemical Database</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Fatimah%20Zawani%20Abdullah">Fatimah Zawani Abdullah</a>, <a href="https://publications.waset.org/abstracts/search?q=Shereena%20Mohd%20Arif"> Shereena Mohd Arif</a>, <a href="https://publications.waset.org/abstracts/search?q=Nurul%20Malim"> Nurul Malim</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The study of molecular similarity search in chemical database is increasingly widespread, especially in the area of drug discovery. Similarity search is an application in the field of Chemoinformatics to measure the similarity between the molecular structure which is known as the query and the structure of chemical compounds in the database. Similarity search is also one of the approaches in virtual screening which involves computational techniques and scoring the probabilities of activity. The main objective of this work is to determine the best fingerprint when compared to the other five fingerprints selected in this study using PubChem chemical dataset. This paper will discuss the similarity searching process conducted using 6 types of descriptors, which are ECFP4, ECFC4, FCFP4, FCFC4, SRECFC4 and SRFCFC4 on 15 activity classes of PubChem dataset using Tanimoto coefficient to calculate the similarity between the query structures and each of the database structure. The results suggest that ECFP4 performs the best to be used with Tanimoto coefficient in the PubChem dataset. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=2D%20fingerprints" title="2D fingerprints">2D fingerprints</a>, <a href="https://publications.waset.org/abstracts/search?q=Tanimoto" title=" Tanimoto"> Tanimoto</a>, <a href="https://publications.waset.org/abstracts/search?q=PubChem" title=" PubChem"> PubChem</a>, <a href="https://publications.waset.org/abstracts/search?q=similarity%20searching" title=" similarity searching"> similarity searching</a>, <a href="https://publications.waset.org/abstracts/search?q=chemoinformatics" title=" chemoinformatics"> chemoinformatics</a> </p> <a href="https://publications.waset.org/abstracts/15097/2d-fingerprint-performance-for-pubchem-chemical-database" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/15097.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">293</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">757</span> Detecting Model Financial Statement Fraud by Auditor Industry Specialization with Fraud Triangle Analysis</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Reskino%20Resky">Reskino Resky</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This research purposes to create a model to detecting financial statement fraud. This research examines the variable of fraud triangle and auditor industry specialization with financial statement fraud. This research used sample of company which is listed in Indonesian Stock Exchange that have sanctions and cases by Financial Services Authority in 2011-2013. The number of company that were became in this research were 30 fraud company and 30 non-fraud company. The method of determining the sample is by using purposive sampling method with judgement sampling, while the data processing methods used by researcher are mann-whitney u and discriminants analysis. This research have two from five variable that can be process with discriminant analysis. The result shows the financial targets can be detect financial statement fraud, while financial stability can’t be detect financial statement fraud. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=fraud%20triangle%20analysis" title="fraud triangle analysis">fraud triangle analysis</a>, <a href="https://publications.waset.org/abstracts/search?q=financial%20targets" title=" financial targets"> financial targets</a>, <a href="https://publications.waset.org/abstracts/search?q=financial%20stability" title=" financial stability"> financial stability</a>, <a href="https://publications.waset.org/abstracts/search?q=auditor%20industry%20specialization" title=" auditor industry specialization"> auditor industry specialization</a>, <a href="https://publications.waset.org/abstracts/search?q=financial%20statement%20fraud" title=" financial statement fraud "> financial statement fraud </a> </p> <a href="https://publications.waset.org/abstracts/27587/detecting-model-financial-statement-fraud-by-auditor-industry-specialization-with-fraud-triangle-analysis" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/27587.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">457</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">756</span> Similarity Based Membership of Elements to Uncertain Concept in Information System</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=M.%20Kamel%20El-Sayed">M. Kamel El-Sayed</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The process of determining the degree of membership for an element to an uncertain concept has been found in many ways, using equivalence and symmetry relations in information systems. In the case of similarity, these methods did not take into account the degree of symmetry between elements. In this paper, we use a new definition for finding the membership based on the degree of symmetry. We provide an example to clarify the suggested methods and compare it with previous methods. This method opens the door to more accurate decisions in information systems. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=information%20system" title="information system">information system</a>, <a href="https://publications.waset.org/abstracts/search?q=uncertain%20concept" title=" uncertain concept"> uncertain concept</a>, <a href="https://publications.waset.org/abstracts/search?q=membership%20function" title=" membership function"> membership function</a>, <a href="https://publications.waset.org/abstracts/search?q=similarity%20relation" title=" similarity relation"> similarity relation</a>, <a href="https://publications.waset.org/abstracts/search?q=degree%20of%20similarity" title=" degree of similarity"> degree of similarity</a> </p> <a href="https://publications.waset.org/abstracts/88086/similarity-based-membership-of-elements-to-uncertain-concept-in-information-system" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/88086.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">223</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">755</span> The Planner's Pentangle: A Proposal for a 21st-Century Model of Planning for Sustainable Development </h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Sonia%20Hirt">Sonia Hirt</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The Planner's Triangle, an oft-cited model that visually defined planning as the search for sustainability to balance the three basic priorities of equity, economy, and environment, has influenced planning theory and practice for a quarter of a century. In this essay, we argue that the triangle requires updating and expansion. Even if planners keep sustainability as their key core aspiration at the center of their imaginary geometry, the triangle's vertices have to be rethought. Planners should move on to a 21st-century concept. We propose a Planner's Pentangle with five basic priorities as vertices of a new conceptual polygon. These five priorities are Wellbeing, Equity, Economy, Environment, and Esthetics (WE⁴). The WE⁴ concept more accurately and fully represents planning’s history. This is especially true in the United States, where public art and public health played pivotal roles in the establishment of the profession in the late 19th and early 20th centuries. It also more accurately represents planning’s future. Both health/wellness and aesthetic concerns are becoming increasingly important in the 21st century. The pentangle can become an effective tool for understanding and visualizing planning's history and present. Planning has a long history of representing urban presents and future as conceptual models in visual form. Such models can play an important role in understanding and shaping practice. For over two decades, one such model, the Planner's Triangle, stood apart as the expression of planning's pursuit for sustainability. But if the model is outdated and insufficiently robust, it can diminish our understanding of planning practice, as well as the appreciation of the profession among non-planners. Thus, we argue for a new conceptual model of what planners do. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=sustainable%20development" title="sustainable development">sustainable development</a>, <a href="https://publications.waset.org/abstracts/search?q=planning%20for%20sustainable%20development" title=" planning for sustainable development"> planning for sustainable development</a>, <a href="https://publications.waset.org/abstracts/search?q=planner%27s%20triangle" title=" planner's triangle"> planner's triangle</a>, <a href="https://publications.waset.org/abstracts/search?q=planner%27s%20pentangle" title=" planner's pentangle"> planner's pentangle</a>, <a href="https://publications.waset.org/abstracts/search?q=planning%20and%20health" title=" planning and health"> planning and health</a>, <a href="https://publications.waset.org/abstracts/search?q=planning%20and%20art" title=" planning and art"> planning and art</a>, <a href="https://publications.waset.org/abstracts/search?q=planning%20history" title=" planning history"> planning history</a> </p> <a href="https://publications.waset.org/abstracts/129290/the-planners-pentangle-a-proposal-for-a-21st-century-model-of-planning-for-sustainable-development" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/129290.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">140</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">754</span> Agglomerative Hierarchical Clustering Using the Tθ Family of Similarity Measures</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Salima%20Kouici">Salima Kouici</a>, <a href="https://publications.waset.org/abstracts/search?q=Abdelkader%20Khelladi"> Abdelkader Khelladi</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this work, we begin with the presentation of the Tθ family of usual similarity measures concerning multidimensional binary data. Subsequently, some properties of these measures are proposed. Finally, the impact of the use of different inter-elements measures on the results of the Agglomerative Hierarchical Clustering Methods is studied. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=binary%20data" title="binary data">binary data</a>, <a href="https://publications.waset.org/abstracts/search?q=similarity%20measure" title=" similarity measure"> similarity measure</a>, <a href="https://publications.waset.org/abstracts/search?q=T%CE%B8%20measures" title=" Tθ measures"> Tθ measures</a>, <a href="https://publications.waset.org/abstracts/search?q=agglomerative%20hierarchical%20clustering" title=" agglomerative hierarchical clustering"> agglomerative hierarchical clustering</a> </p> <a href="https://publications.waset.org/abstracts/13108/agglomerative-hierarchical-clustering-using-the-tth-family-of-similarity-measures" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/13108.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">481</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">753</span> Seismic Performance of RC Frames Equipped with Friction Panels Under Different Slip Load Distributions </h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Neda%20Nabid">Neda Nabid</a>, <a href="https://publications.waset.org/abstracts/search?q=Iman%20Hajirasouliha"> Iman Hajirasouliha</a>, <a href="https://publications.waset.org/abstracts/search?q=Sanaz%20Shirinbar"> Sanaz Shirinbar</a> </p> <p class="card-text"><strong>Abstract:</strong></p> One of the most challenging issues in earthquake engineering is to find effective ways to reduce earthquake forces and damage to structural and non-structural elements under strong earthquakes. While friction dampers are the most efficient systems to improve the seismic performance of substandard structures, their optimum design is a challenging task. This research aims to find more appropriate slip load distribution pattern for efficient design of friction panels. Non-linear dynamic analyses are performed on 3, 5, 10, 15, and 20-story RC frame using Drain-2dx software to find the appropriate range of slip loads and investigate the effects of different distribution patterns (cantilever, uniform, triangle, and reverse triangle) under six different earthquake records. The results indicate that using triangle load distribution can significantly increase the energy dissipation capacity of the frame and reduce the maximum inter-storey drift, and roof displacement. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=friction%20panels" title="friction panels">friction panels</a>, <a href="https://publications.waset.org/abstracts/search?q=slip%20load" title=" slip load"> slip load</a>, <a href="https://publications.waset.org/abstracts/search?q=distribution%20patterns" title=" distribution patterns"> distribution patterns</a>, <a href="https://publications.waset.org/abstracts/search?q=RC%20frames" title=" RC frames"> RC frames</a>, <a href="https://publications.waset.org/abstracts/search?q=energy%20dissipation" title=" energy dissipation"> energy dissipation</a> </p> <a href="https://publications.waset.org/abstracts/13075/seismic-performance-of-rc-frames-equipped-with-friction-panels-under-different-slip-load-distributions" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/13075.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">432</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">752</span> Empirical Study of Partitions Similarity Measures</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Abdelkrim%20Alfalah">Abdelkrim Alfalah</a>, <a href="https://publications.waset.org/abstracts/search?q=Lahcen%20Ouarbya"> Lahcen Ouarbya</a>, <a href="https://publications.waset.org/abstracts/search?q=John%20Howroyd"> John Howroyd</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper investigates and compares the performance of four existing distances and similarity measures between partitions. The partition measures considered are Rand Index (RI), Adjusted Rand Index (ARI), Variation of Information (VI), and Normalised Variation of Information (NVI). This work investigates the ability of these partition measures to capture three predefined intuitions: the variation within randomly generated partitions, the sensitivity to small perturbations, and finally the independence from the dataset scale. It has been shown that the Adjusted Rand Index performed well overall, with regards to these three intuitions. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=clustering" title="clustering">clustering</a>, <a href="https://publications.waset.org/abstracts/search?q=comparing%20partitions" title=" comparing partitions"> comparing partitions</a>, <a href="https://publications.waset.org/abstracts/search?q=similarity%20measure" title=" similarity measure"> similarity measure</a>, <a href="https://publications.waset.org/abstracts/search?q=partition%20distance" title=" partition distance"> partition distance</a>, <a href="https://publications.waset.org/abstracts/search?q=partition%20metric" title=" partition metric"> partition metric</a>, <a href="https://publications.waset.org/abstracts/search?q=similarity%20between%20partitions" title=" similarity between partitions"> similarity between partitions</a>, <a href="https://publications.waset.org/abstracts/search?q=clustering%20comparison." title=" clustering comparison."> clustering comparison.</a> </p> <a href="https://publications.waset.org/abstracts/143607/empirical-study-of-partitions-similarity-measures" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/143607.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">202</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">751</span> A Similarity Measure for Classification and Clustering in Image Based Medical and Text Based Banking Applications</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=K.%20P.%20Sandesh">K. P. Sandesh</a>, <a href="https://publications.waset.org/abstracts/search?q=M.%20H.%20Suman"> M. H. Suman</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Text processing plays an important role in information retrieval, data-mining, and web search. Measuring the similarity between the documents is an important operation in the text processing field. In this project, a new similarity measure is proposed. To compute the similarity between two documents with respect to a feature the proposed measure takes the following three cases into account: (1) The feature appears in both documents; (2) The feature appears in only one document and; (3) The feature appears in none of the documents. The proposed measure is extended to gauge the similarity between two sets of documents. The effectiveness of our measure is evaluated on several real-world data sets for text classification and clustering problems, especially in banking and health sectors. The results show that the performance obtained by the proposed measure is better than that achieved by the other measures. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=document%20classification" title="document classification">document classification</a>, <a href="https://publications.waset.org/abstracts/search?q=document%20clustering" title=" document clustering"> document clustering</a>, <a href="https://publications.waset.org/abstracts/search?q=entropy" title=" entropy"> entropy</a>, <a href="https://publications.waset.org/abstracts/search?q=accuracy" title=" accuracy"> accuracy</a>, <a href="https://publications.waset.org/abstracts/search?q=classifiers" title=" classifiers"> classifiers</a>, <a href="https://publications.waset.org/abstracts/search?q=clustering%20algorithms" title=" clustering algorithms"> clustering algorithms</a> </p> <a href="https://publications.waset.org/abstracts/22708/a-similarity-measure-for-classification-and-clustering-in-image-based-medical-and-text-based-banking-applications" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/22708.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">518</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">750</span> Tool for Determining the Similarity between Two Web Applications</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Doru%20Anastasiu%20Popescu">Doru Anastasiu Popescu</a>, <a href="https://publications.waset.org/abstracts/search?q=Raducanu%20Dragos%20Ionut"> Raducanu Dragos Ionut</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper the presentation of a tool which measures the similarity between two websites is made. The websites are compound only from webpages created with HTML. The tool uses three ways of calculating the similarity between two websites based on certain results already published. The first way compares all the webpages within a website, the second way compares a webpage with all the pages within the second website and the third way compares two webpages. Java programming language and technologies such as spring, Jsoup, log4j were used for the implementation of the tool. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=Java" title="Java">Java</a>, <a href="https://publications.waset.org/abstracts/search?q=Jsoup" title=" Jsoup"> Jsoup</a>, <a href="https://publications.waset.org/abstracts/search?q=HTM" title=" HTM"> HTM</a>, <a href="https://publications.waset.org/abstracts/search?q=spring" title=" spring"> spring</a> </p> <a href="https://publications.waset.org/abstracts/48293/tool-for-determining-the-similarity-between-two-web-applications" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/48293.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">385</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">749</span> Improving Similarity Search Using Clustered Data</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Deokho%20Kim">Deokho Kim</a>, <a href="https://publications.waset.org/abstracts/search?q=Wonwoo%20Lee"> Wonwoo Lee</a>, <a href="https://publications.waset.org/abstracts/search?q=Jaewoong%20Lee"> Jaewoong Lee</a>, <a href="https://publications.waset.org/abstracts/search?q=Teresa%20Ng"> Teresa Ng</a>, <a href="https://publications.waset.org/abstracts/search?q=Gun-Ill%20Lee"> Gun-Ill Lee</a>, <a href="https://publications.waset.org/abstracts/search?q=Jiwon%20Jeong"> Jiwon Jeong</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper presents a method for improving object search accuracy using a deep learning model. A major limitation to provide accurate similarity with deep learning is the requirement of huge amount of data for training pairwise similarity scores (metrics), which is impractical to collect. Thus, similarity scores are usually trained with a relatively small dataset, which comes from a different domain, causing limited accuracy on measuring similarity. For this reason, this paper proposes a deep learning model that can be trained with a significantly small amount of data, a clustered data which of each cluster contains a set of visually similar images. In order to measure similarity distance with the proposed method, visual features of two images are extracted from intermediate layers of a convolutional neural network with various pooling methods, and the network is trained with pairwise similarity scores which is defined zero for images in identical cluster. The proposed method outperforms the state-of-the-art object similarity scoring techniques on evaluation for finding exact items. The proposed method achieves 86.5% of accuracy compared to the accuracy of the state-of-the-art technique, which is 59.9%. That is, an exact item can be found among four retrieved images with an accuracy of 86.5%, and the rest can possibly be similar products more than the accuracy. Therefore, the proposed method can greatly reduce the amount of training data with an order of magnitude as well as providing a reliable similarity metric. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=visual%20search" title="visual search">visual search</a>, <a href="https://publications.waset.org/abstracts/search?q=deep%20learning" title=" deep learning"> deep learning</a>, <a href="https://publications.waset.org/abstracts/search?q=convolutional%20neural%20network" title=" convolutional neural network"> convolutional neural network</a>, <a href="https://publications.waset.org/abstracts/search?q=machine%20learning" title=" machine learning"> machine learning</a> </p> <a href="https://publications.waset.org/abstracts/92185/improving-similarity-search-using-clustered-data" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/92185.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">215</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">748</span> Impact of Similarity Ratings on Human Judgement</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Ian%20A.%20McCulloh">Ian A. McCulloh</a>, <a href="https://publications.waset.org/abstracts/search?q=Madelaine%20Zinser"> Madelaine Zinser</a>, <a href="https://publications.waset.org/abstracts/search?q=Jesse%20Patsolic"> Jesse Patsolic</a>, <a href="https://publications.waset.org/abstracts/search?q=Michael%20Ramos"> Michael Ramos</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Recommender systems are a common artificial intelligence (AI) application. For any given input, a search system will return a rank-ordered list of similar items. As users review returned items, they must decide when to halt the search and either revise search terms or conclude their requirement is novel with no similar items in the database. We present a statistically designed experiment that investigates the impact of similarity ratings on human judgement to conclude a search item is novel and halt the search. 450 participants were recruited from Amazon Mechanical Turk to render judgement across 12 decision tasks. We find the inclusion of ratings increases the human perception that items are novel. Percent similarity increases novelty discernment when compared with star-rated similarity or the absence of a rating. Ratings reduce the time to decide and improve decision confidence. This suggests the inclusion of similarity ratings can aid human decision-makers in knowledge search tasks. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=ratings" title="ratings">ratings</a>, <a href="https://publications.waset.org/abstracts/search?q=rankings" title=" rankings"> rankings</a>, <a href="https://publications.waset.org/abstracts/search?q=crowdsourcing" title=" crowdsourcing"> crowdsourcing</a>, <a href="https://publications.waset.org/abstracts/search?q=empirical%20studies" title=" empirical studies"> empirical studies</a>, <a href="https://publications.waset.org/abstracts/search?q=user%20studies" title=" user studies"> user studies</a>, <a href="https://publications.waset.org/abstracts/search?q=similarity%20measures" title=" similarity measures"> similarity measures</a>, <a href="https://publications.waset.org/abstracts/search?q=human-centered%20computing" title=" human-centered computing"> human-centered computing</a>, <a href="https://publications.waset.org/abstracts/search?q=novelty%20in%20information%20retrieval" title=" novelty in information retrieval"> novelty in information retrieval</a> </p> <a href="https://publications.waset.org/abstracts/163910/impact-of-similarity-ratings-on-human-judgement" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/163910.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">131</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">747</span> Text Similarity in Vector Space Models: A Comparative Study</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Omid%20Shahmirzadi">Omid Shahmirzadi</a>, <a href="https://publications.waset.org/abstracts/search?q=Adam%20Lugowski"> Adam Lugowski</a>, <a href="https://publications.waset.org/abstracts/search?q=Kenneth%20Younge"> Kenneth Younge</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Automatic measurement of semantic text similarity is an important task in natural language processing. In this paper, we evaluate the performance of different vector space models to perform this task. We address the real-world problem of modeling patent-to-patent similarity and compare TFIDF (and related extensions), topic models (e.g., latent semantic indexing), and neural models (e.g., paragraph vectors). Contrary to expectations, the added computational cost of text embedding methods is justified only when: 1) the target text is condensed; and 2) the similarity comparison is trivial. Otherwise, TFIDF performs surprisingly well in other cases: in particular for longer and more technical texts or for making finer-grained distinctions between nearest neighbors. Unexpectedly, extensions to the TFIDF method, such as adding noun phrases or calculating term weights incrementally, were not helpful in our context. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=big%20data" title="big data">big data</a>, <a href="https://publications.waset.org/abstracts/search?q=patent" title=" patent"> patent</a>, <a href="https://publications.waset.org/abstracts/search?q=text%20embedding" title=" text embedding"> text embedding</a>, <a href="https://publications.waset.org/abstracts/search?q=text%20similarity" title=" text similarity"> text similarity</a>, <a href="https://publications.waset.org/abstracts/search?q=vector%20space%20model" title=" vector space model"> vector space model</a> </p> <a href="https://publications.waset.org/abstracts/102930/text-similarity-in-vector-space-models-a-comparative-study" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/102930.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">175</span> </span> </div> </div> <ul class="pagination"> <li class="page-item disabled"><span class="page-link">&lsaquo;</span></li> <li class="page-item active"><span class="page-link">1</span></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=evolutional%20triangle%20similarity&page=2">2</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=evolutional%20triangle%20similarity&page=3">3</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=evolutional%20triangle%20similarity&page=4">4</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=evolutional%20triangle%20similarity&page=5">5</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=evolutional%20triangle%20similarity&page=6">6</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=evolutional%20triangle%20similarity&page=7">7</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=evolutional%20triangle%20similarity&page=8">8</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=evolutional%20triangle%20similarity&page=9">9</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=evolutional%20triangle%20similarity&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=evolutional%20triangle%20similarity&page=25">25</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=evolutional%20triangle%20similarity&page=26">26</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=evolutional%20triangle%20similarity&page=2" rel="next">&rsaquo;</a></li> </ul> </div> </main> <footer> <div id="infolinks" class="pt-3 pb-2"> <div class="container"> <div style="background-color:#f5f5f5;" class="p-3"> <div class="row"> <div class="col-md-2"> <ul class="list-unstyled"> About <li><a href="https://waset.org/page/support">About Us</a></li> <li><a href="https://waset.org/page/support#legal-information">Legal</a></li> <li><a target="_blank" rel="nofollow" href="https://publications.waset.org/static/files/WASET-16th-foundational-anniversary.pdf">WASET celebrates its 16th foundational anniversary</a></li> </ul> </div> <div class="col-md-2"> <ul class="list-unstyled"> Account <li><a href="https://waset.org/profile">My Account</a></li> </ul> </div> <div class="col-md-2"> <ul class="list-unstyled"> Explore <li><a href="https://waset.org/disciplines">Disciplines</a></li> <li><a href="https://waset.org/conferences">Conferences</a></li> <li><a href="https://waset.org/conference-programs">Conference Program</a></li> <li><a href="https://waset.org/committees">Committees</a></li> <li><a href="https://publications.waset.org">Publications</a></li> </ul> </div> <div class="col-md-2"> <ul class="list-unstyled"> Research <li><a href="https://publications.waset.org/abstracts">Abstracts</a></li> <li><a href="https://publications.waset.org">Periodicals</a></li> <li><a href="https://publications.waset.org/archive">Archive</a></li> </ul> </div> <div class="col-md-2"> <ul class="list-unstyled"> Open Science <li><a target="_blank" rel="nofollow" href="https://publications.waset.org/static/files/Open-Science-Philosophy.pdf">Open Science Philosophy</a></li> <li><a target="_blank" rel="nofollow" href="https://publications.waset.org/static/files/Open-Science-Award.pdf">Open Science Award</a></li> <li><a target="_blank" rel="nofollow" href="https://publications.waset.org/static/files/Open-Society-Open-Science-and-Open-Innovation.pdf">Open Innovation</a></li> <li><a target="_blank" rel="nofollow" href="https://publications.waset.org/static/files/Postdoctoral-Fellowship-Award.pdf">Postdoctoral Fellowship Award</a></li> <li><a target="_blank" rel="nofollow" href="https://publications.waset.org/static/files/Scholarly-Research-Review.pdf">Scholarly Research Review</a></li> </ul> </div> <div class="col-md-2"> <ul class="list-unstyled"> Support <li><a href="https://waset.org/page/support">Support</a></li> <li><a href="https://waset.org/profile/messages/create">Contact Us</a></li> <li><a href="https://waset.org/profile/messages/create">Report Abuse</a></li> </ul> </div> </div> </div> </div> </div> <div class="container text-center"> <hr style="margin-top:0;margin-bottom:.3rem;"> <a href="https://creativecommons.org/licenses/by/4.0/" target="_blank" class="text-muted small">Creative Commons Attribution 4.0 International License</a> <div id="copy" class="mt-2">© 2024 World Academy of Science, Engineering and Technology</div> </div> </footer> <a href="javascript:" id="return-to-top"><i class="fas fa-arrow-up"></i></a> <div class="modal" id="modal-template"> <div class="modal-dialog"> <div class="modal-content"> <div class="row m-0 mt-1"> <div class="col-md-12"> <button type="button" class="close" data-dismiss="modal" aria-label="Close"><span aria-hidden="true">×</span></button> </div> </div> <div class="modal-body"></div> </div> </div> </div> <script src="https://cdn.waset.org/static/plugins/jquery-3.3.1.min.js"></script> <script src="https://cdn.waset.org/static/plugins/bootstrap-4.2.1/js/bootstrap.bundle.min.js"></script> <script src="https://cdn.waset.org/static/js/site.js?v=150220211556"></script> <script> jQuery(document).ready(function() { /*jQuery.get("https://publications.waset.org/xhr/user-menu", function (response) { jQuery('#mainNavMenu').append(response); });*/ jQuery.get({ url: "https://publications.waset.org/xhr/user-menu", cache: false }).then(function(response){ jQuery('#mainNavMenu').append(response); }); }); </script> </body> </html>