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: relatively nonexpansive mappings</title> <meta name="description" content="Search results for: relatively nonexpansive mappings"> <meta name="keywords" content="relatively nonexpansive mappings"> <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="relatively nonexpansive mappings" 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="relatively nonexpansive mappings"> <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> 49</div> </div> </div> </div> <h1 class="mt-3 mb-3 text-center" style="font-size:1.6rem;">Search results for: relatively nonexpansive mappings</h1> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">49</span> Fixed Point of Lipschitz Quasi Nonexpansive Mappings</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Maryam%20Moosavi">Maryam Moosavi</a>, <a href="https://publications.waset.org/abstracts/search?q=Hadi%20Khatibzadeh"> Hadi Khatibzadeh</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The main purpose of this paper is to study the proximal point algorithm for quasi-nonexpansive mappings in Hadamard spaces. △-convergence and strong convergence of cyclic resolvents for a finite family of quasi-nonexpansive mappings one to a fixed point of the mappings are established <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=Fixed%20point" title="Fixed point">Fixed point</a>, <a href="https://publications.waset.org/abstracts/search?q=Hadamard%20space" title=" Hadamard space"> Hadamard space</a>, <a href="https://publications.waset.org/abstracts/search?q=Proximal%20point%20algorithm" title=" Proximal point algorithm"> Proximal point algorithm</a>, <a href="https://publications.waset.org/abstracts/search?q=Quasi-nonexpansive%20sequence%20of%20mappings" title=" Quasi-nonexpansive sequence of mappings"> Quasi-nonexpansive sequence of mappings</a>, <a href="https://publications.waset.org/abstracts/search?q=Resolvent" title=" Resolvent"> Resolvent</a> </p> <a href="https://publications.waset.org/abstracts/163471/fixed-point-of-lipschitz-quasi-nonexpansive-mappings" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/163471.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">90</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">48</span> Strong Convergence of an Iterative Sequence in Real Banach Spaces with Kadec Klee Property</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Umar%20Yusuf%20Batsari">Umar Yusuf Batsari</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Let E be a uniformly smooth and uniformly convex real Banach space and C be a nonempty, closed and convex subset of E. Let $V= \{S_i : C\to C, ~i=1, 2, 3\cdots N\}$ be a convex set of relatively nonexpansive mappings containing identity. In this paper, an iterative sequence obtained from CQ algorithm was shown to have strongly converge to a point $\hat{x}$ which is a common fixed point of relatively nonexpansive mappings in V and also solve the system of equilibrium problems in E. The result improve some existing results in the literature. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=relatively%20nonexpansive%20mappings" title="relatively nonexpansive mappings">relatively nonexpansive mappings</a>, <a href="https://publications.waset.org/abstracts/search?q=strong%20convergence" title=" strong convergence"> strong convergence</a>, <a href="https://publications.waset.org/abstracts/search?q=equilibrium%20problems" title=" equilibrium problems"> equilibrium problems</a>, <a href="https://publications.waset.org/abstracts/search?q=uniformly%20smooth%20space" title=" uniformly smooth space"> uniformly smooth space</a>, <a href="https://publications.waset.org/abstracts/search?q=uniformly%20convex%20space" title=" uniformly convex space"> uniformly convex space</a>, <a href="https://publications.waset.org/abstracts/search?q=convex%20set" title=" convex set"> convex set</a>, <a href="https://publications.waset.org/abstracts/search?q=kadec%20klee%20property" title=" kadec klee property"> kadec klee property</a> </p> <a href="https://publications.waset.org/abstracts/21142/strong-convergence-of-an-iterative-sequence-in-real-banach-spaces-with-kadec-klee-property" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/21142.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">422</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">47</span> Algorithms for Computing of Optimization Problems with a Common Minimum-Norm Fixed Point with Applications</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Apirak%20Sombat">Apirak Sombat</a>, <a href="https://publications.waset.org/abstracts/search?q=Teerapol%20Saleewong"> Teerapol Saleewong</a>, <a href="https://publications.waset.org/abstracts/search?q=Poom%20Kumam"> Poom Kumam</a>, <a href="https://publications.waset.org/abstracts/search?q=Parin%20Chaipunya"> Parin Chaipunya</a>, <a href="https://publications.waset.org/abstracts/search?q=Wiyada%20Kumam"> Wiyada Kumam</a>, <a href="https://publications.waset.org/abstracts/search?q=Anantachai%20Padcharoen"> Anantachai Padcharoen</a>, <a href="https://publications.waset.org/abstracts/search?q=Yeol%20Je%20Cho"> Yeol Je Cho</a>, <a href="https://publications.waset.org/abstracts/search?q=Thana%20Sutthibutpong"> Thana Sutthibutpong</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This research is aimed to study a two-step iteration process defined over a finite family of σ-asymptotically quasi-nonexpansive nonself-mappings. The strong convergence is guaranteed under the framework of Banach spaces with some additional structural properties including strict and uniform convexity, reflexivity, and smoothness assumptions. With similar projection technique for nonself-mapping in Hilbert spaces, we hereby use the generalized projection to construct a point within the corresponding domain. Moreover, we have to introduce the use of duality mapping and its inverse to overcome the unavailability of duality representation that is exploit by Hilbert space theorists. We then apply our results for σ-asymptotically quasi-nonexpansive nonself-mappings to solve for ideal efficiency of vector optimization problems composed of finitely many objective functions. We also showed that the obtained solution from our process is the closest to the origin. Moreover, we also give an illustrative numerical example to support our results. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=asymptotically%20quasi-nonexpansive%20nonself-mapping" title="asymptotically quasi-nonexpansive nonself-mapping">asymptotically quasi-nonexpansive nonself-mapping</a>, <a href="https://publications.waset.org/abstracts/search?q=strong%20convergence" title=" strong convergence"> strong convergence</a>, <a href="https://publications.waset.org/abstracts/search?q=fixed%20point" title=" fixed point"> fixed point</a>, <a href="https://publications.waset.org/abstracts/search?q=uniformly%20convex%20and%20uniformly%20smooth%20Banach%20space" title=" uniformly convex and uniformly smooth Banach space"> uniformly convex and uniformly smooth Banach space</a> </p> <a href="https://publications.waset.org/abstracts/58622/algorithms-for-computing-of-optimization-problems-with-a-common-minimum-norm-fixed-point-with-applications" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/58622.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">260</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">46</span> On the System of Split Equilibrium and Fixed Point Problems in Real Hilbert Spaces</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Francis%20O.%20Nwawuru">Francis O. Nwawuru</a>, <a href="https://publications.waset.org/abstracts/search?q=Jeremiah%20N.%20Ezeora"> Jeremiah N. Ezeora</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, a new algorithm for solving the system of split equilibrium and fixed point problems in real Hilbert spaces is considered. The equilibrium bifunction involves a nite family of pseudo-monotone mappings, which is an improvement over monotone operators. More so, it turns out that the solution of the finite family of nonexpansive mappings. The regularized parameters do not depend on Lipschitz constants. Also, the computations of the stepsize, which plays a crucial role in the convergence analysis of the proposed method, do require prior knowledge of the norm of the involved bounded linear map. Furthermore, to speed up the rate of convergence, an inertial term technique is introduced in the proposed method. Under standard assumptions on the operators and the control sequences, using a modified Halpern iteration method, we establish strong convergence, a desired result in applications. Finally, the proposed scheme is applied to solve some optimization problems. The result obtained improves numerous results announced earlier in this direction. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=equilibrium" title="equilibrium">equilibrium</a>, <a href="https://publications.waset.org/abstracts/search?q=Hilbert%20spaces" title=" Hilbert spaces"> Hilbert spaces</a>, <a href="https://publications.waset.org/abstracts/search?q=fixed%20point" title=" fixed point"> fixed point</a>, <a href="https://publications.waset.org/abstracts/search?q=nonexpansive%20mapping" title=" nonexpansive mapping"> nonexpansive mapping</a>, <a href="https://publications.waset.org/abstracts/search?q=extragradient%20method" title=" extragradient method"> extragradient method</a>, <a href="https://publications.waset.org/abstracts/search?q=regularized%20equilibrium" title=" regularized equilibrium"> regularized equilibrium</a> </p> <a href="https://publications.waset.org/abstracts/184412/on-the-system-of-split-equilibrium-and-fixed-point-problems-in-real-hilbert-spaces" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/184412.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">48</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">45</span> A Survey on Fixed Point Iterations in Modular Function Spaces and an Application to Ode</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Hudson%20Akewe">Hudson Akewe</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This research presents complementary results with wider applications on convergence and rate of convergence of classical fixed point theory in Banach spaces to the world of the theory of fixed points of mappings defined in classes of spaces of measurable functions, known in the literature as modular function spaces. The study gives a comprehensive survey of various iterative fixed point results for the classes of multivalued ρ-contractive-like, ρ-quasi-contractive-like, ρ-quasi-contractive, ρ-Zamfirescu and ρ-contraction mappings in the framework of modular function spaces. An example is presented to demonstrate the applicability of the implicit-type iterative schemes to the system of ordinary diﬀerential equations. Furthermore, numerical examples are given to show the rate of convergence of the various explicit Kirk-type and implicit Kirk-type iterative schemes under consideration. Our results complement the results obtained on normed and metric spaces in the literature. Also, our methods of proof serve as a guide to obtain several similar improved results for nonexpansive, pseudo-contractive, and accretive type mappings. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=implicit%20Kirk-type%20iterative%20schemes" title="implicit Kirk-type iterative schemes">implicit Kirk-type iterative schemes</a>, <a href="https://publications.waset.org/abstracts/search?q=multivalued%20mappings" title=" multivalued mappings"> multivalued mappings</a>, <a href="https://publications.waset.org/abstracts/search?q=convergence%20results" title=" convergence results"> convergence results</a>, <a href="https://publications.waset.org/abstracts/search?q=fixed%20point" title=" fixed point"> fixed point</a> </p> <a href="https://publications.waset.org/abstracts/151918/a-survey-on-fixed-point-iterations-in-modular-function-spaces-and-an-application-to-ode" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/151918.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">128</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">44</span> Explicit Iterative Scheme for Approximating a Common Solution of Generalized Mixed Equilibrium Problem and Fixed Point Problem for a Nonexpansive Semigroup in Hilbert Space</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Mohammad%20Farid">Mohammad Farid</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, we introduce and study an explicit iterative method based on hybrid extragradient method to approximate a common solution of generalized mixed equilibrium problem and fixed point problem for a nonexpansive semigroup in Hilbert space. Further, we prove that the sequence generated by the proposed iterative scheme converge strongly to the common solution of generalized mixed equilibrium problem and fixed point problem for a nonexpansive semigroup. This common solution is the unique solution of a variational inequality problem and is the optimality condition for a minimization problem. The results presented in this paper are the supplement, extension and generalization of the previously known results in this area. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=generalized%20mixed%20equilibrium%20problem" title="generalized mixed equilibrium problem">generalized mixed equilibrium problem</a>, <a href="https://publications.waset.org/abstracts/search?q=fixed-point%20problem" title=" fixed-point problem"> fixed-point problem</a>, <a href="https://publications.waset.org/abstracts/search?q=nonexpansive%20semigroup" title=" nonexpansive semigroup"> nonexpansive semigroup</a>, <a href="https://publications.waset.org/abstracts/search?q=variational%20inequality%20problem" title=" variational inequality problem"> variational inequality problem</a>, <a href="https://publications.waset.org/abstracts/search?q=iterative%20algorithms" title=" iterative algorithms"> iterative algorithms</a>, <a href="https://publications.waset.org/abstracts/search?q=hybrid%20extragradient%20method" title=" hybrid extragradient method"> hybrid extragradient method</a> </p> <a href="https://publications.waset.org/abstracts/14070/explicit-iterative-scheme-for-approximating-a-common-solution-of-generalized-mixed-equilibrium-problem-and-fixed-point-problem-for-a-nonexpansive-semigroup-in-hilbert-space" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/14070.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">475</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">43</span> Analysis of Chatterjea Type F-Contraction in F-Metric Space and Application</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Awais%20Asif">Awais Asif</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This article investigates fixed point theorems of Chatterjea type F-contraction in the setting of F-metric space. We relax the conditions of F-contraction and define modified F-contraction for two mappings. The study provides fixed point results for both single-valued and multivalued mappings. The results are further extended to common fixed point theorems for two mappings. Moreover, to discuss the applicability of our results, an application is provided, which shows the role of our results in finding the solution to functional equations in dynamic programming. Our results generalize and extend the existing results in the literature. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=Chatterjea%20type%20F-contraction" title="Chatterjea type F-contraction">Chatterjea type F-contraction</a>, <a href="https://publications.waset.org/abstracts/search?q=F-cauchy%20sequence" title=" F-cauchy sequence"> F-cauchy sequence</a>, <a href="https://publications.waset.org/abstracts/search?q=F-convergent" title=" F-convergent"> F-convergent</a>, <a href="https://publications.waset.org/abstracts/search?q=multi%20valued%20mappings" title=" multi valued mappings"> multi valued mappings</a> </p> <a href="https://publications.waset.org/abstracts/108223/analysis-of-chatterjea-type-f-contraction-in-f-metric-space-and-application" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/108223.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">143</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">42</span> Weak Convergence of Mann Iteration for a Hybrid Pair of Mappings in a Banach Space</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Alemayehu%20Geremew%20Geremew">Alemayehu Geremew Geremew</a> </p> <p class="card-text"><strong>Abstract:</strong></p> We prove the weak convergence of Mann iteration for a hybrid pair of maps to a common fixed point of a selfmap f and a multivalued f nonexpansive mapping T in Banach space E. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=common%20fixed%20point" title="common fixed point">common fixed point</a>, <a href="https://publications.waset.org/abstracts/search?q=Mann%20iteration" title=" Mann iteration"> Mann iteration</a>, <a href="https://publications.waset.org/abstracts/search?q=multivalued%20mapping" title=" multivalued mapping"> multivalued mapping</a>, <a href="https://publications.waset.org/abstracts/search?q=weak%20convergence" title=" weak convergence"> weak convergence</a> </p> <a href="https://publications.waset.org/abstracts/5913/weak-convergence-of-mann-iteration-for-a-hybrid-pair-of-mappings-in-a-banach-space" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/5913.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">335</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">41</span> Subclass of Close-To-Convex Harmonic Mappings</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Jugal%20K.%20Prajapat">Jugal K. Prajapat</a>, <a href="https://publications.waset.org/abstracts/search?q=Manivannan%20M."> Manivannan M.</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this article we have studied a class of sense preserving harmonic mappings in the unit disk D. Let B⁰H (α, β) denote the class of sense-preserving harmonic mappings f=h+g ̅ in the open unit disk D and satisfying the condition |z h״(z)+α (h׳(z)-1) | ≤ β - |z g″(z)+α g′(z)| (α > -1, β > 0). We have proved that B⁰H (α, β) is close-to-convex in D. We also prove that the functions in B⁰H (α, β) are stable harmonic univalent, stable harmonic starlike and stable harmonic convex in D for different values of its parameters. Further, the coefficient estimates, growth results, area theorem, boundary behavior, convolution and convex combination properties of the class B⁰H (α, β) of harmonic mapping are obtained. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=analytic" title="analytic">analytic</a>, <a href="https://publications.waset.org/abstracts/search?q=univalent" title=" univalent"> univalent</a>, <a href="https://publications.waset.org/abstracts/search?q=starlike" title=" starlike"> starlike</a>, <a href="https://publications.waset.org/abstracts/search?q=convex%20and%20close-to-convex" title=" convex and close-to-convex"> convex and close-to-convex</a> </p> <a href="https://publications.waset.org/abstracts/109786/subclass-of-close-to-convex-harmonic-mappings" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/109786.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> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">40</span> Some Inequalities Related with Starlike Log-Harmonic Mappings</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Melike%20Aydo%C4%9Fan">Melike Aydoğan</a>, <a href="https://publications.waset.org/abstracts/search?q=D%C3%BCrdane%20%C3%96zt%C3%BCrk"> Dürdane Öztürk</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Let H(D) be the linear space of all analytic functions defined on the open unit disc. A log-harmonic mappings is a solution of the nonlinear elliptic partial differential equation where w(z) ∈ H(D) is second dilatation such that |w(z)| < 1 for all z ∈ D. The aim of this paper is to define some inequalities of starlike logharmonic functions of order α(0 ≤ α ≤ 1). <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=starlike%20log-harmonic%20functions" title="starlike log-harmonic functions">starlike log-harmonic functions</a>, <a href="https://publications.waset.org/abstracts/search?q=univalent%20functions" title=" univalent functions"> univalent functions</a>, <a href="https://publications.waset.org/abstracts/search?q=distortion%20theorem" title=" distortion theorem"> distortion theorem</a> </p> <a href="https://publications.waset.org/abstracts/22032/some-inequalities-related-with-starlike-log-harmonic-mappings" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/22032.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">525</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">39</span> Basis Theorem of Equivalence of Explicit-Type Iterations for the Class of Multivalued Phi-Quasi-Contrative Maps in Modular Function Spaces</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Hudson%20Akewe">Hudson Akewe</a> </p> <p class="card-text"><strong>Abstract:</strong></p> We prove that the convergence of explicit Mann, explicit Ishikawa, explicit Noor, explicit SP, explicit multistep and explicit multistep-SP fixed point iterative procedures are equivalent for the classes of multi-valued phi-contraction, phi-Zamfirescu and phi-quasi-contractive mappings in the framework of modular function spaces. Our results complement equivalence results on normed and metric spaces in the literature as they elegantly cut out the triangle inequality. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=multistep%20iterative%20procedures" title="multistep iterative procedures">multistep iterative procedures</a>, <a href="https://publications.waset.org/abstracts/search?q=multivalued%20mappings" title=" multivalued mappings"> multivalued mappings</a>, <a href="https://publications.waset.org/abstracts/search?q=equivalence%20results" title=" equivalence results"> equivalence results</a>, <a href="https://publications.waset.org/abstracts/search?q=fixed%20point" title=" fixed point"> fixed point</a> </p> <a href="https://publications.waset.org/abstracts/148112/basis-theorem-of-equivalence-of-explicit-type-iterations-for-the-class-of-multivalued-phi-quasi-contrative-maps-in-modular-function-spaces" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/148112.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">132</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">38</span> A Three-Step Iterative Process for Common Fixed Points of Three Contractive-Like Operators</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Safeer%20Hussain%20Khan">Safeer Hussain Khan</a>, <a href="https://publications.waset.org/abstracts/search?q=H.%20Fukhar-ud-Din"> H. Fukhar-ud-Din</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The concept of quasi-contractive type operators was given by Berinde and extended by Imoru and Olatinwo. They named this new type as contractive-like operators. On the other hand, Xu and Noo introduced a three-step-one-mappings iterative process which can be seen as a generalization of Mann and Ishikawa iterative processes. Approximating common fixed points has its own importance as it has a direct link with minimization problem. Motivated by this, in this paper, we first extend the iterative process of Xu and Noor to the case of three-step-three-mappings and then prove a strong convergence result using contractive-like operators for this iterative process. In general, this generalizes corresponding results using Mann, Ishikawa and Xu-Noor iterative processes with quasi-contractive type operators. It is to be pointed out that our results can also be proved with iterative process involving error terms. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=contractive-like%20operator" title="contractive-like operator">contractive-like operator</a>, <a href="https://publications.waset.org/abstracts/search?q=iterative%20process" title=" iterative process"> iterative process</a>, <a href="https://publications.waset.org/abstracts/search?q=common%20fixed%20point" title=" common fixed point"> common fixed point</a>, <a href="https://publications.waset.org/abstracts/search?q=strong%20convergence" title=" strong convergence"> strong convergence</a> </p> <a href="https://publications.waset.org/abstracts/15892/a-three-step-iterative-process-for-common-fixed-points-of-three-contractive-like-operators" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/15892.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">594</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">37</span> Investigation of the Stability of the F* Iterative Algorithm on Strong Peudocontractive Mappings and Its Applications</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Felix%20Damilola%20Ajibade">Felix Damilola Ajibade</a>, <a href="https://publications.waset.org/abstracts/search?q=Opeyemi%20O.%20Enoch"> Opeyemi O. Enoch</a>, <a href="https://publications.waset.org/abstracts/search?q=Taiwo%20Paul%20Fajusigbe"> Taiwo Paul Fajusigbe</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper is centered on conducting an inquiry into the stability of the F* iterative algorithm to the fixed point of a strongly pseudo-contractive mapping in the framework of uniformly convex Banach spaces. To achieve the desired result, certain existing inequalities in convex Banach spaces were utilized, as well as the stability criteria of Harder and Hicks. Other necessary conditions for the stability of the F* algorithm on strong pseudo-contractive mapping were also obtained. Through a numerical approach, we prove that the F* iterative algorithm is H-stable for strongly pseudo-contractive mapping. Finally, the solution of the mixed-type Volterra-Fredholm functional non-linear integral equation is estimated using our results. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=stability" title="stability">stability</a>, <a href="https://publications.waset.org/abstracts/search?q=F%2A%20-iterative%20algorithm" title=" F* -iterative algorithm"> F* -iterative algorithm</a>, <a href="https://publications.waset.org/abstracts/search?q=pseudo-contractive%20mappings" title=" pseudo-contractive mappings"> pseudo-contractive mappings</a>, <a href="https://publications.waset.org/abstracts/search?q=uniformly%20convex%20Banach%20space" title=" uniformly convex Banach space"> uniformly convex Banach space</a>, <a href="https://publications.waset.org/abstracts/search?q=mixed-type%20Volterra-Fredholm%20integral%20equation" title=" mixed-type Volterra-Fredholm integral equation"> mixed-type Volterra-Fredholm integral equation</a> </p> <a href="https://publications.waset.org/abstracts/167503/investigation-of-the-stability-of-the-f-iterative-algorithm-on-strong-peudocontractive-mappings-and-its-applications" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/167503.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">103</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">36</span> The Simultaneous Effect of Horizontal and Vertical Earthquake Components on the Seismic Response of Buckling-Restrained Braced Frame</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Mahdi%20Shokrollahi">Mahdi Shokrollahi</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Over the past years, much research has been conducted on the vulnerability of structures to earthquakes, which only horizontal components of the earthquake were considered in their seismic analysis and vertical earthquake acceleration especially in near-fault area was less considered. The investigation of the mappings shows that vertical earthquake acceleration can be significantly closer to the maximum horizontal earthquake acceleration, and even exceeds it in some cases. This study has compared the behavior of different members of three steel moment frame with a buckling-restrained brace (BRB), one time only by considering the horizontal component and again by considering simultaneously the horizontal and vertical components under the three mappings of the near-fault area and the effect of vertical acceleration on structural responses is investigated. Finally, according to the results, the vertical component of the earthquake has a greater effect on the axial force of the columns and the vertical displacement of the middle of the beams of the different classes and less on the lateral displacement of the classes. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=vertical%20earthquake%20acceleration" title="vertical earthquake acceleration">vertical earthquake acceleration</a>, <a href="https://publications.waset.org/abstracts/search?q=near-fault%20area" title=" near-fault area"> near-fault area</a>, <a href="https://publications.waset.org/abstracts/search?q=steel%20frame" title=" steel frame"> steel frame</a>, <a href="https://publications.waset.org/abstracts/search?q=horizontal%20and%20vertical%20component%20of%20earthquake" title=" horizontal and vertical component of earthquake"> horizontal and vertical component of earthquake</a>, <a href="https://publications.waset.org/abstracts/search?q=buckling-restrained%20brace" title=" buckling-restrained brace"> buckling-restrained brace</a> </p> <a href="https://publications.waset.org/abstracts/91326/the-simultaneous-effect-of-horizontal-and-vertical-earthquake-components-on-the-seismic-response-of-buckling-restrained-braced-frame" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/91326.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">179</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">35</span> [Keynote Talk]: Existence of Random Fixed Point Theorem for Contractive Mappings</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=D.%20S.%20Palimkar">D. S. Palimkar</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Random fixed point theory has received much attention in recent years, and it is needed for the study of various classes of random equations. The study of random fixed point theorems was initiated by the Prague school of probabilistic in the 1950s. The existence and uniqueness of fixed points for the self-maps of a metric space by altering distances between the points with the use of a control function is an interesting aspect in the classical fixed point theory. In a new category of fixed point problems for a single self-map with the help of a control function that alters the distance between two points in a metric space which they called an altering distance function. In this paper, we prove the results of existence of random common fixed point and its uniqueness for a pair of random mappings under weakly contractive condition for generalizing alter distance function in polish spaces using Random Common Fixed Point Theorem for Generalized Weakly Contractions. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=Polish%20space" title="Polish space">Polish space</a>, <a href="https://publications.waset.org/abstracts/search?q=random%20common%20fixed%20point%20theorem" title=" random common fixed point theorem"> random common fixed point theorem</a>, <a href="https://publications.waset.org/abstracts/search?q=weakly%20contractive%20mapping" title=" weakly contractive mapping"> weakly contractive mapping</a>, <a href="https://publications.waset.org/abstracts/search?q=altering%20function" title=" altering function"> altering function</a> </p> <a href="https://publications.waset.org/abstracts/79650/keynote-talk-existence-of-random-fixed-point-theorem-for-contractive-mappings" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/79650.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">273</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">34</span> Digraph Generated by Idempotents in Certain Finite Semigroup of Mappings</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Hassan%20Ibrahim">Hassan Ibrahim</a>, <a href="https://publications.waset.org/abstracts/search?q=Moses%20Anayo%20Mbah"> Moses Anayo Mbah</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The idempotent generators in a finite full transformation and the digraph of full transformation semi group have been an interesting area of research in group theory. In this work, it characterized some idempotent elements in full transformation semigroup T_n by counting the strongly connected and disconnected digraphs, and also the weakly and unilaterally connected digraphs. The order for those digraphs was further obtained in T_n. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=digraphs" title="digraphs">digraphs</a>, <a href="https://publications.waset.org/abstracts/search?q=indempotent" title=" indempotent"> indempotent</a>, <a href="https://publications.waset.org/abstracts/search?q=semigroup" title=" semigroup"> semigroup</a>, <a href="https://publications.waset.org/abstracts/search?q=transformation" title=" transformation"> transformation</a> </p> <a href="https://publications.waset.org/abstracts/187023/digraph-generated-by-idempotents-in-certain-finite-semigroup-of-mappings" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/187023.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">33</span> Building a Parametric Link between Mapping and Planning: A Sunlight-Adaptive Urban Green System Plan Formation Process</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Chenhao%20Zhu">Chenhao Zhu</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Quantitative mapping is playing a growing role in guiding urban planning, such as using a heat map created by CFX, CFD2000, or Envi-met, to adjust the master plan. However, there is no effective quantitative link between the mappings and planning formation. So, in many cases, the decision-making is still based on the planner's subjective interpretation and understanding of these mappings, which limits the improvement of scientific and accuracy brought by the quantitative mapping. Therefore, in this paper, an effort has been made to give a methodology of building a parametric link between the mapping and planning formation. A parametric planning process based on radiant mapping has been proposed for creating an urban green system. In the first step, a script is written in Grasshopper to build a road network and form the block, while the Ladybug Plug-in is used to conduct a radiant analysis in the form of mapping. Then, the research creatively transforms the radiant mapping from a polygon into a data point matrix, because polygon is hard to engage in the design formation. Next, another script is created to select the main green spaces from the road network based on the criteria of radiant intensity and connect the green spaces' central points to generate a green corridor. After that, a control parameter is introduced to adjust the corridor's form based on the radiant intensity. Finally, a green system containing greenspace and green corridor is generated under the quantitative control of the data matrix. The designer only needs to modify the control parameter according to the relevant research results and actual conditions to realize the optimization of the green system. This method can also be applied to much other mapping-based analysis, such as wind environment analysis, thermal environment analysis, and even environmental sensitivity analysis. The parameterized link between the mapping and planning will bring about a more accurate, objective, and scientific planning. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=parametric%20link" title="parametric link">parametric link</a>, <a href="https://publications.waset.org/abstracts/search?q=mapping" title=" mapping"> mapping</a>, <a href="https://publications.waset.org/abstracts/search?q=urban%20green%20system" title=" urban green system"> urban green system</a>, <a href="https://publications.waset.org/abstracts/search?q=radiant%20intensity" title=" radiant intensity"> radiant intensity</a>, <a href="https://publications.waset.org/abstracts/search?q=planning%20strategy" title=" planning strategy"> planning strategy</a>, <a href="https://publications.waset.org/abstracts/search?q=grasshopper" title=" grasshopper"> grasshopper</a> </p> <a href="https://publications.waset.org/abstracts/109538/building-a-parametric-link-between-mapping-and-planning-a-sunlight-adaptive-urban-green-system-plan-formation-process" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/109538.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">142</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">32</span> AI for Efficient Geothermal Exploration and Utilization</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Velimir%20Monty%20Vesselinov">Velimir Monty Vesselinov</a>, <a href="https://publications.waset.org/abstracts/search?q=Trais%20Kliplhuis"> Trais Kliplhuis</a>, <a href="https://publications.waset.org/abstracts/search?q=Hope%20Jasperson"> Hope Jasperson</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Artificial intelligence (AI) is a powerful tool in the geothermal energy sector, aiding in both exploration and utilization. Identifying promising geothermal sites can be challenging due to limited surface indicators and the need for expensive drilling to confirm subsurface resources. Geothermal reservoirs can be located deep underground and exhibit complex geological structures, making traditional exploration methods time-consuming and imprecise. AI algorithms can analyze vast datasets of geological, geophysical, and remote sensing data, including satellite imagery, seismic surveys, geochemistry, geology, etc. Machine learning algorithms can identify subtle patterns and relationships within this data, potentially revealing hidden geothermal potential in areas previously overlooked. To address these challenges, a SIML (Science-Informed Machine Learning) technology has been developed. SIML methods are different from traditional ML techniques. In both cases, the ML models are trained to predict the spatial distribution of an output (e.g., pressure, temperature, heat flux) based on a series of inputs (e.g., permeability, porosity, etc.). The traditional ML (a) relies on deep and wide neural networks (NNs) based on simple algebraic mappings to represent complex processes. In contrast, the SIML neurons incorporate complex mappings (including constitutive relationships and physics/chemistry models). This results in ML models that have a physical meaning and satisfy physics laws and constraints. The prototype of the developed software, called GeoTGO, is accessible through the cloud. Our software prototype demonstrates how different data sources can be made available for processing, executed demonstrative SIML analyses, and presents the results in a table and graphic form. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=science-informed%20machine%20learning" title="science-informed machine learning">science-informed machine learning</a>, <a href="https://publications.waset.org/abstracts/search?q=artificial%20inteligence" title=" artificial inteligence"> artificial inteligence</a>, <a href="https://publications.waset.org/abstracts/search?q=exploration" title=" exploration"> exploration</a>, <a href="https://publications.waset.org/abstracts/search?q=utilization" title=" utilization"> utilization</a>, <a href="https://publications.waset.org/abstracts/search?q=hidden%20geothermal" title=" hidden geothermal"> hidden geothermal</a> </p> <a href="https://publications.waset.org/abstracts/186502/ai-for-efficient-geothermal-exploration-and-utilization" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/186502.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">53</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">31</span> Split Monotone Inclusion and Fixed Point Problems in Real Hilbert Spaces</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Francis%20O.%20Nwawuru">Francis O. Nwawuru</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The convergence analysis of split monotone inclusion problems and fixed point problems of certain nonlinear mappings are investigated in the setting of real Hilbert spaces. Inertial extrapolation term in the spirit of Polyak is incorporated to speed up the rate of convergence. Under standard assumptions, a strong convergence of the proposed algorithm is established without computing the resolvent operator or involving Yosida approximation method. The stepsize involved in the algorithm does not depend on the spectral radius of the linear operator. Furthermore, applications of the proposed algorithm in solving some related optimization problems are also considered. Our result complements and extends numerous results in the literature. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=fixedpoint" title="fixedpoint">fixedpoint</a>, <a href="https://publications.waset.org/abstracts/search?q=hilbertspace" title=" hilbertspace"> hilbertspace</a>, <a href="https://publications.waset.org/abstracts/search?q=monotonemapping" title=" monotonemapping"> monotonemapping</a>, <a href="https://publications.waset.org/abstracts/search?q=resolventoperators" title=" resolventoperators"> resolventoperators</a> </p> <a href="https://publications.waset.org/abstracts/183967/split-monotone-inclusion-and-fixed-point-problems-in-real-hilbert-spaces" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/183967.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">52</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">30</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">29</span> Existence of positive periodic solutions for certain delay differential equations </h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Farid%20Nouioua">Farid Nouioua</a>, <a href="https://publications.waset.org/abstracts/search?q=Abdelouaheb%20Ardjouni"> Abdelouaheb Ardjouni</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this article, we study the existence of positive periodic solutions of certain delay differential equations. In the process we convert the differential equation into an equivalent integral equation after which appropriate mappings are constructed. We then employ Krasnoselskii's fixed point theorem to obtain sufficient conditions for the existence of a positive periodic solution of the differential equation. The obtained results improve and extend the results in the literature. Finally, an example is given to illustrate our results. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=delay%20differential%20equations" title="delay differential equations">delay differential equations</a>, <a href="https://publications.waset.org/abstracts/search?q=positive%20periodic%20solutions" title=" positive periodic solutions"> positive periodic solutions</a>, <a href="https://publications.waset.org/abstracts/search?q=integral%20equations" title=" integral equations"> integral equations</a>, <a href="https://publications.waset.org/abstracts/search?q=Krasnoselskii%20fixed%20point%20theorem" title=" Krasnoselskii fixed point theorem"> Krasnoselskii fixed point theorem</a> </p> <a href="https://publications.waset.org/abstracts/40904/existence-of-positive-periodic-solutions-for-certain-delay-differential-equations" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/40904.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">438</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">28</span> Discovering Semantic Links Between Synonyms, Hyponyms and Hypernyms</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Ricardo%20Avila">Ricardo Avila</a>, <a href="https://publications.waset.org/abstracts/search?q=Gabriel%20Lopes"> Gabriel Lopes</a>, <a href="https://publications.waset.org/abstracts/search?q=Vania%20Vidal"> Vania Vidal</a>, <a href="https://publications.waset.org/abstracts/search?q=Jose%20Macedo"> Jose Macedo</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This proposal aims for semantic enrichment between glossaries using the Simple Knowledge Organization System (SKOS) vocabulary to discover synonyms, hyponyms and hyperonyms semiautomatically, in Brazilian Portuguese, generating new semantic relationships based on WordNet. To evaluate the quality of this proposed model, experiments were performed by the use of two sets containing new relations, being one generated automatically and the other manually mapped by the domain expert. The applied evaluation metrics were precision, recall, f-score, and confidence interval. The results obtained demonstrate that the applied method in the field of Oil Production and Extraction (E&P) is effective, which suggests that it can be used to improve the quality of terminological mappings. The procedure, although adding complexity in its elaboration, can be reproduced in others domains. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=ontology%20matching" title="ontology matching">ontology matching</a>, <a href="https://publications.waset.org/abstracts/search?q=mapping%20enrichment" title=" mapping enrichment"> mapping enrichment</a>, <a href="https://publications.waset.org/abstracts/search?q=semantic%20web" title=" semantic web"> semantic web</a>, <a href="https://publications.waset.org/abstracts/search?q=linked%20data" title=" linked data"> linked data</a>, <a href="https://publications.waset.org/abstracts/search?q=SKOS" title=" SKOS"> SKOS</a> </p> <a href="https://publications.waset.org/abstracts/103911/discovering-semantic-links-between-synonyms-hyponyms-and-hypernyms" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/103911.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">216</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">27</span> Discovering the Dimension of Abstractness: Structure-Based Model that Learns New Categories and Categorizes on Different Levels of Abstraction</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Georgi%20I.%20Petkov">Georgi I. Petkov</a>, <a href="https://publications.waset.org/abstracts/search?q=Ivan%20I.%20Vankov"> Ivan I. Vankov</a>, <a href="https://publications.waset.org/abstracts/search?q=Yolina%20A.%20Petrova"> Yolina A. Petrova</a> </p> <p class="card-text"><strong>Abstract:</strong></p> A structure-based model of category learning and categorization at different levels of abstraction is presented. The model compares different structures and expresses their similarity implicitly in the forms of mappings. Based on this similarity, the model can categorize different targets either as members of categories that it already has or creates new categories. The model is novel using two threshold parameters to evaluate the structural correspondence. If the similarity between two structures exceeds the higher threshold, a new sub-ordinate category is created. Vice versa, if the similarity does not exceed the higher threshold but does the lower one, the model creates a new category on higher level of abstraction. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=analogy-making" title="analogy-making">analogy-making</a>, <a href="https://publications.waset.org/abstracts/search?q=categorization" title=" categorization"> categorization</a>, <a href="https://publications.waset.org/abstracts/search?q=learning%20of%20categories" title=" learning of categories"> learning of categories</a>, <a href="https://publications.waset.org/abstracts/search?q=abstraction" title=" abstraction"> abstraction</a>, <a href="https://publications.waset.org/abstracts/search?q=hierarchical%20structure" title=" hierarchical structure"> hierarchical structure</a> </p> <a href="https://publications.waset.org/abstracts/94222/discovering-the-dimension-of-abstractness-structure-based-model-that-learns-new-categories-and-categorizes-on-different-levels-of-abstraction" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/94222.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">190</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">26</span> Resources-Based Ontology Matching to Access Learning Resources</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=A.%20Elbyed">A. Elbyed</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Nowadays, ontologies are used for achieving a common understanding within a user community and for sharing domain knowledge. However, the de-centralized nature of the web makes indeed inevitable that small communities will use their own ontologies to describe their data and to index their own resources. Certainly, accessing to resources from various ontologies created independently is an important challenge for answering end user queries. Ontology mapping is thus required for combining ontologies. However, mapping complete ontologies at run time is a computationally expensive task. This paper proposes a system in which mappings between concepts may be generated dynamically as the concepts are encountered during user queries. In this way, the interaction itself defines the context in which small and relevant portions of ontologies are mapped. We illustrate application of the proposed system in the context of Technology Enhanced Learning (TEL) where learners need to access to learning resources covering specific concepts. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=resources%20query" title="resources query">resources query</a>, <a href="https://publications.waset.org/abstracts/search?q=ontologies" title=" ontologies"> ontologies</a>, <a href="https://publications.waset.org/abstracts/search?q=ontology%20mapping" title=" ontology mapping"> ontology mapping</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=semantic%20web" title=" semantic web"> semantic web</a>, <a href="https://publications.waset.org/abstracts/search?q=e-learning" title=" e-learning"> e-learning</a> </p> <a href="https://publications.waset.org/abstracts/43305/resources-based-ontology-matching-to-access-learning-resources" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/43305.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">312</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">25</span> How to “Eat” without Actually Eating: Marking Metaphor with Spanish Se and Italian Si</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Cinzia%20Russi">Cinzia Russi</a>, <a href="https://publications.waset.org/abstracts/search?q=Chiyo%20Nishida"> Chiyo Nishida</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Using data from online corpora (Spanish CREA, Italian CORIS), this paper examines the relatively understudied use of Spanish se and Italian si exemplified in (1) and (2), respectively. (1) El rojo es … el que se come a los demás. ‘The red (bottle) is the one that outshines/*eats the rest.’(2) … ebbe anche la saggezza di mangiarsi tutto il suo patrimonio. ‘… he even had the wisdom to squander/*eat all his estate.’ In these sentences, se/si accompanies the consumption verb comer/mangiare ‘to eat’, without which the sentences would not be interpreted appropriately. This se/si cannot readily be attributed to any of the multiple functions so far identified in the literature: reflexive, ergative, middle/passive, inherent, benefactive, and complete consumptive. In particular, this paper argues against the feasibility of a recent construction-based analysis of sentences like (1) and (2), which situates se/si within a prototype-based network of meanings all deriving from the central meaning of 'COMPLETE CONSUMPTION' (e.g., Alice se comió toda la torta/Alicesi è mangiata tutta la torta ‘John ate the whole cake’). Clearly, the empirical adequacy of such an account is undermined by the fact that the events depicted in the se/si-sentences at issue do not always entail complete consumption because they may lack an INCREMENTAL THEME, the distinguishing property of complete consumption. Alternatively, it is proposed that the sentences under analysis represent instances of verbal METAPHORICAL EXTENSION: se/si represents an explicit marker of this cognitive process, which has independently developed from the complete consumptive se/si, and the meaning extension is captured by the general tenets of Conceptual Metaphor Theory (CMT). Two conceptual domains, Source (DS) and target (DT), are related by similarity, assigning an appropriate metaphorical interpretation to DT. The domains paired here are comer/mangiare (DS) and comerse/mangiarsi (DT). The eating event (DS) involves (a) the physical process of xEATER grinding yFOOD-STUFF into pieces and swallowing it; and (b) the aspect of xEATER savoring yFOOD-STUFF and being nurtured by it. In the physical act of eating, xEATER has dominance and exercises his force over yFOOD-STUFF. This general sense of dominance and force is mapped onto DT and is manifested in the ways exemplified in (1) and (2), and many others. According to CMT, two other properties are observed in each pair of DS & DT. First, DS tends to be more physical and concrete and DT more abstract, and systematic mappings are established between constituent elements in DS and those in DT: xEATER corresponds to the element that destroys and yFOOD-STUFF to the element that is destroyed in DT, as exemplified in (1) and (2). Though the metaphorical extension marker se/si appears by far most frequently with comer/mangiare in the corpora, similar systematic mappings are observed in several other verb pairs, for example, jugar/giocare ‘to play (games)’ and jugarse/giocarsi ‘to jeopardize/risk (life, reputation, etc.)’, perder/perdere ‘to lose (an object)’ and perderse/perdersi ‘to miss out on (an event)’, etc. Thus, this study provides evidence that languages may indeed formally mark metaphor using means available to them. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=complete%20consumption%20value" title="complete consumption value">complete consumption value</a>, <a href="https://publications.waset.org/abstracts/search?q=conceptual%20metaphor" title=" conceptual metaphor"> conceptual metaphor</a>, <a href="https://publications.waset.org/abstracts/search?q=Italian%20si%2FSpanish%20se" title=" Italian si/Spanish se"> Italian si/Spanish se</a>, <a href="https://publications.waset.org/abstracts/search?q=metaphorical%20extension." title=" metaphorical extension."> metaphorical extension.</a> </p> <a href="https://publications.waset.org/abstracts/183480/how-to-eat-without-actually-eating-marking-metaphor-with-spanish-se-and-italian-si" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/183480.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">53</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">24</span> Residual Stress Around Embedded Particles in Bulk YBa2Cu3Oy Samples</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Anjela%20Koblischka-Veneva">Anjela Koblischka-Veneva</a>, <a href="https://publications.waset.org/abstracts/search?q=Michael%20R.%20Koblischka"> Michael R. Koblischka</a> </p> <p class="card-text"><strong>Abstract:</strong></p> To increase the flux pinning performance of bulk YBa2Cu3O7-δ (YBCO or Y-123) superconductors, it is common to employ secondary phase particles, either Y2BaCuO5 (Y-211) particles created during the growth of the samples or additionally added (nano)particles of various types, embedded in the superconducting Y-123 matrix. As the crystallographic parameters of all the particles indicate a misfit to Y-123, there will be residual strain within the Y-123 matrix around such particles. With a dedicated analysis of electron backscatter diffraction (EBSD) data obtained on various bulk, Y-123 superconductor samples, the strain distribution around such embedded secondary phase particles can be revealed. The results obtained are presented in form of Kernel Average Misorientation (KAM) mappings. Around large Y-211 particles, the strain can be so large that YBCO subgrains are formed. Therefore, it is essential to properly control the particle size as well as their distribution within the bulk sample to obtain the best performance. The impact of the strain distribution on the flux pinning properties is discussed. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=Bulk%20superconductors" title="Bulk superconductors">Bulk superconductors</a>, <a href="https://publications.waset.org/abstracts/search?q=EBSD" title=" EBSD"> EBSD</a>, <a href="https://publications.waset.org/abstracts/search?q=Strain" title=" Strain"> Strain</a>, <a href="https://publications.waset.org/abstracts/search?q=YBa2Cu3Oy" title=" YBa2Cu3Oy"> YBa2Cu3Oy</a> </p> <a href="https://publications.waset.org/abstracts/122638/residual-stress-around-embedded-particles-in-bulk-yba2cu3oy-samples" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/122638.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">150</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">23</span> Synaesthetic Metaphors in Persian: a Cognitive Corpus Based and Comparative Perspective</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=A.%20Afrashi">A. Afrashi</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Introduction: Synaesthesia is a term denoting the perception or description of the perception of one sense modality in terms of another. In literature, synaesthesia refers to a technique adopted by writers to present ideas, characters or places in such a manner that they appeal to more than one sense like hearing, seeing, smell etc. at a given time. In everyday language too we find many examples of synaesthesia. We commonly hear phrases like ‘loud colors’, ‘frozen silence’ and ‘warm colors’, ‘bitter cold’ etc. Empirical cognitive studies have proved that synaesthetic representations both in literature and everyday languages are constrained ie. they do not map randomly among sensory domains. From the beginning of the 20th century Synaesthesia has been a research domain both in literature and structural linguistics. However the exploration of cognitive mechanisms motivating synaesthesia, have made it an important topic in 21st century cognitive linguistics and literary studies. Synaesthetic metaphors are linguistic representations of those mental mechanisms, the study of which reveals invaluable facts about perception, cognition and conceptualization. According to the main tenets of cognitive approach to language and literature, unified and similar cognitive mechanisms are active both in everyday language and literature, and synaesthesia is one of those cognitive mechanisms. Main objective of the present research is to answer the following questions: What types of sense transfers are accessible in Persian synaesthetic metaphors. How are these types of sense transfers cognitively explained. What are the results of cross-linguistic comparative study of synaestetic metaphors based on the existing observations? Methodology: The present research employs a cognitive - corpus based method, and the theoretical framework adopted to analyze linguistic synaesthesia is the contemporary theory of metaphor, where conceptual metaphor is the result of systemic mappings across cognitive domains. Persian Language Data- base (PLDB) in the Institute for Humanities and Cultural Studies which consists mainly of Persian modern prose, is searched for synaesthetic metaphors. Then for each metaphorical structure, the source and target domains are determined. Then sense transfers are identified and the types of synaesthetic metaphors recognized. Findings: Persian synaesthetic metaphors conform to the hierarchical distribution principle, according to which transfers tend to go from touch to taste to smell to sound and to sight, not vice versa. In other words mapping from more accessible or basic concepts onto less accessible or less basic ones seems more natural. Furthermore the most frequent target domain in Persian synaesthetic metaphors is sound. Certain characteristics of Persian synaesthetic metaphors are comparable with existing related researches carried on English, French, Hungarian and Chinese synaesthetic metaphors. Conclusion: Cognitive corpus based approaches to linguistic synaesthesia, are applicable to stylistics and literary criticism and this recent research domain is an efficient approach to study cross linguistic variations to find out which of the five senses is dominant cross linguistically and cross culturally as the target domain in metaphorical mappings , and so forth receiving dominance in conceptualizations. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=cognitive%20semantics" title="cognitive semantics">cognitive semantics</a>, <a href="https://publications.waset.org/abstracts/search?q=conceptual%20metaphor" title=" conceptual metaphor"> conceptual metaphor</a>, <a href="https://publications.waset.org/abstracts/search?q=synaesthesia" title=" synaesthesia"> synaesthesia</a>, <a href="https://publications.waset.org/abstracts/search?q=corpus%20based%20approach" title=" corpus based approach"> corpus based approach</a> </p> <a href="https://publications.waset.org/abstracts/35571/synaesthetic-metaphors-in-persian-a-cognitive-corpus-based-and-comparative-perspective" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/35571.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">562</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">22</span> Nadler's Fixed Point Theorem on Partial Metric Spaces and its Application to a Homotopy Result</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Hemant%20Kumar%20Pathak">Hemant Kumar Pathak</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In 1994, Matthews (S.G. Matthews, Partial metric topology, in: Proc. 8th Summer Conference on General Topology and Applications, in: Ann. New York Acad. Sci., vol. 728, 1994, pp. 183-197) introduced the concept of a partial metric as a part of the study of denotational semantics of data flow networks. He gave a modified version of the Banach contraction principle, more suitable in this context. In fact, (complete) partial metric spaces constitute a suitable framework to model several distinguished examples of the theory of computation and also to model metric spaces via domain theory. In this paper, we introduce the concept of almost partial Hausdorff metric. We prove a fixed point theorem for multi-valued mappings on partial metric space using the concept of almost partial Hausdorff metric and prove an analogous to the well-known Nadler’s fixed point theorem. In the sequel, we derive a homotopy result as an application of our main result. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=fixed%20point" title="fixed point">fixed point</a>, <a href="https://publications.waset.org/abstracts/search?q=partial%20metric%20space" title=" partial metric space"> partial metric space</a>, <a href="https://publications.waset.org/abstracts/search?q=homotopy" title=" homotopy"> homotopy</a>, <a href="https://publications.waset.org/abstracts/search?q=physical%20sciences" title=" physical sciences"> physical sciences</a> </p> <a href="https://publications.waset.org/abstracts/5182/nadlers-fixed-point-theorem-on-partial-metric-spaces-and-its-application-to-a-homotopy-result" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/5182.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">441</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">21</span> Generative Adversarial Network for Bidirectional Mappings between Retinal Fundus Images and Vessel Segmented Images</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Haoqi%20Gao">Haoqi Gao</a>, <a href="https://publications.waset.org/abstracts/search?q=Koichi%20Ogawara"> Koichi Ogawara</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Retinal vascular segmentation of color fundus is the basis of ophthalmic computer-aided diagnosis and large-scale disease screening systems. Early screening of fundus diseases has great value for clinical medical diagnosis. The traditional methods depend on the experience of the doctor, which is time-consuming, labor-intensive, and inefficient. Furthermore, medical images are scarce and fraught with legal concerns regarding patient privacy. In this paper, we propose a new Generative Adversarial Network based on CycleGAN for retinal fundus images. This method can generate not only synthetic fundus images but also generate corresponding segmentation masks, which has certain application value and challenge in computer vision and computer graphics. In the results, we evaluate our proposed method from both quantitative and qualitative. For generated segmented images, our method achieves dice coefficient of 0.81 and PR of 0.89 on DRIVE dataset. For generated synthetic fundus images, we use ”Toy Experiment” to verify the state-of-the-art performance of our method. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=retinal%20vascular%20segmentations" title="retinal vascular segmentations">retinal vascular segmentations</a>, <a href="https://publications.waset.org/abstracts/search?q=generative%20ad-versarial%20network" title=" generative ad-versarial network"> generative ad-versarial network</a>, <a href="https://publications.waset.org/abstracts/search?q=cyclegan" title=" cyclegan"> cyclegan</a>, <a href="https://publications.waset.org/abstracts/search?q=fundus%20images" title=" fundus images"> fundus images</a> </p> <a href="https://publications.waset.org/abstracts/110591/generative-adversarial-network-for-bidirectional-mappings-between-retinal-fundus-images-and-vessel-segmented-images" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/110591.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">144</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">20</span> Exploring the Neural Mechanisms of Communication and Cooperation in Children and Adults</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Sara%20Mosteller">Sara Mosteller</a>, <a href="https://publications.waset.org/abstracts/search?q=Larissa%20K.%20Samuelson"> Larissa K. Samuelson</a>, <a href="https://publications.waset.org/abstracts/search?q=Sobanawartiny%20Wijeakumar"> Sobanawartiny Wijeakumar</a>, <a href="https://publications.waset.org/abstracts/search?q=John%20P.%20Spencer"> John P. Spencer</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This study was designed to examine how humans are able to teach and learn semantic information as well as cooperate in order to jointly achieve sophisticated goals. Specifically, we are measuring individual differences in how these abilities develop from foundational building blocks in early childhood. The current study adopts a paradigm for novel noun learning developed by Samuelson, Smith, Perry, and Spencer (2011) to a hyperscanning paradigm [Cui, Bryant and Reiss, 2012]. This project measures coordinated brain activity between a parent and child using simultaneous functional near infrared spectroscopy (fNIRS) in pairs of 2.5, 3.5 and 4.5-year-old children and their parents. We are also separately testing pairs of adult friends. Children and parents, or adult friends, are seated across from one another at a table. The parent (in the developmental study) then teaches their child the names of novel toys. An experimenter then tests the child by presenting the objects in pairs and asking the child to retrieve one object by name. Children are asked to choose from both pairs of familiar objects and pairs of novel objects. In order to explore individual differences in cooperation with the same participants, each dyad plays a cooperative game of Jenga, in which their joint score is based on how many blocks they can remove from the tower as a team. A preliminary analysis of the noun-learning task showed that, when presented with 6 word-object mappings, children learned an average of 3 new words (50%) and that the number of objects learned by each child ranged from 2-4. Adults initially learned all of the new words but were variable in their later retention of the mappings, which ranged from 50-100%. We are currently examining differences in cooperative behavior during the Jenga playing game, including time spent discussing each move before it is made. Ongoing analyses are examining the social dynamics that might underlie the differences between words that were successfully learned and unlearned words for each dyad, as well as the developmental differences observed in the study. Additionally, the Jenga game is being used to better understand individual and developmental differences in social coordination during a cooperative task. At a behavioral level, the analysis maps periods of joint visual attention between participants during the word learning and the Jenga game, using head-mounted eye trackers to assess each participant’s first-person viewpoint during the session. We are also analyzing the coherence in brain activity between participants during novel word-learning and Jenga playing. The first hypothesis is that visual joint attention during the session will be positively correlated with both the number of words learned and with the number of blocks moved during Jenga before the tower falls. The next hypothesis is that successful communication of new words and success in the game will each be positively correlated with synchronized brain activity between the parent and child/the adult friends in cortical regions underlying social cognition, semantic processing, and visual processing. This study probes both the neural and behavioral mechanisms of learning and cooperation in a naturalistic, interactive and developmental context. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=communication" title="communication">communication</a>, <a href="https://publications.waset.org/abstracts/search?q=cooperation" title=" cooperation"> cooperation</a>, <a href="https://publications.waset.org/abstracts/search?q=development" title=" development"> development</a>, <a href="https://publications.waset.org/abstracts/search?q=interaction" title=" interaction"> interaction</a>, <a href="https://publications.waset.org/abstracts/search?q=neuroscience" title=" neuroscience"> neuroscience</a> </p> <a href="https://publications.waset.org/abstracts/88207/exploring-the-neural-mechanisms-of-communication-and-cooperation-in-children-and-adults" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/88207.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">252</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=relatively%20nonexpansive%20mappings&page=2">2</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=relatively%20nonexpansive%20mappings&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>