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: binary relevance</title> <meta name="description" content="Search results for: binary relevance"> <meta name="keywords" content="binary relevance"> <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="binary relevance" 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="binary relevance"> <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> 1643</div> </div> </div> </div> <h1 class="mt-3 mb-3 text-center" style="font-size:1.6rem;">Search results for: binary relevance</h1> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1643</span> Performance Comparison of Non-Binary RA and QC-LDPC Codes</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Ni%20Wenli">Ni Wenli</a>, <a href="https://publications.waset.org/abstracts/search?q=He%20Jing"> He Jing</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Repeat–Accumulate (RA) codes are subclass of LDPC codes with fast encoder structures. In this paper, we consider a nonbinary extension of binary LDPC codes over GF(q) and construct a non-binary RA code and a non-binary QC-LDPC code over GF(2^4), we construct non-binary RA codes with linear encoding method and non-binary QC-LDPC codes with algebraic constructions method. And the BER performance of RA and QC-LDPC codes over GF(q) are compared with BP decoding and by simulation over the Additive White Gaussian Noise (AWGN) channels. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=non-binary%20RA%20codes" title="non-binary RA codes">non-binary RA codes</a>, <a href="https://publications.waset.org/abstracts/search?q=QC-LDPC%20codes" title=" QC-LDPC codes"> QC-LDPC codes</a>, <a href="https://publications.waset.org/abstracts/search?q=performance%20comparison" title=" performance comparison"> performance comparison</a>, <a href="https://publications.waset.org/abstracts/search?q=BP%20algorithm" title=" BP algorithm"> BP algorithm</a> </p> <a href="https://publications.waset.org/abstracts/42170/performance-comparison-of-non-binary-ra-and-qc-ldpc-codes" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/42170.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">376</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">1642</span> Teaching the Binary System via Beautiful Facts from the Real Life</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Salem%20Ben%20Said">Salem Ben Said</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In recent times the decimal number system to which we are accustomed has received serious competition from the binary number system. In this note, an approach is suggested to teaching and learning the binary number system using examples from the real world. More precisely, we will demonstrate the utility of the binary system in describing the optimal strategy to win the Chinese Nim game, and in telegraphy by decoding the hidden message on Perseverance’s Mars parachute written in the language of binary system. Finally, we will answer the question, “why do modern computers prefer the ternary number system instead of the binary system?”. All materials are provided in a format that is conductive to classroom presentation and discussion. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=binary%20number%20system" title="binary number system">binary number system</a>, <a href="https://publications.waset.org/abstracts/search?q=Nim%20game" title=" Nim game"> Nim game</a>, <a href="https://publications.waset.org/abstracts/search?q=telegraphy" title=" telegraphy"> telegraphy</a>, <a href="https://publications.waset.org/abstracts/search?q=computers%20prefer%20the%20ternary%20system" title=" computers prefer the ternary system"> computers prefer the ternary system</a> </p> <a href="https://publications.waset.org/abstracts/143278/teaching-the-binary-system-via-beautiful-facts-from-the-real-life" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/143278.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">187</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">1641</span> Hit-Or-Miss Transform as a Tool for Similar Shape Detection</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Osama%20Mohamed%20Elrajubi">Osama Mohamed Elrajubi</a>, <a href="https://publications.waset.org/abstracts/search?q=Idris%20El-Feghi"> Idris El-Feghi</a>, <a href="https://publications.waset.org/abstracts/search?q=Mohamed%20Abu%20Baker%20Saghayer"> Mohamed Abu Baker Saghayer</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper describes an identification of specific shapes within binary images using the morphological Hit-or-Miss Transform (HMT). Hit-or-Miss transform is a general binary morphological operation that can be used in searching of particular patterns of foreground and background pixels in an image. It is actually a basic operation of binary morphology since almost all other binary morphological operators are derived from it. The input of this method is a binary image and a structuring element (a template which will be searched in a binary image) while the output is another binary image. In this paper a modification of Hit-or-Miss transform has been proposed. The accuracy of algorithm is adjusted according to the similarity of the template and the sought template. The implementation of this method has been done by C language. The algorithm has been tested on several images and the results have shown that this new method can be used for similar shape detection. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=hit-or-miss%20operator%20transform" title="hit-or-miss operator transform">hit-or-miss operator transform</a>, <a href="https://publications.waset.org/abstracts/search?q=HMT" title=" HMT"> HMT</a>, <a href="https://publications.waset.org/abstracts/search?q=binary%20morphological%20operation" title=" binary morphological operation"> binary morphological operation</a>, <a href="https://publications.waset.org/abstracts/search?q=shape%20detection" title=" shape detection"> shape detection</a>, <a href="https://publications.waset.org/abstracts/search?q=binary%20images%20processing" title=" binary images processing"> binary images processing</a> </p> <a href="https://publications.waset.org/abstracts/11881/hit-or-miss-transform-as-a-tool-for-similar-shape-detection" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/11881.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">332</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">1640</span> On the Construction of Some Optimal Binary Linear Codes</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Skezeer%20John%20B.%20Paz">Skezeer John B. Paz</a>, <a href="https://publications.waset.org/abstracts/search?q=Ederlina%20G.%20Nocon"> Ederlina G. Nocon</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Finding an optimal binary linear code is a central problem in coding theory. A binary linear code C = [n, k, d] is called optimal if there is no linear code with higher minimum distance d given the length n and the dimension k. There are bounds giving limits for the minimum distance d of a linear code of fixed length n and dimension k. The lower bound which can be taken by construction process tells that there is a known linear code having this minimum distance. The upper bound is given by theoretic results such as Griesmer bound. One way to find an optimal binary linear code is to make the lower bound of d equal to its higher bound. That is, to construct a binary linear code which achieves the highest possible value of its minimum distance d, given n and k. Some optimal binary linear codes were presented by Andries Brouwer in his published table on bounds of the minimum distance d of binary linear codes for 1 ≤ n ≤ 256 and k ≤ n. This was further improved by Markus Grassl by giving a detailed construction process for each code exhibiting the lower bound. In this paper, we construct new optimal binary linear codes by using some construction processes on existing binary linear codes. Particularly, we developed an algorithm applied to the codes already constructed to extend the list of optimal binary linear codes up to 257 ≤ n ≤ 300 for k ≤ 7. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=bounds%20of%20linear%20codes" title="bounds of linear codes">bounds of linear codes</a>, <a href="https://publications.waset.org/abstracts/search?q=Griesmer%20bound" title=" Griesmer bound"> Griesmer bound</a>, <a href="https://publications.waset.org/abstracts/search?q=construction%20of%20linear%20codes" title=" construction of linear codes"> construction of linear codes</a>, <a href="https://publications.waset.org/abstracts/search?q=optimal%20binary%20linear%20codes" title=" optimal binary linear codes"> optimal binary linear codes</a> </p> <a href="https://publications.waset.org/abstracts/31628/on-the-construction-of-some-optimal-binary-linear-codes" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/31628.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">755</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">1639</span> Soret-Driven Convection in a Binary Fluid with Coriolis Force</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=N.%20H.%20Z.%20Abidin">N. H. Z. Abidin</a>, <a href="https://publications.waset.org/abstracts/search?q=N.%20F.%20M.%20Mokhtar"> N. F. M. Mokhtar</a>, <a href="https://publications.waset.org/abstracts/search?q=S.%20S.%20A.%20Gani"> S. S. A. Gani</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The influence of diffusion of the thermal or known as Soret effect in a heated Binary fluid model with Coriolis force is investigated theoretically. The linear stability analysis is used, and the eigenvalue is obtained using the Galerkin method. The impact of the Soret and Coriolis force on the onset of stationary convection in a system is analysed with respect to various Binary fluid parameters and presented graphically. It is found that an increase of the Soret values, destabilize the Binary fluid layer system. However, elevating the values of the Coriolis force helps to lag the onset of convection in a system. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=Benard%20convection" title="Benard convection">Benard convection</a>, <a href="https://publications.waset.org/abstracts/search?q=binary%20fluid" title=" binary fluid"> binary fluid</a>, <a href="https://publications.waset.org/abstracts/search?q=Coriolis" title=" Coriolis"> Coriolis</a>, <a href="https://publications.waset.org/abstracts/search?q=Soret" title=" Soret "> Soret </a> </p> <a href="https://publications.waset.org/abstracts/68076/soret-driven-convection-in-a-binary-fluid-with-coriolis-force" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/68076.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">386</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">1638</span> Reconstruction of Binary Matrices Satisfying Neighborhood Constraints by Simulated Annealing</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Divyesh%20Patel">Divyesh Patel</a>, <a href="https://publications.waset.org/abstracts/search?q=Tanuja%20Srivastava"> Tanuja Srivastava</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper considers the NP-hard problem of reconstructing binary matrices satisfying exactly-1-4-adjacency constraint from its row and column projections. This problem is formulated into a maximization problem. The objective function gives a measure of adjacency constraint for the binary matrices. The maximization problem is solved by the simulated annealing algorithm and experimental results are presented. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=discrete%20tomography" title="discrete tomography">discrete tomography</a>, <a href="https://publications.waset.org/abstracts/search?q=exactly-1-4-adjacency" title=" exactly-1-4-adjacency"> exactly-1-4-adjacency</a>, <a href="https://publications.waset.org/abstracts/search?q=simulated%20annealing" title=" simulated annealing"> simulated annealing</a>, <a href="https://publications.waset.org/abstracts/search?q=binary%20matrices" title=" binary matrices"> binary matrices</a> </p> <a href="https://publications.waset.org/abstracts/8505/reconstruction-of-binary-matrices-satisfying-neighborhood-constraints-by-simulated-annealing" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/8505.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">406</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">1637</span> Theoretical and Experimental Investigations of Binary Systems for Hydrogen Storage</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Gauthier%20Lefevre">Gauthier Lefevre</a>, <a href="https://publications.waset.org/abstracts/search?q=Holger%20Kohlmann"> Holger Kohlmann</a>, <a href="https://publications.waset.org/abstracts/search?q=Sebastien%20Saitzek"> Sebastien Saitzek</a>, <a href="https://publications.waset.org/abstracts/search?q=Rachel%20Desfeux"> Rachel Desfeux</a>, <a href="https://publications.waset.org/abstracts/search?q=Adlane%20Sayede"> Adlane Sayede</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Hydrogen is a promising energy carrier, compatible with the sustainable energy concept. In this context, solid-state hydrogen-storage is the key challenge in developing hydrogen economy. The capability of absorption of large quantities of hydrogen makes intermetallic systems of particular interest. In this study, efforts have been devoted to the theoretical investigation of binary systems with constraints consideration. On the one hand, besides considering hydrogen-storage, a reinvestigation of crystal structures of the palladium-arsenic system shows, with experimental validations, that binary systems could still currently present new or unknown relevant structures. On the other hand, various binary Mg-based systems were theoretically scrutinized in order to find new interesting alloys for hydrogen storage. Taking the effect of pressure into account reveals a wide range of alternative structures, changing radically the stable compounds of studied binary systems. Similar constraints, induced by Pulsed Laser Deposition, have been applied to binary systems, and results are presented. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=binary%20systems" title="binary systems">binary systems</a>, <a href="https://publications.waset.org/abstracts/search?q=evolutionary%20algorithm" title=" evolutionary algorithm"> evolutionary algorithm</a>, <a href="https://publications.waset.org/abstracts/search?q=first%20principles%20study" title=" first principles study"> first principles study</a>, <a href="https://publications.waset.org/abstracts/search?q=pulsed%20laser%20deposition" title=" pulsed laser deposition"> pulsed laser deposition</a> </p> <a href="https://publications.waset.org/abstracts/67827/theoretical-and-experimental-investigations-of-binary-systems-for-hydrogen-storage" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/67827.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">272</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">1636</span> A Study of Chinese-specific Terms in Government Work Report(2017-2019) from the Perspective of Relevance Theory</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Shi%20Jiaxin">Shi Jiaxin</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The Government Work Report is an essential form of document in the government of the People’s Republic of China. It covers all aspects of Chinese society and reflects China’s development strategy and trend. There are countless special terms in Government Work Report. Only by understanding Chinese-specific terms can we understand the content of the Government Work Report. Only by accurately translating the Chinese-specific terms can people come from all across the world know the Chinese government work report and understand China. Relevance theory is a popular theory of cognitive pragmatics. Relevance Translation Theory, which is closely related to Relevance Theory, has crucial and major guiding significance for the translation of Chinese-specific. Through studying Relevance Theory and researching the translation techniques, strategies and applications in the process of translating Chinese-specific terms from the perspective of Relevance Theory, we can understand the meaning and connotation of Chinese-specific terms, then solve various problems in the process of C-E translation, and strengthen our translation ability. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=government%20work%20report" title="government work report">government work report</a>, <a href="https://publications.waset.org/abstracts/search?q=Chinese-specific%20terms" title=" Chinese-specific terms"> Chinese-specific terms</a>, <a href="https://publications.waset.org/abstracts/search?q=relevance%20theory" title=" relevance theory"> relevance theory</a>, <a href="https://publications.waset.org/abstracts/search?q=translation" title=" translation"> translation</a> </p> <a href="https://publications.waset.org/abstracts/147040/a-study-of-chinese-specific-terms-in-government-work-report2017-2019-from-the-perspective-of-relevance-theory" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/147040.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">169</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1635</span> Comparative Analysis of Dissimilarity Detection between Binary Images Based on Equivalency and Non-Equivalency of Image Inversion</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Adnan%20A.%20Y.%20Mustafa">Adnan A. Y. Mustafa</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Image matching is a fundamental problem that arises frequently in many aspects of robot and computer vision. It can become a time-consuming process when matching images to a database consisting of hundreds of images, especially if the images are big. One approach to reducing the time complexity of the matching process is to reduce the search space in a pre-matching stage, by simply removing dissimilar images quickly. The Probabilistic Matching Model for Binary Images (PMMBI) showed that dissimilarity detection between binary images can be accomplished quickly by random pixel mapping and is size invariant. The model is based on the gamma binary similarity distance that recognizes an image and its inverse as containing the same scene and hence considers them to be the same image. However, in many applications, an image and its inverse are not treated as being the same but rather dissimilar. In this paper, we present a comparative analysis of dissimilarity detection between PMMBI based on the gamma binary similarity distance and a modified PMMBI model based on a similarity distance that does distinguish between an image and its inverse as being dissimilar. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=binary%20image" title="binary image">binary image</a>, <a href="https://publications.waset.org/abstracts/search?q=dissimilarity%20detection" title=" dissimilarity detection"> dissimilarity detection</a>, <a href="https://publications.waset.org/abstracts/search?q=probabilistic%20matching%20model%20for%20binary%20images" title=" probabilistic matching model for binary images"> probabilistic matching model for binary images</a>, <a href="https://publications.waset.org/abstracts/search?q=image%20mapping" title=" image mapping"> image mapping</a> </p> <a href="https://publications.waset.org/abstracts/113778/comparative-analysis-of-dissimilarity-detection-between-binary-images-based-on-equivalency-and-non-equivalency-of-image-inversion" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/113778.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">153</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">1634</span> Quick Similarity Measurement of Binary Images via Probabilistic Pixel Mapping</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Adnan%20A.%20Y.%20Mustafa">Adnan A. Y. Mustafa</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper we present a quick technique to measure the similarity between binary images. The technique is based on a probabilistic mapping approach and is fast because only a minute percentage of the image pixels need to be compared to measure the similarity, and not the whole image. We exploit the power of the Probabilistic Matching Model for Binary Images (PMMBI) to arrive at an estimate of the similarity. We show that the estimate is a good approximation of the actual value, and the quality of the estimate can be improved further with increased image mappings. Furthermore, the technique is image size invariant; the similarity between big images can be measured as fast as that for small images. Examples of trials conducted on real images are presented. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=big%20images" title="big images">big images</a>, <a href="https://publications.waset.org/abstracts/search?q=binary%20images" title=" binary images"> binary images</a>, <a href="https://publications.waset.org/abstracts/search?q=image%20matching" title=" image matching"> image matching</a>, <a href="https://publications.waset.org/abstracts/search?q=image%20similarity" title=" image similarity"> image similarity</a> </p> <a href="https://publications.waset.org/abstracts/89963/quick-similarity-measurement-of-binary-images-via-probabilistic-pixel-mapping" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/89963.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">196</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1633</span> A Five-Year Follow-up Survey Using Regression Analysis Finds Only Maternal Age to Be a Significant Medical Predictor for Infertility Treatment</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Lea%20Stein">Lea Stein</a>, <a href="https://publications.waset.org/abstracts/search?q=Sabine%20R%C3%B6sner"> Sabine Rösner</a>, <a href="https://publications.waset.org/abstracts/search?q=Alessandra%20Lo%20Giudice"> Alessandra Lo Giudice</a>, <a href="https://publications.waset.org/abstracts/search?q=Beate%20Ditzen"> Beate Ditzen</a>, <a href="https://publications.waset.org/abstracts/search?q=Tewes%20Wischmann"> Tewes Wischmann</a> </p> <p class="card-text"><strong>Abstract:</strong></p> For many couples bearing children is a consistent life goal; however, it cannot always be fulfilled. Undergoing infertility treatment does not guarantee pregnancies and live births. Couples have to deal with miscarriages and sometimes even discontinue infertility treatment. Significant medical predictors for the outcome of infertility treatment have yet to be fully identified. To further our understanding, a cross-sectional five-year follow-up survey was undertaken, in which 95 women and 82 men that have been treated at the Women’s Hospital of Heidelberg University participated. Binary logistic regressions, parametric and non-parametric methods were used for our sample to determine the relevance of biological (infertility diagnoses, maternal and paternal age) and lifestyle factors (smoking, drinking, over- and underweight) on the outcome of infertility treatment (clinical pregnancy, live birth, miscarriage, dropout rate). During infertility treatment, 72.6% of couples became pregnant and 69.5% were able to give birth. Suffering from miscarriages 27.5% of couples and 20.5% decided to discontinue an unsuccessful fertility treatment. The binary logistic regression models for clinical pregnancies, live births and dropouts were statistically significant for the maternal age, whereas the paternal age in addition to maternal and paternal BMI, smoking, infertility diagnoses and infections, showed no significant predicting effect on any of the outcome variables. The results confirm an effect of maternal age on infertility treatment, whereas the relevance of other medical predictors remains unclear. Further investigations should be considered to increase our knowledge of medical predictors. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=advanced%20maternal%20age" title="advanced maternal age">advanced maternal age</a>, <a href="https://publications.waset.org/abstracts/search?q=assisted%20reproductive%20technology" title=" assisted reproductive technology"> assisted reproductive technology</a>, <a href="https://publications.waset.org/abstracts/search?q=female%20factor" title=" female factor"> female factor</a>, <a href="https://publications.waset.org/abstracts/search?q=male%20factor" title=" male factor"> male factor</a>, <a href="https://publications.waset.org/abstracts/search?q=medical%20predictors" title=" medical predictors"> medical predictors</a>, <a href="https://publications.waset.org/abstracts/search?q=infertility%20treatment" title=" infertility treatment"> infertility treatment</a>, <a href="https://publications.waset.org/abstracts/search?q=reproductive%20medicine" title=" reproductive medicine"> reproductive medicine</a> </p> <a href="https://publications.waset.org/abstracts/154994/a-five-year-follow-up-survey-using-regression-analysis-finds-only-maternal-age-to-be-a-significant-medical-predictor-for-infertility-treatment" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/154994.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">1632</span> Motion of an Infinitesimal Particle in Binary Stellar Systems: Kepler-34, Kepler-35, Kepler-16, Kepler-413</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Rajib%20Mia">Rajib Mia</a>, <a href="https://publications.waset.org/abstracts/search?q=Badam%20Singh%20Kushvah"> Badam Singh Kushvah</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The present research was motivated by the recent discovery of the binary star systems. In this paper, we use the restricted three-body problem in the binary stellar systems, considering photogravitational effects of both the stars. The aim of this study is to investigate the motion of the infinitesimal mass in the vicinity of the Lagrangian points. The stability and periodic orbits of collinear points and the stability and trajectories of the triangular points are studied in stellar binary systems Kepler-34, Kepler-35, Kepler-413 and Kepler-16 systems. A detailed comparison is made among periodic orbits and trajectories. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=exoplanetary%20systems" title="exoplanetary systems">exoplanetary systems</a>, <a href="https://publications.waset.org/abstracts/search?q=lagrangian%20points" title=" lagrangian points"> lagrangian points</a>, <a href="https://publications.waset.org/abstracts/search?q=periodic%20orbit" title=" periodic orbit"> periodic orbit</a>, <a href="https://publications.waset.org/abstracts/search?q=restricted%20three%20body%20problem" title=" restricted three body problem"> restricted three body problem</a>, <a href="https://publications.waset.org/abstracts/search?q=stability" title=" stability"> stability</a> </p> <a href="https://publications.waset.org/abstracts/28253/motion-of-an-infinitesimal-particle-in-binary-stellar-systems-kepler-34-kepler-35-kepler-16-kepler-413" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/28253.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">434</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">1631</span> The Valuation of Equity Book Value and Net Income of Financial Firms in Times of Financial Crisis</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Sami%20Adwan">Sami Adwan</a>, <a href="https://publications.waset.org/abstracts/search?q=Alaa%20Alhaj%20Ismail"> Alaa Alhaj Ismail</a>, <a href="https://publications.waset.org/abstracts/search?q=Claudia%20Girardone"> Claudia Girardone</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper examines the changes in the value relevance of book value of equity and net income of financial firms over the crisis period. It also examines how these changes vary with three variables, namely, fair value exposure, ownership concentration, and regulatory capital ratios. Using a sample of financial firms operating in the European Economic Area over 2005-2011, our findings suggest that the value relevance of book value of equity increases while that of net income decreases during the financial crisis. We find that more exposure to fair value accounting mitigates the impact of the crisis on the value relevance of book value of equity and net income. We also find that more concentrated ownership appears to have a mitigating impact on the changes in the value relevance of both book value of equity and net income in times of financial crisis. Finally, we find evidence that the level of regulatory capital ratios tends to have an attenuating effect on the changes in the value relevance of net income (but not book value of equity) in times of financial crisis. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=value%20relevance" title="value relevance">value relevance</a>, <a href="https://publications.waset.org/abstracts/search?q=financial%20crisis" title=" financial crisis"> financial crisis</a>, <a href="https://publications.waset.org/abstracts/search?q=financial%20firms" title=" financial firms"> financial firms</a>, <a href="https://publications.waset.org/abstracts/search?q=fair%20value" title=" fair value"> fair value</a>, <a href="https://publications.waset.org/abstracts/search?q=ownership%20concentration" title=" ownership concentration"> ownership concentration</a>, <a href="https://publications.waset.org/abstracts/search?q=regulatory%20capital" title=" regulatory capital"> regulatory capital</a> </p> <a href="https://publications.waset.org/abstracts/103677/the-valuation-of-equity-book-value-and-net-income-of-financial-firms-in-times-of-financial-crisis" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/103677.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">181</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">1630</span> Approximately Similarity Measurement of Web Sites Using Genetic Algorithms and Binary Trees</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Doru%20Anastasiu%20Popescu">Doru Anastasiu Popescu</a>, <a href="https://publications.waset.org/abstracts/search?q=Dan%20R%C4%83dulescu"> Dan Rădulescu</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, we determine the similarity of two HTML web applications. We are going to use a genetic algorithm in order to determine the most significant web pages of each application (we are not going to use every web page of a site). Using these significant web pages, we will find the similarity value between the two applications. The algorithm is going to be efficient because we are going to use a reduced number of web pages for comparisons but it will return an approximate value of the similarity. The binary trees are used to keep the tags from the significant pages. The algorithm was implemented in Java language. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=Tag" title="Tag">Tag</a>, <a href="https://publications.waset.org/abstracts/search?q=HTML" title=" HTML"> HTML</a>, <a href="https://publications.waset.org/abstracts/search?q=web%20page" title=" web page"> web page</a>, <a href="https://publications.waset.org/abstracts/search?q=genetic%20algorithm" title=" genetic algorithm"> genetic algorithm</a>, <a href="https://publications.waset.org/abstracts/search?q=similarity%20value" title=" similarity value"> similarity value</a>, <a href="https://publications.waset.org/abstracts/search?q=binary%20tree" title=" binary tree"> binary tree</a> </p> <a href="https://publications.waset.org/abstracts/50460/approximately-similarity-measurement-of-web-sites-using-genetic-algorithms-and-binary-trees" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/50460.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">355</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1629</span> Relevance of the Tokyo Trial: A Comparative Perspective</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Nalanda%20Roy">Nalanda Roy</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The project will offer a fresh and critical perspective into the Tokyo Trial judgment led by the Indian Jurist Dr. Radha Binod Pal. The project will focus on the Third World Approach to International Law (TWAIL) methodology to examine the relevance of international law from the post-colonial perspectives. The project will analyze Pal’s dissenting arguments from a new and comparative perspective, apply for work from other disciplines, and create an understanding of the significance of the historic judgment considering its contemporary relevance, and fill in the gaps that exist in the call for global justice. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=Tokyo%20trial" title="Tokyo trial">Tokyo trial</a>, <a href="https://publications.waset.org/abstracts/search?q=third%20world" title=" third world"> third world</a>, <a href="https://publications.waset.org/abstracts/search?q=judgment" title=" judgment"> judgment</a>, <a href="https://publications.waset.org/abstracts/search?q=international%20law" title=" international law"> international law</a> </p> <a href="https://publications.waset.org/abstracts/158752/relevance-of-the-tokyo-trial-a-comparative-perspective" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/158752.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">91</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">1628</span> Pyramid Binary Pattern for Age Invariant Face Verification</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Saroj%20Bijarnia">Saroj Bijarnia</a>, <a href="https://publications.waset.org/abstracts/search?q=Preety%20Singh"> Preety Singh</a> </p> <p class="card-text"><strong>Abstract:</strong></p> We propose a simple and effective biometrics system based on face verification across aging using a new variant of texture feature, Pyramid Binary Pattern. This employs Local Binary Pattern along with its hierarchical information. Dimension reduction of generated texture feature vector is done using Principal Component Analysis. Support Vector Machine is used for classification. Our proposed method achieves an accuracy of 92:24% and can be used in an automated age-invariant face verification system. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=biometrics" title="biometrics">biometrics</a>, <a href="https://publications.waset.org/abstracts/search?q=age%20invariant" title=" age invariant"> age invariant</a>, <a href="https://publications.waset.org/abstracts/search?q=verification" title=" verification"> verification</a>, <a href="https://publications.waset.org/abstracts/search?q=support%20vector%20machine" title=" support vector machine"> support vector machine</a> </p> <a href="https://publications.waset.org/abstracts/64435/pyramid-binary-pattern-for-age-invariant-face-verification" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/64435.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">353</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">1627</span> Personalizing Human Physical Life Routines Recognition over Cloud-based Sensor Data via AI and Machine Learning</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Kaushik%20Sathupadi">Kaushik Sathupadi</a>, <a href="https://publications.waset.org/abstracts/search?q=Sandesh%20Achar"> Sandesh Achar</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Pervasive computing is a growing research field that aims to acknowledge human physical life routines (HPLR) based on body-worn sensors such as MEMS sensors-based technologies. The use of these technologies for human activity recognition is progressively increasing. On the other hand, personalizing human life routines using numerous machine-learning techniques has always been an intriguing topic. In contrast, various methods have demonstrated the ability to recognize basic movement patterns. However, it still needs to be improved to anticipate the dynamics of human living patterns. This study introduces state-of-the-art techniques for recognizing static and dy-namic patterns and forecasting those challenging activities from multi-fused sensors. Further-more, numerous MEMS signals are extracted from one self-annotated IM-WSHA dataset and two benchmarked datasets. First, we acquired raw data is filtered with z-normalization and denoiser methods. Then, we adopted statistical, local binary pattern, auto-regressive model, and intrinsic time scale decomposition major features for feature extraction from different domains. Next, the acquired features are optimized using maximum relevance and minimum redundancy (mRMR). Finally, the artificial neural network is applied to analyze the whole system's performance. As a result, we attained a 90.27% recognition rate for the self-annotated dataset, while the HARTH and KU-HAR achieved 83% on nine living activities and 90.94% on 18 static and dynamic routines. Thus, the proposed HPLR system outperformed other state-of-the-art systems when evaluated with other methods in the literature. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=artificial%20intelligence" title="artificial intelligence">artificial intelligence</a>, <a href="https://publications.waset.org/abstracts/search?q=machine%20learning" title=" machine learning"> machine learning</a>, <a href="https://publications.waset.org/abstracts/search?q=gait%20analysis" title=" gait analysis"> gait analysis</a>, <a href="https://publications.waset.org/abstracts/search?q=local%20binary%20pattern%20%28LBP%29" title=" local binary pattern (LBP)"> local binary pattern (LBP)</a>, <a href="https://publications.waset.org/abstracts/search?q=statistical%20features" title=" statistical features"> statistical features</a>, <a href="https://publications.waset.org/abstracts/search?q=micro-electro-mechanical%20systems%20%28MEMS%29" title=" micro-electro-mechanical systems (MEMS)"> micro-electro-mechanical systems (MEMS)</a>, <a href="https://publications.waset.org/abstracts/search?q=maximum%20relevance%20and%20minimum%20re-dundancy%20%28MRMR%29" title=" maximum relevance and minimum re-dundancy (MRMR)"> maximum relevance and minimum re-dundancy (MRMR)</a> </p> <a href="https://publications.waset.org/abstracts/190027/personalizing-human-physical-life-routines-recognition-over-cloud-based-sensor-data-via-ai-and-machine-learning" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/190027.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">20</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">1626</span> Solving the Set Covering Problem Using the Binary Cat Swarm Optimization Metaheuristic</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Broderick%20Crawford">Broderick Crawford</a>, <a href="https://publications.waset.org/abstracts/search?q=Ricardo%20Soto"> Ricardo Soto</a>, <a href="https://publications.waset.org/abstracts/search?q=Natalia%20Berrios"> Natalia Berrios</a>, <a href="https://publications.waset.org/abstracts/search?q=Eduardo%20Olguin"> Eduardo Olguin</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, we present a binary cat swarm optimization for solving the Set covering problem. The set covering problem is a well-known NP-hard problem with many practical applications, including those involving scheduling, production planning and location problems. Binary cat swarm optimization is a recent swarm metaheuristic technique based on the behavior of discrete cats. Domestic cats show the ability to hunt and are curious about moving objects. The cats have two modes of behavior: seeking mode and tracing mode. We illustrate this approach with 65 instances of the problem from the OR-Library. Moreover, we solve this problem with 40 new binarization techniques and we select the technical with the best results obtained. Finally, we make a comparison between results obtained in previous studies and the new binarization technique, that is, with roulette wheel as transfer function and V3 as discretization technique. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=binary%20cat%20swarm%20optimization" title="binary cat swarm optimization">binary cat swarm optimization</a>, <a href="https://publications.waset.org/abstracts/search?q=binarization%20methods" title=" binarization methods"> binarization methods</a>, <a href="https://publications.waset.org/abstracts/search?q=metaheuristic" title=" metaheuristic"> metaheuristic</a>, <a href="https://publications.waset.org/abstracts/search?q=set%20covering%20problem" title=" set covering problem"> set covering problem</a> </p> <a href="https://publications.waset.org/abstracts/47183/solving-the-set-covering-problem-using-the-binary-cat-swarm-optimization-metaheuristic" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/47183.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">396</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">1625</span> Variable vs. Fixed Window Width Code Correlation Reference Waveform Receivers for Multipath Mitigation in Global Navigation Satellite Systems with Binary Offset Carrier and Multiplexed Binary Offset Carrier Signals</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Fahad%20Alhussein">Fahad Alhussein</a>, <a href="https://publications.waset.org/abstracts/search?q=Huaping%20Liu"> Huaping Liu</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper compares the multipath mitigation performance of code correlation reference waveform receivers with variable and fixed window width, for binary offset carrier and multiplexed binary offset carrier signals typically used in global navigation satellite systems. In the variable window width method, such width is iteratively reduced until the distortion on the discriminator with multipath is eliminated. This distortion is measured as the Euclidean distance between the actual discriminator (obtained with the incoming signal), and the local discriminator (generated with a local copy of the signal). The variable window width have shown better performance compared to the fixed window width. In particular, the former yields zero error for all delays for the BOC and MBOC signals considered, while the latter gives rather large nonzero errors for small delays in all cases. Due to its computational simplicity, the variable window width method is perfectly suitable for implementation in low-cost receivers. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=correlation%20reference%20waveform%20receivers" title="correlation reference waveform receivers">correlation reference waveform receivers</a>, <a href="https://publications.waset.org/abstracts/search?q=binary%20offset%20carrier" title=" binary offset carrier"> binary offset carrier</a>, <a href="https://publications.waset.org/abstracts/search?q=multiplexed%20binary%20offset%20carrier" title=" multiplexed binary offset carrier"> multiplexed binary offset carrier</a>, <a href="https://publications.waset.org/abstracts/search?q=global%20navigation%20satellite%20systems" title=" global navigation satellite systems"> global navigation satellite systems</a> </p> <a href="https://publications.waset.org/abstracts/116944/variable-vs-fixed-window-width-code-correlation-reference-waveform-receivers-for-multipath-mitigation-in-global-navigation-satellite-systems-with-binary-offset-carrier-and-multiplexed-binary-offset-carrier-signals" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/116944.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">131</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1624</span> Struggles of Non-Binary People in an Organizational Setting in Iceland</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Kevin%20Henry">Kevin Henry</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Introduction: This research identifies the main struggles of non-binary people in an organizational setting using the ZMET – method of in-depth interviews. The research was done in Iceland, a country that is repeatedly listed in the top countries for gender equality and found three main categories of non-binary struggles in organizations. These categories can be used to improve organizational non-binary inclusion. Aim: The main questions this paper will answer are: Which unique obstacles are non-binary people facing in their daily organizational life? Which organizational and individual measures help with more inclusion of non-binary people? How can organizational gender equality measures be made more inclusive of non-binary issues? Background: Even though gender equality is a much-researched topic, the struggles of non-binary people are often overlooked in gender equality research. Additionally, non-binary and transgender people are frequently researched together, even though their struggles can be very different. Research focused on non-binary people is, in many cases, done on a more structural or organizational level with quantitative data such as salary or position within an organization. This research focuses on the individual and their struggles with qualitative data to derive measures for non-binary inclusion and equality. Method: An adapted approach of the ZMET-Method (Zaltman Metaphor Elicitation Technique) will be used, during which in-depth interviews are held with individuals, utilizing pictures as a metaphorical starting point to discuss their main thoughts and feelings on being non-binary in an organizational setting. Interviewees prepared five pictures, each representing one key thought or feeling about their organizational life. The interviewer then lets the interviewee describe each picture and asks probing questions to get a deeper understanding of each individual topic. This method helps with a mostly unbiased data collection process by only asking probing questions during the interview and not leading the interviewee in any certain direction. Results: This research has identified three main categories of struggles non-binary people are facing in an organizational setting: internal (personal) struggles, external struggles and structural struggles. Internal struggles refer to struggles that originate from the person themselves (e.g., struggles with their own identity). External struggles refer to struggles from the outside (e.g. harassment from coworkers, exclusion). Structural struggles refer to struggles that are built into the organizational policy or facilities (e.g. restrooms, gendered language). Conclusion: This study shows that there are many struggles for non-binary people in organizations and that even in countries that pride themselves on being progressive and having a high level of gender equality, there is still much to be done for non-binary inclusion. Implications for Organizations: Organizations that strive to improve the inclusion of all genders should pay attention to how their structures are built, how their training is conducted, and how their policies affect people of various genders. Simple changes like making restrooms gender-neutral and using neutral language in company communications are good examples of small structural steps for more inclusion. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=gender%20equality" title="gender equality">gender equality</a>, <a href="https://publications.waset.org/abstracts/search?q=non-binary" title=" non-binary"> non-binary</a>, <a href="https://publications.waset.org/abstracts/search?q=organizations" title=" organizations"> organizations</a>, <a href="https://publications.waset.org/abstracts/search?q=ZMET" title=" ZMET"> ZMET</a> </p> <a href="https://publications.waset.org/abstracts/186329/struggles-of-non-binary-people-in-an-organizational-setting-in-iceland" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/186329.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">43</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">1623</span> Motion of a Dust Grain Type Particle in Binary Stellar Systems</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Rajib%20Mia">Rajib Mia</a>, <a href="https://publications.waset.org/abstracts/search?q=Badam%20Singh%20Kushvah"> Badam Singh Kushvah</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this present paper, we use the photogravitational version of the restricted three body problem (RTBP) in binary systems. In the photogravitational RTBP, an infinitesimal particle (dust grain) is moving under the gravitational attraction and radiation pressure from the two bigger primaries. The third particle does not affect the motion of two bigger primaries. The zero-velocity curves, zero-velocity surfaces and their projections on the plane are studied. We have used existing analytical method to solve the equations of motion. We have obtained the Lagrangian points in some binary stellar systems. It is found that mass reduction factor affects the Lagrangian points. The linear stability of Lagrangian points is studied and found that these points are unstable. Moreover, trajectories of the infinitesimal particle at the triangular points are studied. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=binary%20systems" title="binary systems">binary systems</a>, <a href="https://publications.waset.org/abstracts/search?q=Lagrangian%20points" title=" Lagrangian points"> Lagrangian points</a>, <a href="https://publications.waset.org/abstracts/search?q=linear%20stability" title=" linear stability"> linear stability</a>, <a href="https://publications.waset.org/abstracts/search?q=photogravitational%20RTBP" title=" photogravitational RTBP"> photogravitational RTBP</a>, <a href="https://publications.waset.org/abstracts/search?q=trajectories" title=" trajectories"> trajectories</a> </p> <a href="https://publications.waset.org/abstracts/53094/motion-of-a-dust-grain-type-particle-in-binary-stellar-systems" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/53094.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">253</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">1622</span> Durability Study of Binary Blended High Performance Concrete</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Vatsal%20Patel">Vatsal Patel</a>, <a href="https://publications.waset.org/abstracts/search?q=Niraj%20Shah"> Niraj Shah</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper presents the results of a laboratory study on the properties of binary blended High Performance cementitious systems containing blends of ordinary Portland cement (OPC), Porcelain Powder or Marble Powder blend proportions of 100:00, 95:05, 90:10, 85:15, 80:20 for OPC: Porcelain Powder/Marble Powder. Studies on the Engineering Properties of the cementitious concrete, namely compressive strength, flexural strength, sorptivity, rapid chloride penetration test and accelerated corrosion test have been performed and those of OPC concrete. The results show that the inclusion of Porcelain powder or Marble Powder as binary blended cement alters to a great degree the properties of the binder as well as the resulting concrete. In addition, the results show that the Porcelain powder with 85:15 proportions and Marble powder with 90:10 proportions as binary systems to produce high-performance concrete could potentially be used in the concrete construction industry particular in lowering down the volume of OPC used and lowering emission of CO2 produces during manufacturing of cement. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=accelerated%20corrosion" title="accelerated corrosion">accelerated corrosion</a>, <a href="https://publications.waset.org/abstracts/search?q=binary%20blended%20cementitious%20system" title=" binary blended cementitious system"> binary blended cementitious system</a>, <a href="https://publications.waset.org/abstracts/search?q=rapid%20chloride%20penetration" title=" rapid chloride penetration"> rapid chloride penetration</a>, <a href="https://publications.waset.org/abstracts/search?q=sorptivity" title=" sorptivity"> sorptivity</a> </p> <a href="https://publications.waset.org/abstracts/21368/durability-study-of-binary-blended-high-performance-concrete" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/21368.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">386</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">1621</span> Densities and Viscosities of Binary Mixture Containing Diethylamine and 2-Alkanol</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Elham%20jassemi%20Zargani">Elham jassemi Zargani</a>, <a href="https://publications.waset.org/abstracts/search?q=Mohammad%20almasi"> Mohammad almasi</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Densities and viscosities for binary mixtures of diethylamine + 2 Alkanol (2 propanol up to 2 pentanol) were measured over the entire composition range and temperature interval of 293.15 to 323.15 K. Excess molar volumes V_m^E and viscosity deviations Δη were calculated and correlated by the Redlich−Kister type function to derive the coefficients and estimate the standard error. For mixtures of diethylamine with used 2-alkanols, V_m^E and Δη are negative over the entire range of mole fraction. The observed variations of these parameters, with alkanols chain length and temperature, are discussed in terms of the inter-molecular interactions between the unlike molecules of the binary mixtures. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=densities" title="densities">densities</a>, <a href="https://publications.waset.org/abstracts/search?q=viscosities" title=" viscosities"> viscosities</a>, <a href="https://publications.waset.org/abstracts/search?q=diethylamine" title=" diethylamine"> diethylamine</a>, <a href="https://publications.waset.org/abstracts/search?q=2-alkanol" title=" 2-alkanol"> 2-alkanol</a>, <a href="https://publications.waset.org/abstracts/search?q=Redlich-Kister" title=" Redlich-Kister "> Redlich-Kister </a> </p> <a href="https://publications.waset.org/abstracts/14020/densities-and-viscosities-of-binary-mixture-containing-diethylamine-and-2-alkanol" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/14020.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">388</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">1620</span> A Study of General Attacks on Elliptic Curve Discrete Logarithm Problem over Prime Field and Binary Field</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Tun%20Myat%20Aung">Tun Myat Aung</a>, <a href="https://publications.waset.org/abstracts/search?q=Ni%20Ni%20Hla"> Ni Ni Hla</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper begins by describing basic properties of finite field and elliptic curve cryptography over prime field and binary field. Then we discuss the discrete logarithm problem for elliptic curves and its properties. We study the general common attacks on elliptic curve discrete logarithm problem such as the Baby Step, Giant Step method, Pollard’s rho method and Pohlig-Hellman method, and describe in detail experiments of these attacks over prime field and binary field. The paper finishes by describing expected running time of the attacks and suggesting strong elliptic curves that are not susceptible to these attacks.c <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=discrete%20logarithm%20problem" title="discrete logarithm problem">discrete logarithm problem</a>, <a href="https://publications.waset.org/abstracts/search?q=general%20attacks" title=" general attacks"> general attacks</a>, <a href="https://publications.waset.org/abstracts/search?q=elliptic%20curve" title=" elliptic curve"> elliptic curve</a>, <a href="https://publications.waset.org/abstracts/search?q=prime%20field" title=" prime field"> prime field</a>, <a href="https://publications.waset.org/abstracts/search?q=binary%20field" title=" binary field"> binary field</a> </p> <a href="https://publications.waset.org/abstracts/82212/a-study-of-general-attacks-on-elliptic-curve-discrete-logarithm-problem-over-prime-field-and-binary-field" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/82212.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">233</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">1619</span> About the Case Portfolio Management Algorithms and Their Applications</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=M.%20Chumburidze">M. Chumburidze</a>, <a href="https://publications.waset.org/abstracts/search?q=N.%20Salia"> N. Salia</a>, <a href="https://publications.waset.org/abstracts/search?q=T.%20Namchevadze"> T. Namchevadze</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This work deal with case processing problems in business. The task of strategic credit requirements management of cases portfolio is discussed. The information model of credit requirements in a binary tree diagram is considered. The algorithms to solve issues of prioritizing clusters of cases in business have been investigated. An implementation of priority queues to support case management operations has been presented. The corresponding pseudo codes for the programming application have been constructed. The tools applied in this development are based on binary tree ordering algorithms, optimization theory, and business management methods. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=credit%20network" title="credit network">credit network</a>, <a href="https://publications.waset.org/abstracts/search?q=case%20portfolio" title=" case portfolio"> case portfolio</a>, <a href="https://publications.waset.org/abstracts/search?q=binary%20tree" title=" binary tree"> binary tree</a>, <a href="https://publications.waset.org/abstracts/search?q=priority%20queue" title=" priority queue"> priority queue</a>, <a href="https://publications.waset.org/abstracts/search?q=stack" title=" stack"> stack</a> </p> <a href="https://publications.waset.org/abstracts/168639/about-the-case-portfolio-management-algorithms-and-their-applications" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/168639.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">150</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1618</span> An Improved Face Recognition Algorithm Using Histogram-Based Features in Spatial and Frequency Domains</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Qiu%20Chen">Qiu Chen</a>, <a href="https://publications.waset.org/abstracts/search?q=Koji%20Kotani"> Koji Kotani</a>, <a href="https://publications.waset.org/abstracts/search?q=Feifei%20Lee"> Feifei Lee</a>, <a href="https://publications.waset.org/abstracts/search?q=Tadahiro%20Ohmi"> Tadahiro Ohmi</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, we propose an improved face recognition algorithm using histogram-based features in spatial and frequency domains. For adding spatial information of the face to improve recognition performance, a region-division (RD) method is utilized. The facial area is firstly divided into several regions, then feature vectors of each facial part are generated by Binary Vector Quantization (BVQ) histogram using DCT coefficients in low frequency domains, as well as Local Binary Pattern (LBP) histogram in spatial domain. Recognition results with different regions are first obtained separately and then fused by weighted averaging. Publicly available ORL database is used for the evaluation of our proposed algorithm, which is consisted of 40 subjects with 10 images per subject containing variations in lighting, posing, and expressions. It is demonstrated that face recognition using RD method can achieve much higher recognition rate. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=binary%20vector%20quantization%20%28BVQ%29" title="binary vector quantization (BVQ)">binary vector quantization (BVQ)</a>, <a href="https://publications.waset.org/abstracts/search?q=DCT%20coefficients" title="DCT coefficients">DCT coefficients</a>, <a href="https://publications.waset.org/abstracts/search?q=face%20recognition" title=" face recognition"> face recognition</a>, <a href="https://publications.waset.org/abstracts/search?q=local%20binary%20patterns%20%28LBP%29" title=" local binary patterns (LBP)"> local binary patterns (LBP)</a> </p> <a href="https://publications.waset.org/abstracts/44892/an-improved-face-recognition-algorithm-using-histogram-based-features-in-spatial-and-frequency-domains" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/44892.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">349</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">1617</span> Speech Enhancement Using Wavelet Coefficients Masking with Local Binary Patterns</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Christian%20Arcos">Christian Arcos</a>, <a href="https://publications.waset.org/abstracts/search?q=Marley%20Vellasco"> Marley Vellasco</a>, <a href="https://publications.waset.org/abstracts/search?q=Abraham%20Alcaim"> Abraham Alcaim</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, we present a wavelet coefficients masking based on Local Binary Patterns (WLBP) approach to enhance the temporal spectra of the wavelet coefficients for speech enhancement. This technique exploits the wavelet denoising scheme, which splits the degraded speech into pyramidal subband components and extracts frequency information without losing temporal information. Speech enhancement in each high-frequency subband is performed by binary labels through the local binary pattern masking that encodes the ratio between the original value of each coefficient and the values of the neighbour coefficients. This approach enhances the high-frequency spectra of the wavelet transform instead of eliminating them through a threshold. A comparative analysis is carried out with conventional speech enhancement algorithms, demonstrating that the proposed technique achieves significant improvements in terms of PESQ, an international recommendation of objective measure for estimating subjective speech quality. Informal listening tests also show that the proposed method in an acoustic context improves the quality of speech, avoiding the annoying musical noise present in other speech enhancement techniques. Experimental results obtained with a DNN based speech recognizer in noisy environments corroborate the superiority of the proposed scheme in the robust speech recognition scenario. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=binary%20labels" title="binary labels">binary labels</a>, <a href="https://publications.waset.org/abstracts/search?q=local%20binary%20patterns" title=" local binary patterns"> local binary patterns</a>, <a href="https://publications.waset.org/abstracts/search?q=mask" title=" mask"> mask</a>, <a href="https://publications.waset.org/abstracts/search?q=wavelet%20coefficients" title=" wavelet coefficients"> wavelet coefficients</a>, <a href="https://publications.waset.org/abstracts/search?q=speech%20enhancement" title=" speech enhancement"> speech enhancement</a>, <a href="https://publications.waset.org/abstracts/search?q=speech%20recognition" title=" speech recognition"> speech recognition</a> </p> <a href="https://publications.waset.org/abstracts/79985/speech-enhancement-using-wavelet-coefficients-masking-with-local-binary-patterns" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/79985.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">229</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">1616</span> Trace Network: A Probabilistic Relevant Pattern Recognition Approach to Attribution Trace Analysis</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Jian%20Xu">Jian Xu</a>, <a href="https://publications.waset.org/abstracts/search?q=Xiaochun%20Yun"> Xiaochun Yun</a>, <a href="https://publications.waset.org/abstracts/search?q=Yongzheng%20Zhang"> Yongzheng Zhang</a>, <a href="https://publications.waset.org/abstracts/search?q=Yafei%20Sang"> Yafei Sang</a>, <a href="https://publications.waset.org/abstracts/search?q=Zhenyu%20Cheng"> Zhenyu Cheng</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Network attack prevention is a critical research area of information security. Network attack would be oppressed if attribution techniques are capable to trace back to the attackers after the hacking event. Therefore attributing these attacks to a particular identification becomes one of the important tasks when analysts attempt to differentiate and profile the attacker behind a piece of attack trace. To assist analysts in expose attackers behind the scenes, this paper researches on the connections between attribution traces and proposes probabilistic relevance based attribution patterns. This method facilitates the evaluation of the plausibility relevance between different traceable identifications. Furthermore, through analyzing the connections among traces, it could confirm the existence probability of a certain organization as well as discover its affinitive partners by the means of drawing relevance matrix from attribution traces. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=attribution%20trace" title="attribution trace">attribution trace</a>, <a href="https://publications.waset.org/abstracts/search?q=probabilistic%20relevance" title=" probabilistic relevance"> probabilistic relevance</a>, <a href="https://publications.waset.org/abstracts/search?q=network%20attack" title=" network attack"> network attack</a>, <a href="https://publications.waset.org/abstracts/search?q=attacker%20identification" title=" attacker identification"> attacker identification</a> </p> <a href="https://publications.waset.org/abstracts/61350/trace-network-a-probabilistic-relevant-pattern-recognition-approach-to-attribution-trace-analysis" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/61350.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">366</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">1615</span> Does Operating Cash Flow Really Matter in Value Relevance? A Recent Empirical Analysis on the Largest European Companies</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Francesco%20Paolone">Francesco Paolone</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper investigates the role of Operating Cash Flow (OCF) and accruals in firm valuation analyzing financial statement information from the largest European companies and evaluating their relation to firm market value. Using a dataset of 500 largest European companies in 2018, the study investigates the relative value-relevance of equity, net income and operating cash flow (OCF). Findings show that the cash flow measure has the same explanatory power and intensity as equity and earnings to explain the market value. This study contributes to the debate on the value relevance of OCF incremental to book value and earnings. It also extends the literature, showing that OCF has information content (value relevance) superior to earnings and book value in the main European markets (Bepari et al., 2013). Finally, the study provides a support that accounting method choice may confuse investors, who have reduced confidence in accounting earnings and book value; in other words, nowadays European investors rely more on cash flows instead of accruals numbers. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=Cash%20Flow%20Statement" title="Cash Flow Statement">Cash Flow Statement</a>, <a href="https://publications.waset.org/abstracts/search?q=Value%20Relevance" title=" Value Relevance"> Value Relevance</a>, <a href="https://publications.waset.org/abstracts/search?q=Accounting" title=" Accounting"> Accounting</a>, <a href="https://publications.waset.org/abstracts/search?q=Financial%20Statement%20Analysis" title=" Financial Statement Analysis"> Financial Statement Analysis</a> </p> <a href="https://publications.waset.org/abstracts/121639/does-operating-cash-flow-really-matter-in-value-relevance-a-recent-empirical-analysis-on-the-largest-european-companies" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/121639.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">132</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1614</span> Arithmetic Operations Based on Double Base Number Systems</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=K.%20Sanjayani">K. Sanjayani</a>, <a href="https://publications.waset.org/abstracts/search?q=C.%20Saraswathy"> C. Saraswathy</a>, <a href="https://publications.waset.org/abstracts/search?q=S.%20Sreenivasan"> S. Sreenivasan</a>, <a href="https://publications.waset.org/abstracts/search?q=S.%20Sudhahar"> S. Sudhahar</a>, <a href="https://publications.waset.org/abstracts/search?q=D.%20Suganya"> D. Suganya</a>, <a href="https://publications.waset.org/abstracts/search?q=K.%20S.%20Neelukumari"> K. S. Neelukumari</a>, <a href="https://publications.waset.org/abstracts/search?q=N.%20Vijayarangan"> N. Vijayarangan</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Double Base Number System (DBNS) is an imminent system of representing a number using two bases namely 2 and 3, which has its application in Elliptic Curve Cryptography (ECC) and Digital Signature Algorithm (DSA).The previous binary method representation included only base 2. DBNS uses an approximation algorithm namely, Greedy Algorithm. By using this algorithm, the number of digits required to represent a larger number is less when compared to the standard binary method that uses base 2 algorithms. Hence, the computational speed is increased and time being reduced. The standard binary method uses binary digits 0 and 1 to represent a number whereas the DBNS method uses binary digit 1 alone to represent any number (canonical form). The greedy algorithm uses two ways to represent the number, one is by using only the positive summands and the other is by using both positive and negative summands. In this paper, arithmetic operations are used for elliptic curve cryptography. Elliptic curve discrete logarithm problem is the foundation for most of the day to day elliptic curve cryptography. This appears to be a momentous hard slog compared to digital logarithm problem. In elliptic curve digital signature algorithm, the key generation requires 160 bit of data by usage of standard binary representation. Whereas, the number of bits required generating the key can be reduced with the help of double base number representation. In this paper, a new technique is proposed to generate key during encryption and extraction of key in decryption. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=cryptography" title="cryptography">cryptography</a>, <a href="https://publications.waset.org/abstracts/search?q=double%20base%20number%20system" title=" double base number system"> double base number system</a>, <a href="https://publications.waset.org/abstracts/search?q=elliptic%20curve%20cryptography" title=" elliptic curve cryptography"> elliptic curve cryptography</a>, <a href="https://publications.waset.org/abstracts/search?q=elliptic%20curve%20digital%20signature%20algorithm" title=" elliptic curve digital signature algorithm"> elliptic curve digital signature algorithm</a> </p> <a href="https://publications.waset.org/abstracts/1760/arithmetic-operations-based-on-double-base-number-systems" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/1760.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">396</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=binary%20relevance&page=2">2</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=binary%20relevance&page=3">3</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=binary%20relevance&page=4">4</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=binary%20relevance&page=5">5</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=binary%20relevance&page=6">6</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=binary%20relevance&page=7">7</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=binary%20relevance&page=8">8</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=binary%20relevance&page=9">9</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=binary%20relevance&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=binary%20relevance&page=54">54</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=binary%20relevance&page=55">55</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=binary%20relevance&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>