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: analytical convex expressions</title> <meta name="description" content="Search results for: analytical convex expressions"> <meta name="keywords" content="analytical convex expressions"> <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="analytical convex expressions" 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="analytical convex expressions"> <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> 2980</div> </div> </div> </div> <h1 class="mt-3 mb-3 text-center" style="font-size:1.6rem;">Search results for: analytical convex expressions</h1> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">2980</span> From Convexity in Graphs to Polynomial Rings</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Ladznar%20S.%20Laja">Ladznar S. Laja</a>, <a href="https://publications.waset.org/abstracts/search?q=Rosalio%20G.%20Artes"> Rosalio G. Artes</a>, <a href="https://publications.waset.org/abstracts/search?q=Jr."> Jr.</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper introduced a graph polynomial relating convexity concepts. A graph polynomial is a polynomial representing a graph given some parameters. On the other hand, a subgraph H of a graph G is said to be convex in G if for every pair of vertices in H, every shortest path with these end-vertices lies entirely in H. We define the convex subgraph polynomial of a graph G to be the generating function of the sequence of the numbers of convex subgraphs of G of cardinalities ranging from zero to the order of G. This graph polynomial is monic since G itself is convex. The convex index which counts the number of convex subgraphs of G of all orders is just the evaluation of this polynomial at 1. Relationships relating algebraic properties of convex subgraphs polynomial with graph theoretic concepts are established. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=convex%20subgraph" title="convex subgraph">convex subgraph</a>, <a href="https://publications.waset.org/abstracts/search?q=convex%20index" title=" convex index"> convex index</a>, <a href="https://publications.waset.org/abstracts/search?q=generating%20function" title=" generating function"> generating function</a>, <a href="https://publications.waset.org/abstracts/search?q=polynomial%20ring" title=" polynomial ring"> polynomial ring</a> </p> <a href="https://publications.waset.org/abstracts/9019/from-convexity-in-graphs-to-polynomial-rings" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/9019.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">215</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">2979</span> Jensen's Inequality and M-Convex Functions</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Yamin%20Sayyari">Yamin Sayyari</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, we generalized the Jensen's inequality for m-convex functions and also we present a correction of Jensen's inequality which is a better than the generalization of this inequality for m-convex functions. Finally, we have found new lower and new upper bounds for Jensen's discrete inequality. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=Jensen%27s%20inequality" title="Jensen's inequality">Jensen's inequality</a>, <a href="https://publications.waset.org/abstracts/search?q=m-convex%20function" title=" m-convex function"> m-convex function</a>, <a href="https://publications.waset.org/abstracts/search?q=Convex%20function" title=" Convex function"> Convex function</a>, <a href="https://publications.waset.org/abstracts/search?q=Inequality" title=" Inequality"> Inequality</a> </p> <a href="https://publications.waset.org/abstracts/129556/jensens-inequality-and-m-convex-functions" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/129556.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">145</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">2978</span> Interaction Diagrams for Symmetrically Reinforced Concrete Square Sections Under 3 Dimensional Multiaxial Loading Conditions</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Androniki-Anna%20Doulgeroglou">Androniki-Anna Doulgeroglou</a>, <a href="https://publications.waset.org/abstracts/search?q=Panagiotis%20Kotronis"> Panagiotis Kotronis</a>, <a href="https://publications.waset.org/abstracts/search?q=Giulio%20Sciarra"> Giulio Sciarra</a>, <a href="https://publications.waset.org/abstracts/search?q=Catherine%20Bouillon"> Catherine Bouillon</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The interaction diagrams are functions that define ultimate states expressed in terms of generalized forces (axial force, bending moment and shear force). Two characteristic states for reinforced concrete (RC) sections are proposed: the first characteristic state corresponds to the yield of the reinforcement bars and the second to the peak values of the generalized forces generalized displacements curves. 3D numerical simulations are then conducted for RC columns and the global responses are compared to experimental results. Interaction diagrams for combined flexion, shear and axial force loading conditions are numerically produced for symmetrically RC square sections for different reinforcement ratios. Analytical expressions of the interaction diagrams are also proposed, satisfying the condition of convexity. Comparison with interaction diagrams from the Eurocode is finally presented for the study cases. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=analytical%20convex%20expressions" title="analytical convex expressions">analytical convex expressions</a>, <a href="https://publications.waset.org/abstracts/search?q=finite%20element%20method" title=" finite element method"> finite element method</a>, <a href="https://publications.waset.org/abstracts/search?q=interaction%20diagrams" title=" interaction diagrams"> interaction diagrams</a>, <a href="https://publications.waset.org/abstracts/search?q=reinforced%20concrete" title=" reinforced concrete"> reinforced concrete</a> </p> <a href="https://publications.waset.org/abstracts/150050/interaction-diagrams-for-symmetrically-reinforced-concrete-square-sections-under-3-dimensional-multiaxial-loading-conditions" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/150050.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">147</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">2977</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">176</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">2976</span> Approximation of Convex Set by Compactly Semidefinite Representable Set</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Anusuya%20Ghosh">Anusuya Ghosh</a>, <a href="https://publications.waset.org/abstracts/search?q=Vishnu%20Narayanan"> Vishnu Narayanan</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The approximation of convex set by semidefinite representable set plays an important role in semidefinite programming, especially in modern convex optimization. To optimize a linear function over a convex set is a hard problem. But optimizing the linear function over the semidefinite representable set which approximates the convex set is easy to solve as there exists numerous efficient algorithms to solve semidefinite programming problems. So, our approximation technique is significant in optimization. We develop a technique to approximate any closed convex set, say K by compactly semidefinite representable set. Further we prove that there exists a sequence of compactly semidefinite representable sets which give tighter approximation of the closed convex set, K gradually. We discuss about the convergence of the sequence of compactly semidefinite representable sets to closed convex set K. The recession cone of K and the recession cone of the compactly semidefinite representable set are equal. So, we say that the sequence of compactly semidefinite representable sets converge strongly to the closed convex set. Thus, this approximation technique is very useful development in semidefinite programming. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=semidefinite%20programming" title="semidefinite programming">semidefinite programming</a>, <a href="https://publications.waset.org/abstracts/search?q=semidefinite%20representable%20set" title=" semidefinite representable set"> semidefinite representable set</a>, <a href="https://publications.waset.org/abstracts/search?q=compactly%20semidefinite%20representable%20set" title=" compactly semidefinite representable set"> compactly semidefinite representable set</a>, <a href="https://publications.waset.org/abstracts/search?q=approximation" title=" approximation"> approximation</a> </p> <a href="https://publications.waset.org/abstracts/36914/approximation-of-convex-set-by-compactly-semidefinite-representable-set" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/36914.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">387</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">2975</span> Generalized Central Paths for Convex Programming</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Li-Zhi%20Liao">Li-Zhi Liao</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The central path has played the key role in the interior point method. However, the convergence of the central path may not be true even in some convex programming problems with linear constraints. In this paper, the generalized central paths are introduced for convex programming. One advantage of the generalized central paths is that the paths will always converge to some optimal solutions of the convex programming problem for any initial interior point. Some additional theoretical properties for the generalized central paths will be also reported. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=central%20path" title="central path">central path</a>, <a href="https://publications.waset.org/abstracts/search?q=convex%20programming" title=" convex programming"> convex programming</a>, <a href="https://publications.waset.org/abstracts/search?q=generalized%20central%20path" title=" generalized central path"> generalized central path</a>, <a href="https://publications.waset.org/abstracts/search?q=interior%20point%20method" title=" interior point method"> interior point method</a> </p> <a href="https://publications.waset.org/abstracts/58039/generalized-central-paths-for-convex-programming" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/58039.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">327</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">2974</span> Sparse-View CT Reconstruction Based on Nonconvex L1 − L2 Regularizations</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Ali%20Pour%20Yazdanpanah">Ali Pour Yazdanpanah</a>, <a href="https://publications.waset.org/abstracts/search?q=Farideh%20Foroozandeh%20Shahraki"> Farideh Foroozandeh Shahraki</a>, <a href="https://publications.waset.org/abstracts/search?q=Emma%20Regentova"> Emma Regentova</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The reconstruction from sparse-view projections is one of important problems in computed tomography (CT) limited by the availability or feasibility of obtaining of a large number of projections. Traditionally, convex regularizers have been exploited to improve the reconstruction quality in sparse-view CT, and the convex constraint in those problems leads to an easy optimization process. However, convex regularizers often result in a biased approximation and inaccurate reconstruction in CT problems. Here, we present a nonconvex, Lipschitz continuous and non-smooth regularization model. The CT reconstruction is formulated as a nonconvex constrained L1 − L2 minimization problem and solved through a difference of convex algorithm and alternating direction of multiplier method which generates a better result than L0 or L1 regularizers in the CT reconstruction. We compare our method with previously reported high performance methods which use convex regularizers such as TV, wavelet, curvelet, and curvelet+TV (CTV) on the test phantom images. The results show that there are benefits in using the nonconvex regularizer in the sparse-view CT reconstruction. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=computed%20tomography" title="computed tomography">computed tomography</a>, <a href="https://publications.waset.org/abstracts/search?q=non-convex" title=" non-convex"> non-convex</a>, <a href="https://publications.waset.org/abstracts/search?q=sparse-view%20reconstruction" title=" sparse-view reconstruction"> sparse-view reconstruction</a>, <a href="https://publications.waset.org/abstracts/search?q=L1-L2%20minimization" title=" L1-L2 minimization"> L1-L2 minimization</a>, <a href="https://publications.waset.org/abstracts/search?q=difference%20of%20convex%20functions" title=" difference of convex functions"> difference of convex functions</a> </p> <a href="https://publications.waset.org/abstracts/70473/sparse-view-ct-reconstruction-based-on-nonconvex-l1-l2-regularizations" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/70473.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">316</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">2973</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">424</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">2972</span> An Improved Lower Bound for Minimal-Area Convex Cover for Closed Unit Curves</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=S.%20Som-Am">S. Som-Am</a>, <a href="https://publications.waset.org/abstracts/search?q=B.%20Grechuk"> B. Grechuk</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Moser’s worm problem is the unsolved problem in geometry which asks for the minimal area of a convex region on the plane which can cover all curves of unit length, assuming that curves may be rotated and translated to fit inside the region. We study a version of this problem asking for a minimal convex cover for closed unit curves. By combining geometric methods with numerical box’s search algorithm, we show that any such cover should have an area at least 0.0975. This improves the best previous lower bound of 0.096694. In fact, we show that the minimal area of convex hull of circle, equilateral triangle, and rectangle of perimeter 1 is between 0.0975 and 0.09763. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=Moser%E2%80%99s%20worm%20problem" title="Moser’s worm problem">Moser’s worm problem</a>, <a href="https://publications.waset.org/abstracts/search?q=closed%20arcs" title=" closed arcs"> closed arcs</a>, <a href="https://publications.waset.org/abstracts/search?q=convex%20cover" title=" convex cover"> convex cover</a>, <a href="https://publications.waset.org/abstracts/search?q=minimal-area%20cover" title=" minimal-area cover"> minimal-area cover</a> </p> <a href="https://publications.waset.org/abstracts/92526/an-improved-lower-bound-for-minimal-area-convex-cover-for-closed-unit-curves" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/92526.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">211</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">2971</span> Neural Network in Fixed Time for Collision Detection between Two Convex Polyhedra</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=M.%20Khouil">M. Khouil</a>, <a href="https://publications.waset.org/abstracts/search?q=N.%20Saber"> N. Saber</a>, <a href="https://publications.waset.org/abstracts/search?q=M.%20Mestari"> M. Mestari</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, a different architecture of a collision detection neural network (DCNN) is developed. This network, which has been particularly reviewed, has enabled us to solve with a new approach the problem of collision detection between two convex polyhedra in a fixed time (O (1) time). We used two types of neurons, linear and threshold logic, which simplified the actual implementation of all the networks proposed. The study of the collision detection is divided into two sections, the collision between a point and a polyhedron and then the collision between two convex polyhedra. The aim of this research is to determine through the AMAXNET network a mini maximum point in a fixed time, which allows us to detect the presence of a potential collision. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=collision%20identification" title="collision identification">collision identification</a>, <a href="https://publications.waset.org/abstracts/search?q=fixed%20time" title=" fixed time"> fixed time</a>, <a href="https://publications.waset.org/abstracts/search?q=convex%20polyhedra" title=" convex polyhedra"> convex polyhedra</a>, <a href="https://publications.waset.org/abstracts/search?q=neural%20network" title=" neural network"> neural network</a>, <a href="https://publications.waset.org/abstracts/search?q=AMAXNET" title=" AMAXNET"> AMAXNET</a> </p> <a href="https://publications.waset.org/abstracts/8931/neural-network-in-fixed-time-for-collision-detection-between-two-convex-polyhedra" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/8931.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">423</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">2970</span> Comparative Analysis of Classical and Parallel Inpainting Algorithms Based on Affine Combinations of Projections on Convex Sets</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Irina%20Maria%20Artinescu">Irina Maria Artinescu</a>, <a href="https://publications.waset.org/abstracts/search?q=Costin%20Radu%20Boldea"> Costin Radu Boldea</a>, <a href="https://publications.waset.org/abstracts/search?q=Eduard-Ionut%20Matei"> Eduard-Ionut Matei</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The paper is a comparative study of two classical variants of parallel projection methods for solving the convex feasibility problem with their equivalents that involve variable weights in the construction of the solutions. We used a graphical representation of these methods for inpainting a convex area of an image in order to investigate their effectiveness in image reconstruction applications. We also presented a numerical analysis of the convergence of these four algorithms in terms of the average number of steps and execution time in classical CPU and, alternatively, in parallel GPU implementation. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=convex%20feasibility%20problem" title="convex feasibility problem">convex feasibility problem</a>, <a href="https://publications.waset.org/abstracts/search?q=convergence%20analysis" title=" convergence analysis"> convergence analysis</a>, <a href="https://publications.waset.org/abstracts/search?q=inpainting" title=" inpainting"> inpainting</a>, <a href="https://publications.waset.org/abstracts/search?q=parallel%20projection%20methods" title=" parallel projection methods"> parallel projection methods</a> </p> <a href="https://publications.waset.org/abstracts/133736/comparative-analysis-of-classical-and-parallel-inpainting-algorithms-based-on-affine-combinations-of-projections-on-convex-sets" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/133736.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">2969</span> The Fallacy around Inserting Brackets to Evaluate Expressions Involving Multiplication and Division</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Manduth%20Ramchander">Manduth Ramchander</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Evaluating expressions involving multiplication and division can give rise to the fallacy that brackets can be arbitrarily inserted into expressions involving multiplication and division. The aim of this article was to draw upon mathematical theory to prove that brackets cannot be arbitrarily inserted into expressions involving multiplication and division and in particular in expressions where division precedes multiplication. In doing so, it demonstrates that the notion that two different answers are possible, when evaluating expressions involving multiplication and division, is indeed a false one. Searches conducted in a number of scholarly databases unearthed the rules to be applied when removing brackets from expressions, which revealed that consideration needs to be given to sign changes when brackets are removed. The rule pertaining to expressions involving multiplication and division was then extended upon, in its reverse format, to prove that brackets cannot be arbitrarily inserted into expressions involving multiplication and division. The application of the rule demonstrates that an expression involving multiplication and division can have only one correct answer. It is recommended that both the rule and its reverse be included in the curriculum, preferably at the juncture when manipulation with brackets is introduced. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=brackets" title="brackets">brackets</a>, <a href="https://publications.waset.org/abstracts/search?q=multiplications%20and%20division" title=" multiplications and division"> multiplications and division</a>, <a href="https://publications.waset.org/abstracts/search?q=operations" title=" operations"> operations</a>, <a href="https://publications.waset.org/abstracts/search?q=order" title=" order"> order</a> </p> <a href="https://publications.waset.org/abstracts/132918/the-fallacy-around-inserting-brackets-to-evaluate-expressions-involving-multiplication-and-division" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/132918.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">160</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">2968</span> Modeling Approach to Better Control Fouling in a Submerged Membrane Bioreactor for Wastewater Treatment: Development of Analytical Expressions in Steady-State Using ASM1</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Benaliouche%20Hana">Benaliouche Hana</a>, <a href="https://publications.waset.org/abstracts/search?q=Abdessemed%20Djamal"> Abdessemed Djamal</a>, <a href="https://publications.waset.org/abstracts/search?q=Meniai%20Abdessalem"> Meniai Abdessalem</a>, <a href="https://publications.waset.org/abstracts/search?q=Lesage%20Geoffroy"> Lesage Geoffroy</a>, <a href="https://publications.waset.org/abstracts/search?q=Heran%20Marc"> Heran Marc</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper presents a dynamic mathematical model of activated sludge which is able to predict the formation and degradation kinetics of SMP (Soluble microbial products) in membrane bioreactor systems. The model is based on a calibrated version of ASM1 with the theory of production and degradation of SMP. The model was calibrated on the experimental data from MBR (Mathematical modeling Membrane bioreactor) pilot plant. Analytical expressions have been developed, describing the concentrations of the main state variables present in the sludge matrix, with the inclusion of only six additional linear differential equations. The objective is to present a new dynamic mathematical model of activated sludge capable of predicting the formation and degradation kinetics of SMP (UAP and BAP) from the submerged membrane bioreactor (BRMI), operating at low organic load (C / N = 3.5), for two sludge retention times (SRT) fixed at 40 days and 60 days, to study their impact on membrane fouling, The modeling study was carried out under the steady-state condition. Analytical expressions were then validated by comparing their results with those obtained by simulations using GPS-X-Hydromantis software. These equations made it possible, by means of modeling approaches (ASM1), to identify the operating and kinetic parameters and help to predict membrane fouling. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=Activated%20Sludge%20Model%20No.%201%20%28ASM1%29" title="Activated Sludge Model No. 1 (ASM1)">Activated Sludge Model No. 1 (ASM1)</a>, <a href="https://publications.waset.org/abstracts/search?q=mathematical%20modeling%20membrane%20bioreactor" title=" mathematical modeling membrane bioreactor"> mathematical modeling membrane bioreactor</a>, <a href="https://publications.waset.org/abstracts/search?q=soluble%20microbial%20products" title=" soluble microbial products"> soluble microbial products</a>, <a href="https://publications.waset.org/abstracts/search?q=UAP" title=" UAP"> UAP</a>, <a href="https://publications.waset.org/abstracts/search?q=BAP" title=" BAP"> BAP</a>, <a href="https://publications.waset.org/abstracts/search?q=Modeling%20SMP" title=" Modeling SMP"> Modeling SMP</a>, <a href="https://publications.waset.org/abstracts/search?q=MBR" title=" MBR"> MBR</a>, <a href="https://publications.waset.org/abstracts/search?q=heterotrophic%20biomass" title=" heterotrophic biomass"> heterotrophic biomass</a> </p> <a href="https://publications.waset.org/abstracts/139601/modeling-approach-to-better-control-fouling-in-a-submerged-membrane-bioreactor-for-wastewater-treatment-development-of-analytical-expressions-in-steady-state-using-asm1" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/139601.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">297</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">2967</span> Quantum Statistical Mechanical Formulations of Three-Body Problems via Non-Local Potentials</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=A.%20Maghari">A. Maghari</a>, <a href="https://publications.waset.org/abstracts/search?q=V.%20M.%20Maleki"> V. M. Maleki</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, we present a quantum statistical mechanical formulation from our recently analytical expressions for partial-wave transition matrix of a three-particle system. We report the quantum reactive cross sections for three-body scattering processes 1 + (2,3)-> 1 + (2,3) as well as recombination 1 + (2,3) -> 2 + (3,1) between one atom and a weakly-bound dimer. The analytical expressions of three-particle transition matrices and their corresponding cross-sections were obtained from the three-dimensional Faddeev equations subjected to the rank-two non-local separable potentials of the generalized Yamaguchi form. The equilibrium quantum statistical mechanical properties such partition function and equation of state as well as non-equilibrium quantum statistical properties such as transport cross-sections and their corresponding transport collision integrals were formulated analytically. This leads to obtain the transport properties, such as viscosity and diffusion coefficient of a moderate dense gas. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=statistical%20mechanics" title="statistical mechanics">statistical mechanics</a>, <a href="https://publications.waset.org/abstracts/search?q=nonlocal%20separable%20potential" title=" nonlocal separable potential"> nonlocal separable potential</a>, <a href="https://publications.waset.org/abstracts/search?q=three-body%20interaction" title=" three-body interaction"> three-body interaction</a>, <a href="https://publications.waset.org/abstracts/search?q=faddeev%20equations" title=" faddeev equations"> faddeev equations</a> </p> <a href="https://publications.waset.org/abstracts/35738/quantum-statistical-mechanical-formulations-of-three-body-problems-via-non-local-potentials" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/35738.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">401</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">2966</span> Solving Linear Systems Involved in Convex Programming Problems</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Yixun%20Shi">Yixun Shi</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Many interior point methods for convex programming solve an (n+m)x(n+m)linear system in each iteration. Many implementations solve this system in each iteration by considering an equivalent mXm system (4) as listed in the paper, and thus the job is reduced into solving the system (4). However, the system(4) has to be solved exactly since otherwise the error would be entirely passed onto the last m equations of the original system. Often the Cholesky factorization is computed to obtain the exact solution of (4). One Cholesky factorization is to be done in every iteration, resulting in higher computational costs. In this paper, two iterative methods for solving linear systems using vector division are combined together and embedded into interior point methods. Instead of computing one Cholesky factorization in each iteration, it requires only one Cholesky factorization in the entire procedure, thus significantly reduces the amount of computation needed for solving the problem. Based on that, a hybrid algorithm for solving convex programming problems is proposed. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=convex%20programming" title="convex programming">convex programming</a>, <a href="https://publications.waset.org/abstracts/search?q=interior%20point%20method" title=" interior point method"> interior point method</a>, <a href="https://publications.waset.org/abstracts/search?q=linear%20systems" title=" linear systems"> linear systems</a>, <a href="https://publications.waset.org/abstracts/search?q=vector%20division" title=" vector division"> vector division</a> </p> <a href="https://publications.waset.org/abstracts/39573/solving-linear-systems-involved-in-convex-programming-problems" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/39573.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">402</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">2965</span> Impulsive Synchronization of Periodically Forced Complex Duffing's Oscillators</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Shaban%20Aly">Shaban Aly</a>, <a href="https://publications.waset.org/abstracts/search?q=Ali%20Al-Qahtani"> Ali Al-Qahtani</a>, <a href="https://publications.waset.org/abstracts/search?q=Houari%20B.%20Khenous"> Houari B. Khenous</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Synchronization is an important phenomenon commonly observed in nature. A system of periodically forced complex Duffings oscillators was introduced and shown to display chaotic behavior and possess strange attractors. Such complex oscillators appear in many problems of physics and engineering, as, for example, nonlinear optics, deep-water wave theory, plasma physics and bimolecular dynamics. In this paper, we study the remarkable phenomenon of chaotic synchronization on these oscillator systems, using impulsive synchronization techniques. We derive analytical expressions for impulsive control functions and show that the dynamics of error evolution is globally stable, by constructing appropriate Lyapunov functions. This means that, for a relatively large set initial conditions, the differences between the drive and response systems vanish exponentially and synchronization is achieved. Numerical results are obtained to test the validity of the analytical expressions and illustrate the efficiency of these techniques for inducing chaos synchronization in our nonlinear oscillators. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=complex%20nonlinear%20oscillators" title="complex nonlinear oscillators">complex nonlinear oscillators</a>, <a href="https://publications.waset.org/abstracts/search?q=impulsive%20synchronization" title=" impulsive synchronization"> impulsive synchronization</a>, <a href="https://publications.waset.org/abstracts/search?q=chaotic%20systems" title=" chaotic systems"> chaotic systems</a>, <a href="https://publications.waset.org/abstracts/search?q=global%20exponential%20synchronization" title=" global exponential synchronization"> global exponential synchronization</a> </p> <a href="https://publications.waset.org/abstracts/41212/impulsive-synchronization-of-periodically-forced-complex-duffings-oscillators" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/41212.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">447</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">2964</span> Performance Analysis of the Time-Based and Periodogram-Based Energy Detector for Spectrum Sensing</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Sadaf%20Nawaz">Sadaf Nawaz</a>, <a href="https://publications.waset.org/abstracts/search?q=Adnan%20Ahmed%20Khan"> Adnan Ahmed Khan</a>, <a href="https://publications.waset.org/abstracts/search?q=Asad%20Mahmood"> Asad Mahmood</a>, <a href="https://publications.waset.org/abstracts/search?q=Chaudhary%20Farrukh%20Javed"> Chaudhary Farrukh Javed </a> </p> <p class="card-text"><strong>Abstract:</strong></p> Classically, an energy detector is implemented in time domain (TD). However, frequency domain (FD) based energy detector has demonstrated an improved performance. This paper presents a comparison between the two approaches as to analyze their pros and cons. A detailed performance analysis of the classical TD energy-detector and the periodogram based detector is performed. Exact and approximate mathematical expressions for probability of false alarm (Pf) and probability of detection (Pd) are derived for both approaches. The derived expressions naturally lead to an analytical as well as intuitive reasoning for the improved performance of (Pf) and (Pd) in different scenarios. Our analysis suggests the dependence improvement on buffer sizes. Pf is improved in FD, whereas Pd is enhanced in TD based energy detectors. Finally, Monte Carlo simulations results demonstrate the analysis reached by the derived expressions. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=cognitive%20radio" title="cognitive radio">cognitive radio</a>, <a href="https://publications.waset.org/abstracts/search?q=energy%20detector" title=" energy detector"> energy detector</a>, <a href="https://publications.waset.org/abstracts/search?q=periodogram" title=" periodogram"> periodogram</a>, <a href="https://publications.waset.org/abstracts/search?q=spectrum%20sensing" title=" spectrum sensing"> spectrum sensing</a> </p> <a href="https://publications.waset.org/abstracts/63028/performance-analysis-of-the-time-based-and-periodogram-based-energy-detector-for-spectrum-sensing" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/63028.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">378</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">2963</span> Q-Efficient Solutions of Vector Optimization via Algebraic Concepts</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Elham%20Kiyani">Elham Kiyani</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, we first introduce the concept of Q-efficient solutions in a real linear space not necessarily endowed with a topology, where Q is some nonempty (not necessarily convex) set. We also used the scalarization technique including the Gerstewitz function generated by a nonconvex set to characterize these Q-efficient solutions. The algebraic concepts of interior and closure are useful to study optimization problems without topology. Studying nonconvex vector optimization is valuable since topological interior is equal to algebraic interior for a convex cone. So, we use the algebraic concepts of interior and closure to define Q-weak efficient solutions and Q-Henig proper efficient solutions of set-valued optimization problems, where Q is not a convex cone. Optimization problems with set-valued maps have a wide range of applications, so it is expected that there will be a useful analytical tool in optimization theory for set-valued maps. These kind of optimization problems are closely related to stochastic programming, control theory, and economic theory. The paper focus on nonconvex problems, the results are obtained by assuming generalized non-convexity assumptions on the data of the problem. In convex problems, main mathematical tools are convex separation theorems, alternative theorems, and algebraic counterparts of some usual topological concepts, while in nonconvex problems, we need a nonconvex separation function. Thus, we consider the Gerstewitz function generated by a general set in a real linear space and re-examine its properties in the more general setting. A useful approach for solving a vector problem is to reduce it to a scalar problem. In general, scalarization means the replacement of a vector optimization problem by a suitable scalar problem which tends to be an optimization problem with a real valued objective function. The Gerstewitz function is well known and widely used in optimization as the basis of the scalarization. The essential properties of the Gerstewitz function, which are well known in the topological framework, are studied by using algebraic counterparts rather than the topological concepts of interior and closure. Therefore, properties of the Gerstewitz function, when it takes values just in a real linear space are studied, and we use it to characterize Q-efficient solutions of vector problems whose image space is not endowed with any particular topology. Therefore, we deal with a constrained vector optimization problem in a real linear space without assuming any topology, and also Q-weak efficient and Q-proper efficient solutions in the senses of Henig are defined. Moreover, by means of the Gerstewitz function, we provide some necessary and sufficient optimality conditions for set-valued vector optimization problems. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=algebraic%20interior" title="algebraic interior">algebraic interior</a>, <a href="https://publications.waset.org/abstracts/search?q=Gerstewitz%20function" title=" Gerstewitz function"> Gerstewitz function</a>, <a href="https://publications.waset.org/abstracts/search?q=vector%20closure" title=" vector closure"> vector closure</a>, <a href="https://publications.waset.org/abstracts/search?q=vector%20optimization" title=" vector optimization"> vector optimization</a> </p> <a href="https://publications.waset.org/abstracts/94011/q-efficient-solutions-of-vector-optimization-via-algebraic-concepts" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/94011.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">2962</span> Convex Restrictions for Outage Constrained MU-MISO Downlink under Imperfect Channel State Information</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=A.%20Preetha%20Priyadharshini">A. Preetha Priyadharshini</a>, <a href="https://publications.waset.org/abstracts/search?q=S.%20B.%20M.%20Priya"> S. B. M. Priya</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, we consider the MU-MISO downlink scenario, under imperfect channel state information (CSI). The main issue in imperfect CSI is to keep the probability of each user achievable outage rate below the given threshold level. Such a rate outage constraints present significant and analytical challenges. There are many probabilistic methods are used to minimize the transmit optimization problem under imperfect CSI. Here, decomposition based large deviation inequality and Bernstein type inequality convex restriction methods are used to perform the optimization problem under imperfect CSI. These methods are used for achieving improved output quality and lower complexity. They provide a safe tractable approximation of the original rate outage constraints. Based on these method implementations, performance has been evaluated in the terms of feasible rate and average transmission power. The simulation results are shown that all the two methods offer significantly improved outage quality and lower computational complexity. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=imperfect%20channel%20state%20information" title="imperfect channel state information">imperfect channel state information</a>, <a href="https://publications.waset.org/abstracts/search?q=outage%20probability" title=" outage probability"> outage probability</a>, <a href="https://publications.waset.org/abstracts/search?q=multiuser-%20multi%20input%20single%20output" title=" multiuser- multi input single output"> multiuser- multi input single output</a>, <a href="https://publications.waset.org/abstracts/search?q=channel%20state%20information" title=" channel state information"> channel state information</a> </p> <a href="https://publications.waset.org/abstracts/48521/convex-restrictions-for-outage-constrained-mu-miso-downlink-under-imperfect-channel-state-information" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/48521.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">814</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">2961</span> Polarization Dependent Flexible GaN Film Nanogenerators and Electroluminescence Properties</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Jeong%20Min%20Baik">Jeong Min Baik</a> </p> <p class="card-text"><strong>Abstract:</strong></p> We present that the electroluminescence (EL) properties and electrical output power of flexible N-face p-type GaN thin films can be tuned by strain-induced piezo-potential generated across the metal-semiconductor-metal structures. Under different staining conditions (convex and concave bending modes), the transport properties of the GaN films can be changed due to the spontaneous polarization of the films. The I-V characteristics with the bending modes show that the convex bending can increase the current across the films by the decrease in the barrier height at the metal-semiconductor contact, increasing the EL intensity of the P-N junction. At convex bending, it is also shown that the flexible p-type GaN films can generate an output voltage of up to 1.0 V, while at concave bending, 0.4 V. The change of the band bending with the crystal polarity of GaN films was investigated using high-resolution photoemission spectroscopy. This study has great significance on the practical applications of GaN in optoelectronic devices and nanogenerators under a working environment. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=GaN" title="GaN">GaN</a>, <a href="https://publications.waset.org/abstracts/search?q=flexible" title=" flexible"> flexible</a>, <a href="https://publications.waset.org/abstracts/search?q=laser%20lift-off" title=" laser lift-off"> laser lift-off</a>, <a href="https://publications.waset.org/abstracts/search?q=nanogenerator" title=" nanogenerator"> nanogenerator</a> </p> <a href="https://publications.waset.org/abstracts/13583/polarization-dependent-flexible-gan-film-nanogenerators-and-electroluminescence-properties" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/13583.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">419</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">2960</span> Estimating View-Through Ad Attribution from User Surveys Using Convex Optimization</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Yuhan%20Lin">Yuhan Lin</a>, <a href="https://publications.waset.org/abstracts/search?q=Rohan%20Kekatpure"> Rohan Kekatpure</a>, <a href="https://publications.waset.org/abstracts/search?q=Cassidy%20Yeung"> Cassidy Yeung</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In Digital Marketing, robust quantification of View-through attribution (VTA) is necessary for evaluating channel effectiveness. VTA occurs when a product purchase is aided by an Ad but without an explicit click (e.g. a TV ad). A lack of a tracking mechanism makes VTA estimation challenging. Most prevalent VTA estimation techniques rely on post-purchase in-product user surveys. User surveys enable the calculation of channel multipliers, which are the ratio of the view-attributed to the click-attributed purchases of each marketing channel. Channel multipliers thus provide a way to estimate the unknown VTA for a channel from its known click attribution. In this work, we use Convex Optimization to compute channel multipliers in a way that enables a mathematical encoding of the expected channel behavior. Large fluctuations in channel attributions often result from overfitting the calculations to user surveys. Casting channel attribution as a Convex Optimization problem allows an introduction of constraints that limit such fluctuations. The result of our study is a distribution of channel multipliers across the entire marketing funnel, with important implications for marketing spend optimization. Our technique can be broadly applied to estimate Ad effectiveness in a privacy-centric world that increasingly limits user tracking. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=digital%20marketing" title="digital marketing">digital marketing</a>, <a href="https://publications.waset.org/abstracts/search?q=survey%20analysis" title=" survey analysis"> survey analysis</a>, <a href="https://publications.waset.org/abstracts/search?q=operational%20research" title=" operational research"> operational research</a>, <a href="https://publications.waset.org/abstracts/search?q=convex%20optimization" title=" convex optimization"> convex optimization</a>, <a href="https://publications.waset.org/abstracts/search?q=channel%20attribution" title=" channel attribution"> channel attribution</a> </p> <a href="https://publications.waset.org/abstracts/149140/estimating-view-through-ad-attribution-from-user-surveys-using-convex-optimization" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/149140.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">199</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">2959</span> KSVD-SVM Approach for Spontaneous Facial Expression Recognition</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Dawood%20Al%20Chanti">Dawood Al Chanti</a>, <a href="https://publications.waset.org/abstracts/search?q=Alice%20Caplier"> Alice Caplier</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Sparse representations of signals have received a great deal of attention in recent years. In this paper, the interest of using sparse representation as a mean for performing sparse discriminative analysis between spontaneous facial expressions is demonstrated. An automatic facial expressions recognition system is presented. It uses a KSVD-SVM approach which is made of three main stages: A pre-processing and feature extraction stage, which solves the problem of shared subspace distribution based on the random projection theory, to obtain low dimensional discriminative and reconstructive features; A dictionary learning and sparse coding stage, which uses the KSVD model to learn discriminative under or over dictionaries for sparse coding; Finally a classification stage, which uses a SVM classifier for facial expressions recognition. Our main concern is to be able to recognize non-basic affective states and non-acted expressions. Extensive experiments on the JAFFE static acted facial expressions database but also on the DynEmo dynamic spontaneous facial expressions database exhibit very good recognition rates. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=dictionary%20learning" title="dictionary learning">dictionary learning</a>, <a href="https://publications.waset.org/abstracts/search?q=random%20projection" title=" random projection"> random projection</a>, <a href="https://publications.waset.org/abstracts/search?q=pose%20and%20spontaneous%20facial%20expression" title=" pose and spontaneous facial expression"> pose and spontaneous facial expression</a>, <a href="https://publications.waset.org/abstracts/search?q=sparse%20representation" title=" sparse representation"> sparse representation</a> </p> <a href="https://publications.waset.org/abstracts/51683/ksvd-svm-approach-for-spontaneous-facial-expression-recognition" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/51683.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">305</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">2958</span> Effect of the Levitation Screen Sizes on Magnetic Parameters of Tracking System</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Y.%20R.%20Adullayev">Y. R. Adullayev</a>, <a href="https://publications.waset.org/abstracts/search?q=%D0%9E.%20%D0%9E.%20Karimzada"> О. О. Karimzada</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Analytical expressions for inductances, current, ampere-turns, excitation winding, maximum width, coordinates of the levitation screen (LS) are derived for the calculation of electromagnetic devices based on tracking systems with levitation elements (TS with LS). Taking into account the expression of the complex magnetic resistance of the screen, the dependence of the screen width on the heating temperature of the physical and technical characteristics of the screen material and the relationship of the geometric dimensions of the magnetic circuit is established. Analytic expressions for a number of functional dependencies characterizing complex parameter relationships in explicit form are obtained and analyzed. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=tracking%20systems" title="tracking systems">tracking systems</a>, <a href="https://publications.waset.org/abstracts/search?q=levitation%20screens" title=" levitation screens"> levitation screens</a>, <a href="https://publications.waset.org/abstracts/search?q=electromagnetic%20levitation" title=" electromagnetic levitation"> electromagnetic levitation</a>, <a href="https://publications.waset.org/abstracts/search?q=excitation%20windings" title=" excitation windings"> excitation windings</a>, <a href="https://publications.waset.org/abstracts/search?q=magnetic%20cores" title=" magnetic cores"> magnetic cores</a>, <a href="https://publications.waset.org/abstracts/search?q=defining%20converter" title=" defining converter"> defining converter</a>, <a href="https://publications.waset.org/abstracts/search?q=receiving%20converter" title=" receiving converter"> receiving converter</a>, <a href="https://publications.waset.org/abstracts/search?q=electromagnetic%20force" title=" electromagnetic force"> electromagnetic force</a>, <a href="https://publications.waset.org/abstracts/search?q=electrical%20and%20magnetic%20resistance" title=" electrical and magnetic resistance"> electrical and magnetic resistance</a> </p> <a href="https://publications.waset.org/abstracts/89223/effect-of-the-levitation-screen-sizes-on-magnetic-parameters-of-tracking-system" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/89223.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">231</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">2957</span> The Algorithm to Solve the Extend General Malfatti’s Problem in a Convex Circular Triangle</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Ching-Shoei%20Chiang">Ching-Shoei Chiang</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The Malfatti’s Problem solves the problem of fitting 3 circles into a right triangle such that these 3 circles are tangent to each other, and each circle is also tangent to a pair of the triangle’s sides. This problem has been extended to any triangle (called general Malfatti’s Problem). Furthermore, the problem has been extended to have 1+2+…+n circles inside the triangle with special tangency properties among circles and triangle sides; we call it extended general Malfatti’s problem. In the extended general Malfatti’s problem, call it Tri(Tn), where Tn is the triangle number, there are closed-form solutions for Tri(T₁) (inscribed circle) problem and Tri(T₂) (3 Malfatti’s circles) problem. These problems become more complex when n is greater than 2. In solving Tri(Tn) problem, n>2, algorithms have been proposed to solve these problems numerically. With a similar idea, this paper proposed an algorithm to find the radii of circles with the same tangency properties. Instead of the boundary of the triangle being a straight line, we use a convex circular arc as the boundary and try to find Tn circles inside this convex circular triangle with the same tangency properties among circles and boundary Carc. We call these problems the Carc(Tn) problems. The CPU time it takes for Carc(T16) problem, which finds 136 circles inside a convex circular triangle with specified tangency properties, is less than one second. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=circle%20packing" title="circle packing">circle packing</a>, <a href="https://publications.waset.org/abstracts/search?q=computer-aided%20geometric%20design" title=" computer-aided geometric design"> computer-aided geometric design</a>, <a href="https://publications.waset.org/abstracts/search?q=geometric%20constraint%20solver" title=" geometric constraint solver"> geometric constraint solver</a>, <a href="https://publications.waset.org/abstracts/search?q=Malfatti%E2%80%99s%20problem" title=" Malfatti’s problem"> Malfatti’s problem</a> </p> <a href="https://publications.waset.org/abstracts/165851/the-algorithm-to-solve-the-extend-general-malfattis-problem-in-a-convex-circular-triangle" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/165851.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">110</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">2956</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">104</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">2955</span> Types of Taboo Expressions in Igbo Society</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Christian%20Nwaoha">Christian Nwaoha</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This study investigates taboo expressions and classifications in Igbo discourse, their socio-cultural factors affecting their usage. The study classifies Linguistic taboo expressions by their discourse into five categories: morality-related taboo, veneration-related, decorum-related, religion-related and fear-related taboo expressions. This study argues that while religion-related and decorum-related taboos are unmentioned and have no euphemistic synonyms is because they are closely tied to various Igbo deities and objects, while morality, veneration, and fear-related have permissible alternatives. A descriptive research design was adopted and the data collection was by questionnaire and oral interview. The result of the research proves that aside of the categories of taboos in Igbo, socially, the styles of discourse have some levels of gender, age and class-connected taboos, which for instance, in gender-connected taboos, women in Igbo are forbidden to use style of discourse that are connected with genital organs in social gathering comprising men and women. The same has to do with class-connected where much younger men can use some certain expressions that are taboo, but in much older men gathering such expressions would be tagged forbidden in the context. The study further reveals that there are occasions in which these taboos can be used with reasons. The research concludes that using these taboos in literary text can enhance clear understanding of Igbo taboos to the users and learners of Igbo language. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=taboo%20expressions" title="taboo expressions">taboo expressions</a>, <a href="https://publications.waset.org/abstracts/search?q=classifications" title=" classifications"> classifications</a>, <a href="https://publications.waset.org/abstracts/search?q=Igbo" title=" Igbo"> Igbo</a>, <a href="https://publications.waset.org/abstracts/search?q=socio-cultural%20factors" title=" socio-cultural factors"> socio-cultural factors</a>, <a href="https://publications.waset.org/abstracts/search?q=discourse" title=" discourse"> discourse</a> </p> <a href="https://publications.waset.org/abstracts/83347/types-of-taboo-expressions-in-igbo-society" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/83347.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">231</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">2954</span> Optrix: Energy Aware Cross Layer Routing Using Convex Optimization in Wireless Sensor Networks</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Ali%20Shareef">Ali Shareef</a>, <a href="https://publications.waset.org/abstracts/search?q=Aliha%20Shareef"> Aliha Shareef</a>, <a href="https://publications.waset.org/abstracts/search?q=Yifeng%20Zhu"> Yifeng Zhu</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Energy minimization is of great importance in wireless sensor networks in extending the battery lifetime. One of the key activities of nodes in a WSN is communication and the routing of their data to a centralized base-station or sink. Routing using the shortest path to the sink is not the best solution since it will cause nodes along this path to fail prematurely. We propose a cross-layer energy efficient routing protocol Optrix that utilizes a convex formulation to maximize the lifetime of the network as a whole. We further propose, Optrix-BW, a novel convex formulation with bandwidth constraint that allows the channel conditions to be accounted for in routing. By considering this key channel parameter we demonstrate that Optrix-BW is capable of congestion control. Optrix is implemented in TinyOS, and we demonstrate that a relatively large topology of 40 nodes can converge to within 91% of the optimal routing solution. We describe the pitfalls and issues related with utilizing a continuous form technique such as convex optimization with discrete packet based communication systems as found in WSNs. We propose a routing controller mechanism that allows for this transformation. We compare Optrix against the Collection Tree Protocol (CTP) and we found that Optrix performs better in terms of convergence to an optimal routing solution, for load balancing and network lifetime maximization than CTP. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=wireless%20sensor%20network" title="wireless sensor network">wireless sensor network</a>, <a href="https://publications.waset.org/abstracts/search?q=Energy%20Efficient%20Routing" title=" Energy Efficient Routing"> Energy Efficient Routing</a> </p> <a href="https://publications.waset.org/abstracts/17333/optrix-energy-aware-cross-layer-routing-using-convex-optimization-in-wireless-sensor-networks" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/17333.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">391</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">2953</span> On the Solidness of the Polar of Recession Cones</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Sima%20Hassankhali">Sima Hassankhali</a>, <a href="https://publications.waset.org/abstracts/search?q=Ildar%20Sadeqi"> Ildar Sadeqi</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In the theory of Pareto efficient points, the existence of a bounded base for a cone K of a normed space X is so important. In this article, we study the geometric structure of a nonzero closed convex cone K with a bounded base. For this aim, we study the structure of the polar cone K# of K. Furthermore, we obtain a necessary and sufficient condition for a nonempty closed convex set C so that its recession cone C∞ has a bounded base. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=solid%20cones" title="solid cones">solid cones</a>, <a href="https://publications.waset.org/abstracts/search?q=recession%20cones" title=" recession cones"> recession cones</a>, <a href="https://publications.waset.org/abstracts/search?q=polar%20cones" title=" polar cones"> polar cones</a>, <a href="https://publications.waset.org/abstracts/search?q=bounded%20base" title=" bounded base"> bounded base</a> </p> <a href="https://publications.waset.org/abstracts/57802/on-the-solidness-of-the-polar-of-recession-cones" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/57802.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">267</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">2952</span> Practical Methods for Automatic MC/DC Test Cases Generation of Boolean Expressions</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Sekou%20Kangoye">Sekou Kangoye</a>, <a href="https://publications.waset.org/abstracts/search?q=Alexis%20Todoskoff"> Alexis Todoskoff</a>, <a href="https://publications.waset.org/abstracts/search?q=Mihaela%20Barreau"> Mihaela Barreau</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Modified Condition/Decision Coverage (MC/DC) is a structural coverage criterion that aims to prove that all conditions involved in a Boolean expression can influence the result of that expression. In the context of automotive, MC/DC is highly recommended and even required for most security and safety applications testing. However, due to complex Boolean expressions that often embedded in those applications, generating a set of MC/DC compliant test cases for any of these expressions is a nontrivial task and can be time consuming for testers. In this paper we present an approach to automatically generate MC/DC test cases for any Boolean expression. We introduce novel techniques, essentially based on binary trees to quickly and optimally generate MC/DC test cases for the expressions. Thus, the approach can be used to reduce the manual testing effort of testers. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=binary%20trees" title="binary trees">binary trees</a>, <a href="https://publications.waset.org/abstracts/search?q=MC%2FDC" title=" MC/DC"> MC/DC</a>, <a href="https://publications.waset.org/abstracts/search?q=test%20case%20generation" title=" test case generation"> test case generation</a>, <a href="https://publications.waset.org/abstracts/search?q=nontrivial%20task" title=" nontrivial task"> nontrivial task</a> </p> <a href="https://publications.waset.org/abstracts/29442/practical-methods-for-automatic-mcdc-test-cases-generation-of-boolean-expressions" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/29442.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">447</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">2951</span> Measuring Development through Extreme Observations: An Archetypal Analysis Approach to Index Construction</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Claudeline%20D.%20Cellan">Claudeline D. Cellan</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Development is multifaceted, and efforts to hasten growth in all these facets have been gaining traction in recent years. Thus, producing a composite index that is reflective of these multidimensional impacts captures the interests of policymakers. The problem lies in going through a mixture of theoretical, methodological and empirical decisions and complexities which, when done carelessly, can lead to inconsistent and unreliable results. This study looks into index computation from a different and less complex perspective. Borrowing the idea of archetypes or ‘pure types’, archetypal analysis looks for points in the convex hull of the multivariate data set that captures as much information in the data as possible. The archetypes or 'pure types' are estimated such that they are convex combinations of all the observations, which in turn are convex combinations of the archetypes. This ensures that the archetypes are realistically observable, therefore achievable. In the sense of composite indices, we look for the best among these archetypes and use this as a benchmark for index computation. Its straightforward and simplistic approach does away with aggregation and substitutability problems which are commonly encountered in index computation. As an example of the application of archetypal analysis in index construction, the country data for the Human Development Index (HDI 2017) of the United Nations Development Programme (UNDP) is used. The goal of this exercise is not to replicate the result of the UNDP-computed HDI, but to illustrate the usability of archetypal analysis in index construction. Here best is defined in the context of life, education and gross national income sub-indices. Results show that the HDI from the archetypal analysis has a linear relationship with the UNDP-computed HDI. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=archetypes" title="archetypes">archetypes</a>, <a href="https://publications.waset.org/abstracts/search?q=composite%20index" title=" composite index"> composite index</a>, <a href="https://publications.waset.org/abstracts/search?q=convex%20combination" title=" convex combination"> convex combination</a>, <a href="https://publications.waset.org/abstracts/search?q=development" title=" development"> development</a> </p> <a href="https://publications.waset.org/abstracts/107237/measuring-development-through-extreme-observations-an-archetypal-analysis-approach-to-index-construction" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/107237.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> <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=analytical%20convex%20expressions&page=2">2</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=analytical%20convex%20expressions&page=3">3</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=analytical%20convex%20expressions&page=4">4</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=analytical%20convex%20expressions&page=5">5</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=analytical%20convex%20expressions&page=6">6</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=analytical%20convex%20expressions&page=7">7</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=analytical%20convex%20expressions&page=8">8</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=analytical%20convex%20expressions&page=9">9</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=analytical%20convex%20expressions&page=10">10</a></li> <li class="page-item disabled"><span class="page-link">...</span></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=analytical%20convex%20expressions&page=99">99</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=analytical%20convex%20expressions&page=100">100</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=analytical%20convex%20expressions&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>