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: ecological binary data</title> <meta name="description" content="Search results for: ecological binary data"> <meta name="keywords" content="ecological binary data"> <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="ecological binary data" 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="ecological binary data"> <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> 26442</div> </div> </div> </div> <h1 class="mt-3 mb-3 text-center" style="font-size:1.6rem;">Search results for: ecological binary data</h1> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">26442</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">26441</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">26440</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">26439</span> Robustified Asymmetric Logistic Regression Model for Global Fish Stock Assessment</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Osamu%20Komori">Osamu Komori</a>, <a href="https://publications.waset.org/abstracts/search?q=Shinto%20Eguchi"> Shinto Eguchi</a>, <a href="https://publications.waset.org/abstracts/search?q=Hiroshi%20Okamura"> Hiroshi Okamura</a>, <a href="https://publications.waset.org/abstracts/search?q=Momoko%20Ichinokawa"> Momoko Ichinokawa</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The long time-series data on population assessments are essential for global ecosystem assessment because the temporal change of biomass in such a database reflects the status of global ecosystem properly. However, the available assessment data usually have limited sample sizes and the ratio of populations with low abundance of biomass (collapsed) to those with high abundance (non-collapsed) is highly imbalanced. To allow for the imbalance and uncertainty involved in the ecological data, we propose a binary regression model with mixed effects for inferring ecosystem status through an asymmetric logistic model. In the estimation equation, we observe that the weights for the non-collapsed populations are relatively reduced, which in turn puts more importance on the small number of observations of collapsed populations. Moreover, we extend the asymmetric logistic regression model using propensity score to allow for the sample biases observed in the labeled and unlabeled datasets. It robustified the estimation procedure and improved the model fitting. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=double%20robust%20estimation" title="double robust estimation">double robust estimation</a>, <a href="https://publications.waset.org/abstracts/search?q=ecological%20binary%20data" title=" ecological binary data"> ecological binary data</a>, <a href="https://publications.waset.org/abstracts/search?q=mixed%20effect%20logistic%20regression%20model" title=" mixed effect logistic regression model"> mixed effect logistic regression model</a>, <a href="https://publications.waset.org/abstracts/search?q=propensity%20score" title=" propensity score"> propensity score</a> </p> <a href="https://publications.waset.org/abstracts/65277/robustified-asymmetric-logistic-regression-model-for-global-fish-stock-assessment" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/65277.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">266</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">26438</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">26437</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">26436</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">26435</span> Agglomerative Hierarchical Clustering Using the Tθ Family of Similarity Measures</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Salima%20Kouici">Salima Kouici</a>, <a href="https://publications.waset.org/abstracts/search?q=Abdelkader%20Khelladi"> Abdelkader Khelladi</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this work, we begin with the presentation of the Tθ family of usual similarity measures concerning multidimensional binary data. Subsequently, some properties of these measures are proposed. Finally, the impact of the use of different inter-elements measures on the results of the Agglomerative Hierarchical Clustering Methods is studied. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=binary%20data" title="binary data">binary data</a>, <a href="https://publications.waset.org/abstracts/search?q=similarity%20measure" title=" similarity measure"> similarity measure</a>, <a href="https://publications.waset.org/abstracts/search?q=T%CE%B8%20measures" title=" Tθ measures"> Tθ measures</a>, <a href="https://publications.waset.org/abstracts/search?q=agglomerative%20hierarchical%20clustering" title=" agglomerative hierarchical clustering"> agglomerative hierarchical clustering</a> </p> <a href="https://publications.waset.org/abstracts/13108/agglomerative-hierarchical-clustering-using-the-tth-family-of-similarity-measures" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/13108.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">481</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">26434</span> Applications of Nonlinear Models to Measure and Predict Thermo Physical Properties of Binary Liquid Mixtures1, 4 Dioxane with Bromo Benzene at Various Temperatures</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=R.%20Ramesh">R. Ramesh</a>, <a href="https://publications.waset.org/abstracts/search?q=M.%20Y.%20M.%20Yunus"> M. Y. M. Yunus</a>, <a href="https://publications.waset.org/abstracts/search?q=K.%20Ramesh"> K. Ramesh</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The study conducted in this research are Viscosities, η, and Densities ,ρ, of 1, 4-dioxane with Bromobenzene at different mole fractions and various temperatures in the atmospheric pressure condition. From experimentations excess volumes, VE, and deviations in viscosities, Δη, of mixtures at infinite dilutions have been obtained. The measured systems exhibited positive values of VmE and negative values of Δη. The binary mixture 1, 4 dioxane + Bromobenzene show positive VE and negative Δη with increasing temperatures. The outcomes clearly indicate that weak interactions present in mixture. It is mainly because of number and position of methyl groups exist in these aromatic hydrocarbons. These measured data tailored to the nonlinear models to derive the binary coefficients. Standard deviations have been considered between the fitted outcomes and the calculated data is helpful deliberate mixing behavior of the binary mixtures. It can conclude that in our cases, the data found with the values correlated by the corresponding models very well. The molecular interactions existing between the components and comparison of liquid mixtures were also discussed. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=1" title="1">1</a>, <a href="https://publications.waset.org/abstracts/search?q=4%20dioxane" title="4 dioxane">4 dioxane</a>, <a href="https://publications.waset.org/abstracts/search?q=bromobenzene" title=" bromobenzene"> bromobenzene</a>, <a href="https://publications.waset.org/abstracts/search?q=density" title=" density"> density</a>, <a href="https://publications.waset.org/abstracts/search?q=excess%20molar%20volume" title=" excess molar volume"> excess molar volume</a> </p> <a href="https://publications.waset.org/abstracts/30810/applications-of-nonlinear-models-to-measure-and-predict-thermo-physical-properties-of-binary-liquid-mixtures1-4-dioxane-with-bromo-benzene-at-various-temperatures" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/30810.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">412</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">26433</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">26432</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">26431</span> Refractive Index, Excess Molar Volume and Viscometric Study of Binary Liquid Mixture of Morpholine with Cumene at 298.15 K, 303.15 K, and 308.15 K</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=B.%20K.%20Gill">B. K. Gill</a>, <a href="https://publications.waset.org/abstracts/search?q=Himani%20Sharma"> Himani Sharma</a>, <a href="https://publications.waset.org/abstracts/search?q=V.%20K.%20Rattan"> V. K. Rattan</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Experimental data of refractive index, excess molar volume and viscosity of binary mixture of morpholine with cumene over the whole composition range at 298.15 K, 303.15 K, 308.15 K and normal atmospheric pressure have been measured. The experimental data were used to compute the density, deviation in molar refraction, deviation in viscosity and excess Gibbs free energy of activation as a function of composition. The experimental viscosity data have been correlated with empirical equations like Grunberg- Nissan, Herric correlation and three body McAllister’s equation. The excess thermodynamic properties were fitted to Redlich-Kister polynomial equation. The variation of these properties with composition and temperature of the binary mixtures are discussed in terms of intermolecular interactions. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=cumene" title="cumene">cumene</a>, <a href="https://publications.waset.org/abstracts/search?q=excess%20Gibbs%20free%20energy" title=" excess Gibbs free energy"> excess Gibbs free energy</a>, <a href="https://publications.waset.org/abstracts/search?q=excess%20molar%20volume" title=" excess molar volume"> excess molar volume</a>, <a href="https://publications.waset.org/abstracts/search?q=morpholine" title=" morpholine"> morpholine</a> </p> <a href="https://publications.waset.org/abstracts/46022/refractive-index-excess-molar-volume-and-viscometric-study-of-binary-liquid-mixture-of-morpholine-with-cumene-at-29815-k-30315-k-and-30815-k" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/46022.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">329</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">26430</span> Parameter Interactions in the Cumulative Prospect Theory: Fitting the Binary Choice Experiment Data</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Elzbieta%20Babula">Elzbieta Babula</a>, <a href="https://publications.waset.org/abstracts/search?q=Juhyun%20Park"> Juhyun Park</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Tversky and Kahneman’s cumulative prospect theory assumes symmetric probability cumulation with regard to the reference point within decision weights. Theoretically, this model should be invariant under the change of the direction of probability cumulation. In the present study, this phenomenon is being investigated by creating a reference model that allows verifying the parameter interactions in the cumulative prospect theory specifications. The simultaneous parametric fitting of utility and weighting functions is applied to binary choice data from the experiment. The results show that the flexibility of the probability weighting function is a crucial characteristic allowing to prevent parameter interactions while estimating cumulative prospect theory. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=binary%20choice%20experiment" title="binary choice experiment">binary choice experiment</a>, <a href="https://publications.waset.org/abstracts/search?q=cumulative%20prospect%20theory" title=" cumulative prospect theory"> cumulative prospect theory</a>, <a href="https://publications.waset.org/abstracts/search?q=decision%20weights" title=" decision weights"> decision weights</a>, <a href="https://publications.waset.org/abstracts/search?q=parameter%20interactions" title=" parameter interactions"> parameter interactions</a> </p> <a href="https://publications.waset.org/abstracts/139527/parameter-interactions-in-the-cumulative-prospect-theory-fitting-the-binary-choice-experiment-data" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/139527.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">215</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">26429</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">26428</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">26427</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">26426</span> A Targeted Maximum Likelihood Estimation for a Non-Binary Causal Variable: An Application</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Mohamed%20Raouf%20Benmakrelouf">Mohamed Raouf Benmakrelouf</a>, <a href="https://publications.waset.org/abstracts/search?q=Joseph%20Rynkiewicz"> Joseph Rynkiewicz</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Targeted maximum likelihood estimation (TMLE) is well-established method for causal effect estimation with desirable statistical properties. TMLE is a doubly robust maximum likelihood based approach that includes a secondary targeting step that optimizes the target statistical parameter. A causal interpretation of the statistical parameter requires assumptions of the Rubin causal framework. The causal effect of binary variable, E, on outcomes, Y, is defined in terms of comparisons between two potential outcomes as E[YE=1 − YE=0]. Our aim in this paper is to present an adaptation of TMLE methodology to estimate the causal effect of a non-binary categorical variable, providing a large application. We propose coding on the initial data in order to operate a binarization of the interest variable. For each category, we get a transformation of the non-binary interest variable into a binary variable, taking value 1 to indicate the presence of category (or group of categories) for an individual, 0 otherwise. Such a dummy variable makes it possible to have a pair of potential outcomes and oppose a category (or a group of categories) to another category (or a group of categories). Let E be a non-binary interest variable. We propose a complete disjunctive coding of our variable E. We transform the initial variable to obtain a set of binary vectors (dummy variables), E = (Ee : e ∈ {1, ..., |E|}), where each vector (variable), Ee, takes the value of 0 when its category is not present, and the value of 1 when its category is present, which allows to compute a pairwise-TMLE comparing difference in the outcome between one category and all remaining categories. In order to illustrate the application of our strategy, first, we present the implementation of TMLE to estimate the causal effect of non-binary variable on outcome using simulated data. Secondly, we apply our TMLE adaptation to survey data from the French Political Barometer (CEVIPOF), to estimate the causal effect of education level (A five-level variable) on a potential vote in favor of the French extreme right candidate Jean-Marie Le Pen. Counterfactual reasoning requires us to consider some causal questions (additional causal assumptions). Leading to different coding of E, as a set of binary vectors, E = (Ee : e ∈ {2, ..., |E|}), where each vector (variable), Ee, takes the value of 0 when the first category (reference category) is present, and the value of 1 when its category is present, which allows to apply a pairwise-TMLE comparing difference in the outcome between the first level (fixed) and each remaining level. We confirmed that the increase in the level of education decreases the voting rate for the extreme right party. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=statistical%20inference" title="statistical inference">statistical inference</a>, <a href="https://publications.waset.org/abstracts/search?q=causal%20inference" title=" causal inference"> causal inference</a>, <a href="https://publications.waset.org/abstracts/search?q=super%20learning" title=" super learning"> super learning</a>, <a href="https://publications.waset.org/abstracts/search?q=targeted%20maximum%20likelihood%20estimation" title=" targeted maximum likelihood estimation"> targeted maximum likelihood estimation</a> </p> <a href="https://publications.waset.org/abstracts/147591/a-targeted-maximum-likelihood-estimation-for-a-non-binary-causal-variable-an-application" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/147591.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">103</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">26425</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> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">26424</span> Densities and Volumetric Properties of {Difurylmethane + [(C5 – C8) N-Alkane or an Amide]} Binary Systems at 293.15, 298.15 and 303.15 K: Modelling Excess Molar Volumes by Prigogine-Flory-Patterson Theory</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Belcher%20Fulele">Belcher Fulele</a>, <a href="https://publications.waset.org/abstracts/search?q=W.%20A.%20A.%20Ddamba"> W. A. A. Ddamba</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Study of solvent systems contributes to the understanding of intermolecular interactions that occur in binary mixtures. These interactions involves among others strong dipole-dipole interactions and weak van de Waals interactions which are of significant application in pharmaceuticals, solvent extractions, design of reactors and solvent handling and storage processes. Binary mixtures of solvents can thus be used as a model to interpret thermodynamic behavior that occur in a real solution mixture. Densities of pure DFM, n-alkanes (n-pentane, n-hexane, n-heptane and n-octane) and amides (N-methylformamide, N-ethylformamide, N,N-dimethylformamide and N,N-dimethylacetamide) as well as their [DFM + ((C5-C8) n-alkane or amide)] binary mixtures over the entire composition range, have been reported at temperature 293.15, 298.15 and 303.15 K and atmospheric pressure. These data has been used to derive the thermodynamic properties: the excess molar volume of solution, apparent molar volumes, excess partial molar volumes, limiting excess partial molar volumes, limiting partial molar volumes of each component of a binary mixture. The results are discussed in terms of possible intermolecular interactions and structural effects that occur in the binary mixtures. The variation of excess molar volume with DFM composition for the [DFM + (C5-C7) n-alkane] binary mixture exhibit a sigmoidal behavior while for the [DFM + n-octane] binary system, positive deviation of excess molar volume function was observed over the entire composition range. For each of the [DFM + (C5-C8) n-alkane] binary mixture, the excess molar volume exhibited a fall with increase in temperature. The excess molar volume for each of [DFM + (NMF or NEF or DMF or DMA)] binary system was negative over the entire DFM composition at each of the three temperatures investigated. The negative deviations in excess molar volume values follow the order: DMA > DMF > NEF > NMF. Increase in temperature has a greater effect on component self-association than it has on complex formation between molecules of components in [DFM + (NMF or NEF or DMF or DMA)] binary mixture which shifts complex formation equilibrium towards complex to give a drop in excess molar volume with increase in temperature. The Prigogine-Flory-Patterson model has been applied at 298.15 K and reveals that the free volume is the most important contributing term to the excess experimental molar volume data for [DFM + (n-pentane or n-octane)] binary system. For [DFM + (NMF or DMF or DMA)] binary mixture, the interactional term and characteristic pressure term contributions are the most important contributing terms in describing the sign of experimental excess molar volume. The mixture systems contributed to the understanding of interactions of polar solvents with proteins (amides) with non-polar solvents (alkanes) in biological systems. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=alkanes" title="alkanes">alkanes</a>, <a href="https://publications.waset.org/abstracts/search?q=amides" title=" amides"> amides</a>, <a href="https://publications.waset.org/abstracts/search?q=excess%20thermodynamic%20parameters" title=" excess thermodynamic parameters"> excess thermodynamic parameters</a>, <a href="https://publications.waset.org/abstracts/search?q=Prigogine-Flory-Patterson%20model" title=" Prigogine-Flory-Patterson model"> Prigogine-Flory-Patterson model</a> </p> <a href="https://publications.waset.org/abstracts/40809/densities-and-volumetric-properties-of-difurylmethane-c5-c8-n-alkane-or-an-amide-binary-systems-at-29315-29815-and-30315-k-modelling-excess-molar-volumes-by-prigogine-flory-patterson-theory" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/40809.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">26423</span> Experimental Evaluation of Succinct Ternary Tree</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Dmitriy%20Kuptsov">Dmitriy Kuptsov</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Tree data structures, such as binary or in general k-ary trees, are essential in computer science. The applications of these data structures can range from data search and retrieval to sorting and ranking algorithms. Naive implementations of these data structures can consume prohibitively large volumes of random access memory limiting their applicability in certain solutions. Thus, in these cases, more advanced representation of these data structures is essential. In this paper we present the design of the compact version of ternary tree data structure and demonstrate the results for the experimental evaluation using static dictionary problem. We compare these results with the results for binary and regular ternary trees. The conducted evaluation study shows that our design, in the best case, consumes up to 12 times less memory (for the dictionary used in our experimental evaluation) than a regular ternary tree and in certain configuration shows performance comparable to regular ternary trees. We have evaluated the performance of the algorithms using both 32 and 64 bit operating systems. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=algorithms" title="algorithms">algorithms</a>, <a href="https://publications.waset.org/abstracts/search?q=data%20structures" title="data structures">data structures</a>, <a href="https://publications.waset.org/abstracts/search?q=succinct%20ternary%20tree" title="succinct ternary tree">succinct ternary tree</a>, <a href="https://publications.waset.org/abstracts/search?q=per-%20formance%20evaluation" title="per- formance evaluation">per- formance evaluation</a> </p> <a href="https://publications.waset.org/abstracts/144336/experimental-evaluation-of-succinct-ternary-tree" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/144336.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">160</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">26422</span> A Picture is worth a Billion Bits: Real-Time Image Reconstruction from Dense Binary Pixels</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Tal%20Remez">Tal Remez</a>, <a href="https://publications.waset.org/abstracts/search?q=Or%20Litany"> Or Litany</a>, <a href="https://publications.waset.org/abstracts/search?q=Alex%20Bronstein"> Alex Bronstein</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The pursuit of smaller pixel sizes at ever increasing resolution in digital image sensors is mainly driven by the stringent price and form-factor requirements of sensors and optics in the cellular phone market. Recently, Eric Fossum proposed a novel concept of an image sensor with dense sub-diffraction limit one-bit pixels (jots), which can be considered a digital emulation of silver halide photographic film. This idea has been recently embodied as the EPFL Gigavision camera. A major bottleneck in the design of such sensors is the image reconstruction process, producing a continuous high dynamic range image from oversampled binary measurements. The extreme quantization of the Poisson statistics is incompatible with the assumptions of most standard image processing and enhancement frameworks. The recently proposed maximum-likelihood (ML) approach addresses this difficulty, but suffers from image artifacts and has impractically high computational complexity. In this work, we study a variant of a sensor with binary threshold pixels and propose a reconstruction algorithm combining an ML data fitting term with a sparse synthesis prior. We also show an efficient hardware-friendly real-time approximation of this inverse operator. Promising results are shown on synthetic data as well as on HDR data emulated using multiple exposures of a regular CMOS sensor. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=binary%20pixels" title="binary pixels">binary pixels</a>, <a href="https://publications.waset.org/abstracts/search?q=maximum%20likelihood" title=" maximum likelihood"> maximum likelihood</a>, <a href="https://publications.waset.org/abstracts/search?q=neural%20networks" title=" neural networks"> neural networks</a>, <a href="https://publications.waset.org/abstracts/search?q=sparse%20coding" title=" sparse coding"> sparse coding</a> </p> <a href="https://publications.waset.org/abstracts/38705/a-picture-is-worth-a-billion-bits-real-time-image-reconstruction-from-dense-binary-pixels" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/38705.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">201</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">26421</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">26420</span> A Physical Theory of Information vs. a Mathematical Theory of Communication</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Manouchehr%20Amiri">Manouchehr Amiri</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This article introduces a general notion of physical bit information that is compatible with the basics of quantum mechanics and incorporates the Shannon entropy as a special case. This notion of physical information leads to the Binary data matrix model (BDM), which predicts the basic results of quantum mechanics, general relativity, and black hole thermodynamics. The compatibility of the model with holographic, information conservation, and Landauer’s principles are investigated. After deriving the “Bit Information principle” as a consequence of BDM, the fundamental equations of Planck, De Broglie, Beckenstein, and mass-energy equivalence are derived. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=physical%20theory%20of%20information" title="physical theory of information">physical theory of information</a>, <a href="https://publications.waset.org/abstracts/search?q=binary%20data%20matrix%20model" title=" binary data matrix model"> binary data matrix model</a>, <a href="https://publications.waset.org/abstracts/search?q=Shannon%20information%20theory" title=" Shannon information theory"> Shannon information theory</a>, <a href="https://publications.waset.org/abstracts/search?q=bit%20information%20principle" title=" bit information principle"> bit information principle</a> </p> <a href="https://publications.waset.org/abstracts/166010/a-physical-theory-of-information-vs-a-mathematical-theory-of-communication" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/166010.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">171</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">26419</span> EnumTree: An Enumerative Biclustering Algorithm for DNA Microarray Data</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Haifa%20Ben%20Saber">Haifa Ben Saber</a>, <a href="https://publications.waset.org/abstracts/search?q=Mourad%20Elloumi"> Mourad Elloumi</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In a number of domains, like in DNA microarray data analysis, we need to cluster simultaneously rows (genes) and columns (conditions) of a data matrix to identify groups of constant rows with a group of columns. This kind of clustering is called biclustering. Biclustering algorithms are extensively used in DNA microarray data analysis. More effective biclustering algorithms are highly desirable and needed. We introduce a new algorithm called, Enumerative tree (EnumTree) for biclustering of binary microarray data. is an algorithm adopting the approach of enumerating biclusters. This algorithm extracts all biclusters consistent good quality. The main idea of EnumLat is the construction of a new tree structure to represent adequately different biclusters discovered during the process of enumeration. This algorithm adopts the strategy of all biclusters at a time. The performance of the proposed algorithm is assessed using both synthetic and real DNA micryarray data, our algorithm outperforms other biclustering algorithms for binary microarray data. Biclusters with different numbers of rows. Moreover, we test the biological significance using a gene annotation web tool to show that our proposed method is able to produce biologically relevent biclusters. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=DNA%20microarray" title="DNA microarray">DNA microarray</a>, <a href="https://publications.waset.org/abstracts/search?q=biclustering" title=" biclustering"> biclustering</a>, <a href="https://publications.waset.org/abstracts/search?q=gene%20expression%20data" title=" gene expression data"> gene expression data</a>, <a href="https://publications.waset.org/abstracts/search?q=tree" title=" tree"> tree</a>, <a href="https://publications.waset.org/abstracts/search?q=datamining." title=" datamining."> datamining.</a> </p> <a href="https://publications.waset.org/abstracts/32185/enumtree-an-enumerative-biclustering-algorithm-for-dna-microarray-data" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/32185.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">372</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">26418</span> Change Point Analysis in Average Ozone Layer Temperature Using Exponential Lomax Distribution</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Amjad%20Abdullah">Amjad Abdullah</a>, <a href="https://publications.waset.org/abstracts/search?q=Amjad%20Yahya"> Amjad Yahya</a>, <a href="https://publications.waset.org/abstracts/search?q=Bushra%20Aljohani"> Bushra Aljohani</a>, <a href="https://publications.waset.org/abstracts/search?q=Amani%20Alghamdi"> Amani Alghamdi</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Change point detection is an important part of data analysis. The presence of a change point refers to a significant change in the behavior of a time series. In this article, we examine the detection of multiple change points of parameters of the exponential Lomax distribution, which is broad and flexible compared with other distributions while fitting data. We used the Schwarz information criterion and binary segmentation to detect multiple change points in publicly available data on the average temperature in the ozone layer. The change points were successfully located. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=binary%20segmentation" title="binary segmentation">binary segmentation</a>, <a href="https://publications.waset.org/abstracts/search?q=change%20point" title=" change point"> change point</a>, <a href="https://publications.waset.org/abstracts/search?q=exponentialLomax%20%20distribution" title=" exponentialLomax distribution"> exponentialLomax distribution</a>, <a href="https://publications.waset.org/abstracts/search?q=information%20%20criterion" title=" information criterion"> information criterion</a> </p> <a href="https://publications.waset.org/abstracts/145911/change-point-analysis-in-average-ozone-layer-temperature-using-exponential-lomax-distribution" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/145911.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">175</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">26417</span> Thermodynamic Behaviour of Binary Mixtures of 1, 2-Dichloroethane with Some Cyclic Ethers: Experimental Results and Modelling</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Fouzia%20Amireche-Ziar">Fouzia Amireche-Ziar</a>, <a href="https://publications.waset.org/abstracts/search?q=Ilham%20Mokbel"> Ilham Mokbel</a>, <a href="https://publications.waset.org/abstracts/search?q=Jacques%20Jose"> Jacques Jose</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The vapour pressures of the three binary mixtures: 1, 2- dichloroethane + 1,3-dioxolane, + 1,4-dioxane or + tetrahydropyrane, are carried out at ten temperatures ranging from 273 to 353.15 K. An accurate static device was employed for these measurements. The VLE data were reduced using the Redlich-Kister equation by taking into consideration the vapour pressure non-ideality in terms of the second molar virial coefficient. The experimental data were compared to the results predicted with the DISQUAC and Dortmund UNIFAC group contribution models for the total pressures P and the excess molar Gibbs energies GE. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=disquac%20model" title="disquac model">disquac model</a>, <a href="https://publications.waset.org/abstracts/search?q=dortmund%20UNIFAC%20model" title=" dortmund UNIFAC model"> dortmund UNIFAC model</a>, <a href="https://publications.waset.org/abstracts/search?q=excess%20molar%20Gibbs%20energies%20GE" title=" excess molar Gibbs energies GE"> excess molar Gibbs energies GE</a>, <a href="https://publications.waset.org/abstracts/search?q=VLE" title=" VLE"> VLE</a> </p> <a href="https://publications.waset.org/abstracts/49663/thermodynamic-behaviour-of-binary-mixtures-of-1-2-dichloroethane-with-some-cyclic-ethers-experimental-results-and-modelling" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/49663.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">258</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">26416</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">26415</span> Isothermal Vapour-Liquid Equilibria of Binary Mixtures of 1, 2-Dichloroethane with Some Cyclic Ethers: Experimental Results and Modelling</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Fouzia%20Amireche-Ziar">Fouzia Amireche-Ziar</a>, <a href="https://publications.waset.org/abstracts/search?q=Ilham%20Mokbel"> Ilham Mokbel</a>, <a href="https://publications.waset.org/abstracts/search?q=Jacques%20Jose"> Jacques Jose</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The vapour pressures of the three binary mixtures: 1, 2- dichloroethane + 1,3-dioxolane, + 1,4-dioxane or + tetrahydropyrane, are carried out at ten temperatures ranging from 273 to 353.15 K. An accurate static device was employed for these measurements. The VLE data were reduced using the Redlich-Kister equation by taking into consideration the vapour pressure non-ideality in terms of the second molar virial coefficient. The experimental data were compared to the results predicted with the DISQUAC and Dortmund UNIFAC group contribution models for the total pressures P and the excess molar Gibbs energies GE. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=disquac%20model" title="disquac model">disquac model</a>, <a href="https://publications.waset.org/abstracts/search?q=dortmund%20UNIFAC%20model" title=" dortmund UNIFAC model"> dortmund UNIFAC model</a>, <a href="https://publications.waset.org/abstracts/search?q=excess%20molar%20Gibbs%20energies%20GE" title=" excess molar Gibbs energies GE"> excess molar Gibbs energies GE</a>, <a href="https://publications.waset.org/abstracts/search?q=VLE" title=" VLE"> VLE</a> </p> <a href="https://publications.waset.org/abstracts/43334/isothermal-vapour-liquid-equilibria-of-binary-mixtures-of-1-2-dichloroethane-with-some-cyclic-ethers-experimental-results-and-modelling" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/43334.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">228</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">26414</span> Hardware Implementation of Local Binary Pattern Based Two-Bit Transform Motion Estimation </h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Seda%20Yavuz">Seda Yavuz</a>, <a href="https://publications.waset.org/abstracts/search?q=An%C4%B1l%20%C3%87elebi"> Anıl Çelebi</a>, <a href="https://publications.waset.org/abstracts/search?q=Aysun%20Ta%C5%9Fyap%C4%B1%20%C3%87elebi"> Aysun Taşyapı Çelebi</a>, <a href="https://publications.waset.org/abstracts/search?q=O%C4%9Fuzhan%20Urhan"> Oğuzhan Urhan</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Nowadays, demand for using real-time video transmission capable devices is ever-increasing. So, high resolution videos have made efficient video compression techniques an essential component for capturing and transmitting video data. Motion estimation has a critical role in encoding raw video. Hence, various motion estimation methods are introduced to efficiently compress the video. Low bit‑depth representation based motion estimation methods facilitate computation of matching criteria and thus, provide small hardware footprint. In this paper, a hardware implementation of a two-bit transformation based low-complexity motion estimation method using local binary pattern approach is proposed. Image frames are represented in two-bit depth instead of full-depth by making use of the local binary pattern as a binarization approach and the binarization part of the hardware architecture is explained in detail. Experimental results demonstrate the difference between the proposed hardware architecture and the architectures of well-known low-complexity motion estimation methods in terms of important aspects such as resource utilization, energy and power consumption. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=binarization" title="binarization">binarization</a>, <a href="https://publications.waset.org/abstracts/search?q=hardware%20architecture" title=" hardware architecture"> hardware architecture</a>, <a href="https://publications.waset.org/abstracts/search?q=local%20binary%20pattern" title=" local binary pattern"> local binary pattern</a>, <a href="https://publications.waset.org/abstracts/search?q=motion%20estimation" title=" motion estimation"> motion estimation</a>, <a href="https://publications.waset.org/abstracts/search?q=two-bit%20transform" title=" two-bit transform"> two-bit transform</a> </p> <a href="https://publications.waset.org/abstracts/77730/hardware-implementation-of-local-binary-pattern-based-two-bit-transform-motion-estimation" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/77730.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">311</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">26413</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> <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=ecological%20binary%20data&page=2">2</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=ecological%20binary%20data&page=3">3</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=ecological%20binary%20data&page=4">4</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=ecological%20binary%20data&page=5">5</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=ecological%20binary%20data&page=6">6</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=ecological%20binary%20data&page=7">7</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=ecological%20binary%20data&page=8">8</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=ecological%20binary%20data&page=9">9</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=ecological%20binary%20data&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=ecological%20binary%20data&page=881">881</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=ecological%20binary%20data&page=882">882</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=ecological%20binary%20data&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>