Search results for: binary outcomes
Commenced in January 2007
Frequency: Monthly
Edition: International
Paper Count: 3874

Search results for: binary outcomes

3874 Performance Comparison of Non-Binary RA and QC-LDPC Codes

Authors: Ni Wenli, He Jing

Abstract:

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.

Keywords: non-binary RA codes, QC-LDPC codes, performance comparison, BP algorithm

Procedia PDF Downloads 345
3873 Applications of Nonlinear Models to Measure and Predict Thermo Physical Properties of Binary Liquid Mixtures1, 4 Dioxane with Bromo Benzene at Various Temperatures

Authors: R. Ramesh, M. Y. M. Yunus, K. Ramesh

Abstract:

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.

Keywords: 1, 4 dioxane, bromobenzene, density, excess molar volume

Procedia PDF Downloads 382
3872 Teaching the Binary System via Beautiful Facts from the Real Life

Authors: Salem Ben Said

Abstract:

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.

Keywords: binary number system, Nim game, telegraphy, computers prefer the ternary system

Procedia PDF Downloads 148
3871 Hit-Or-Miss Transform as a Tool for Similar Shape Detection

Authors: Osama Mohamed Elrajubi, Idris El-Feghi, Mohamed Abu Baker Saghayer

Abstract:

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.

Keywords: hit-or-miss operator transform, HMT, binary morphological operation, shape detection, binary images processing

Procedia PDF Downloads 291
3870 A Targeted Maximum Likelihood Estimation for a Non-Binary Causal Variable: An Application

Authors: Mohamed Raouf Benmakrelouf, Joseph Rynkiewicz

Abstract:

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.

Keywords: statistical inference, causal inference, super learning, targeted maximum likelihood estimation

Procedia PDF Downloads 65
3869 On the Construction of Some Optimal Binary Linear Codes

Authors: Skezeer John B. Paz, Ederlina G. Nocon

Abstract:

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.

Keywords: bounds of linear codes, Griesmer bound, construction of linear codes, optimal binary linear codes

Procedia PDF Downloads 714
3868 Soret-Driven Convection in a Binary Fluid with Coriolis Force

Authors: N. H. Z. Abidin, N. F. M. Mokhtar, S. S. A. Gani

Abstract:

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.

Keywords: Benard convection, binary fluid, Coriolis, Soret

Procedia PDF Downloads 348
3867 Reconstruction of Binary Matrices Satisfying Neighborhood Constraints by Simulated Annealing

Authors: Divyesh Patel, Tanuja Srivastava

Abstract:

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.

Keywords: discrete tomography, exactly-1-4-adjacency, simulated annealing, binary matrices

Procedia PDF Downloads 371
3866 Theoretical and Experimental Investigations of Binary Systems for Hydrogen Storage

Authors: Gauthier Lefevre, Holger Kohlmann, Sebastien Saitzek, Rachel Desfeux, Adlane Sayede

Abstract:

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.

Keywords: binary systems, evolutionary algorithm, first principles study, pulsed laser deposition

Procedia PDF Downloads 240
3865 Comparative Analysis of Dissimilarity Detection between Binary Images Based on Equivalency and Non-Equivalency of Image Inversion

Authors: Adnan A. Y. Mustafa

Abstract:

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.

Keywords: binary image, dissimilarity detection, probabilistic matching model for binary images, image mapping

Procedia PDF Downloads 114
3864 Quick Similarity Measurement of Binary Images via Probabilistic Pixel Mapping

Authors: Adnan A. Y. Mustafa

Abstract:

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.

Keywords: big images, binary images, image matching, image similarity

Procedia PDF Downloads 156
3863 Motion of an Infinitesimal Particle in Binary Stellar Systems: Kepler-34, Kepler-35, Kepler-16, Kepler-413

Authors: Rajib Mia, Badam Singh Kushvah

Abstract:

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.

Keywords: exoplanetary systems, lagrangian points, periodic orbit, restricted three body problem, stability

Procedia PDF Downloads 397
3862 Approximately Similarity Measurement of Web Sites Using Genetic Algorithms and Binary Trees

Authors: Doru Anastasiu Popescu, Dan Rădulescu

Abstract:

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.

Keywords: Tag, HTML, web page, genetic algorithm, similarity value, binary tree

Procedia PDF Downloads 325
3861 Selection of Power System Variables for Binary-Class Support Vector Machine in Static Security Assessment of Power System

Authors: Jignesh H. Borisagar, Astik K. Dhandhia

Abstract:

Determining the correct decision for the current power system operating scenario is crucial for the operator to ensure a reliable and secure power system. The limitations of traditional power flow frameworks include higher memory requirements and longer computation times. Therefore, it is not a practical solution for applications that require static security assessments in real-time. Additionally, the composite security index was developed to prevent the masking issue resulting from performance indexes based on line loadings and bus voltage deviations for security assessment. As a result, the composite security index has a stronger ability to distinguish between contingency cases involving closer violations. Support vector machines have been used in the solution of the power system static security binary-class classification problem. The performance of the binary-class support vector machine classifier has been shown to be subject to several sets of power system variables. In order to achieve the best feature selections and the lowest rate of misclassification, sequential forward selection has been employed. Two IEEE standard test systems are used to validate the outcomes of the suggested methodology.

Keywords: composite security index, feature selection, static security assessment, support vector machine

Procedia PDF Downloads 8
3860 Pyramid Binary Pattern for Age Invariant Face Verification

Authors: Saroj Bijarnia, Preety Singh

Abstract:

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.

Keywords: biometrics, age invariant, verification, support vector machine

Procedia PDF Downloads 313
3859 Solving the Set Covering Problem Using the Binary Cat Swarm Optimization Metaheuristic

Authors: Broderick Crawford, Ricardo Soto, Natalia Berrios, Eduardo Olguin

Abstract:

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.

Keywords: binary cat swarm optimization, binarization methods, metaheuristic, set covering problem

Procedia PDF Downloads 361
3858 Variable vs. Fixed Window Width Code Correlation Reference Waveform Receivers for Multipath Mitigation in Global Navigation Satellite Systems with Binary Offset Carrier and Multiplexed Binary Offset Carrier Signals

Authors: Fahad Alhussein, Huaping Liu

Abstract:

This paper compares the multipath mitigation performance of code correlation reference waveform receivers with variable and fixed window width, for binary offset carrier and multiplexed binary offset carrier signals typically used in global navigation satellite systems. In the variable window width method, such width is iteratively reduced until the distortion on the discriminator with multipath is eliminated. This distortion is measured as the Euclidean distance between the actual discriminator (obtained with the incoming signal), and the local discriminator (generated with a local copy of the signal). The variable window width have shown better performance compared to the fixed window width. In particular, the former yields zero error for all delays for the BOC and MBOC signals considered, while the latter gives rather large nonzero errors for small delays in all cases. Due to its computational simplicity, the variable window width method is perfectly suitable for implementation in low-cost receivers.

Keywords: correlation reference waveform receivers, binary offset carrier, multiplexed binary offset carrier, global navigation satellite systems

Procedia PDF Downloads 92
3857 Motion of a Dust Grain Type Particle in Binary Stellar Systems

Authors: Rajib Mia, Badam Singh Kushvah

Abstract:

In this present paper, we use the photogravitational version of the restricted three body problem (RTBP) in binary systems. In the photogravitational RTBP, an infinitesimal particle (dust grain) is moving under the gravitational attraction and radiation pressure from the two bigger primaries. The third particle does not affect the motion of two bigger primaries. The zero-velocity curves, zero-velocity surfaces and their projections on the plane are studied. We have used existing analytical method to solve the equations of motion. We have obtained the Lagrangian points in some binary stellar systems. It is found that mass reduction factor affects the Lagrangian points. The linear stability of Lagrangian points is studied and found that these points are unstable. Moreover, trajectories of the infinitesimal particle at the triangular points are studied.

Keywords: binary systems, Lagrangian points, linear stability, photogravitational RTBP, trajectories

Procedia PDF Downloads 224
3856 Durability Study of Binary Blended High Performance Concrete

Authors: Vatsal Patel, Niraj Shah

Abstract:

This paper presents the results of a laboratory study on the properties of binary blended High Performance cementitious systems containing blends of ordinary Portland cement (OPC), Porcelain Powder or Marble Powder blend proportions of 100:00, 95:05, 90:10, 85:15, 80:20 for OPC: Porcelain Powder/Marble Powder. Studies on the Engineering Properties of the cementitious concrete, namely compressive strength, flexural strength, sorptivity, rapid chloride penetration test and accelerated corrosion test have been performed and those of OPC concrete. The results show that the inclusion of Porcelain powder or Marble Powder as binary blended cement alters to a great degree the properties of the binder as well as the resulting concrete. In addition, the results show that the Porcelain powder with 85:15 proportions and Marble powder with 90:10 proportions as binary systems to produce high-performance concrete could potentially be used in the concrete construction industry particular in lowering down the volume of OPC used and lowering emission of CO2 produces during manufacturing of cement.

Keywords: accelerated corrosion, binary blended cementitious system, rapid chloride penetration, sorptivity

Procedia PDF Downloads 360
3855 Densities and Viscosities of Binary Mixture Containing Diethylamine and 2-Alkanol

Authors: Elham jassemi Zargani, Mohammad almasi

Abstract:

Densities and viscosities for binary mixtures of diethylamine + 2 Alkanol (2 propanol up to 2 pentanol) were measured over the entire composition range and temperature interval of 293.15 to 323.15 K. Excess molar volumes V_m^E and viscosity deviations Δη were calculated and correlated by the Redlich−Kister type function to derive the coefficients and estimate the standard error. For mixtures of diethylamine with used 2-alkanols, V_m^E and Δη are negative over the entire range of mole fraction. The observed variations of these parameters, with alkanols chain length and temperature, are discussed in terms of the inter-molecular interactions between the unlike molecules of the binary mixtures.

Keywords: densities, viscosities, diethylamine, 2-alkanol, Redlich-Kister

Procedia PDF Downloads 355
3854 A Study of General Attacks on Elliptic Curve Discrete Logarithm Problem over Prime Field and Binary Field

Authors: Tun Myat Aung, Ni Ni Hla

Abstract:

This paper begins by describing basic properties of finite field and elliptic curve cryptography over prime field and binary field. Then we discuss the discrete logarithm problem for elliptic curves and its properties. We study the general common attacks on elliptic curve discrete logarithm problem such as the Baby Step, Giant Step method, Pollard’s rho method and Pohlig-Hellman method, and describe in detail experiments of these attacks over prime field and binary field. The paper finishes by describing expected running time of the attacks and suggesting strong elliptic curves that are not susceptible to these attacks.c

Keywords: discrete logarithm problem, general attacks, elliptic curve, prime field, binary field

Procedia PDF Downloads 195
3853 About the Case Portfolio Management Algorithms and Their Applications

Authors: M. Chumburidze, N. Salia, T. Namchevadze

Abstract:

This work deal with case processing problems in business. The task of strategic credit requirements management of cases portfolio is discussed. The information model of credit requirements in a binary tree diagram is considered. The algorithms to solve issues of prioritizing clusters of cases in business have been investigated. An implementation of priority queues to support case management operations has been presented. The corresponding pseudo codes for the programming application have been constructed. The tools applied in this development are based on binary tree ordering algorithms, optimization theory, and business management methods.

Keywords: credit network, case portfolio, binary tree, priority queue, stack

Procedia PDF Downloads 84
3852 An Improved Face Recognition Algorithm Using Histogram-Based Features in Spatial and Frequency Domains

Authors: Qiu Chen, Koji Kotani, Feifei Lee, Tadahiro Ohmi

Abstract:

In this paper, we propose an improved face recognition algorithm using histogram-based features in spatial and frequency domains. For adding spatial information of the face to improve recognition performance, a region-division (RD) method is utilized. The facial area is firstly divided into several regions, then feature vectors of each facial part are generated by Binary Vector Quantization (BVQ) histogram using DCT coefficients in low frequency domains, as well as Local Binary Pattern (LBP) histogram in spatial domain. Recognition results with different regions are first obtained separately and then fused by weighted averaging. Publicly available ORL database is used for the evaluation of our proposed algorithm, which is consisted of 40 subjects with 10 images per subject containing variations in lighting, posing, and expressions. It is demonstrated that face recognition using RD method can achieve much higher recognition rate.

Keywords: binary vector quantization (BVQ), DCT coefficients, face recognition, local binary patterns (LBP)

Procedia PDF Downloads 310
3851 Speech Enhancement Using Wavelet Coefficients Masking with Local Binary Patterns

Authors: Christian Arcos, Marley Vellasco, Abraham Alcaim

Abstract:

In this paper, we present a wavelet coefficients masking based on Local Binary Patterns (WLBP) approach to enhance the temporal spectra of the wavelet coefficients for speech enhancement. This technique exploits the wavelet denoising scheme, which splits the degraded speech into pyramidal subband components and extracts frequency information without losing temporal information. Speech enhancement in each high-frequency subband is performed by binary labels through the local binary pattern masking that encodes the ratio between the original value of each coefficient and the values of the neighbour coefficients. This approach enhances the high-frequency spectra of the wavelet transform instead of eliminating them through a threshold. A comparative analysis is carried out with conventional speech enhancement algorithms, demonstrating that the proposed technique achieves significant improvements in terms of PESQ, an international recommendation of objective measure for estimating subjective speech quality. Informal listening tests also show that the proposed method in an acoustic context improves the quality of speech, avoiding the annoying musical noise present in other speech enhancement techniques. Experimental results obtained with a DNN based speech recognizer in noisy environments corroborate the superiority of the proposed scheme in the robust speech recognition scenario.

Keywords: binary labels, local binary patterns, mask, wavelet coefficients, speech enhancement, speech recognition

Procedia PDF Downloads 195
3850 Bullying Rates Among Students with Special Needs in the United States

Authors: Kaycee Bills

Abstract:

Past studies have indicated students who have disabilities are at a higher risk of experiencing bullying victimization in comparison to other student groups. Extracurricular activity participation has been shown to establish better social outcomes for students. These positive social outcomes indirectly decrease the number of times a student is bullied. The following study uses the National Crime Victimization Survey – School Crime Supplement (NCVS/SCS) to analyze the bullying concurrences experienced among students, with disabilities being a focal variable. To explore the relationship between extracurricular involvement and bullying occurrence rates, this study employs a binary logistic regression to determine if athletic and non-athletic extracurricular activities have an impact on the number of times a student with disabilities experiences bullying. Implications for future social welfare practice and research are discussed.

Keywords: disability, bullying, extracurricular activities, athletics

Procedia PDF Downloads 133
3849 Arithmetic Operations Based on Double Base Number Systems

Authors: K. Sanjayani, C. Saraswathy, S. Sreenivasan, S. Sudhahar, D. Suganya, K. S. Neelukumari, N. Vijayarangan

Abstract:

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.

Keywords: cryptography, double base number system, elliptic curve cryptography, elliptic curve digital signature algorithm

Procedia PDF Downloads 362
3848 Differences Choosing Closed Approach or Open Approach in Rhinoplasty Outcomes

Authors: Alessandro Marano

Abstract:

Aim: The author describes a strategy for choosing between two different rhinoplasty approaches for outcomes treatment. Methods: Series of the case study. There are advantages and disadvantages on both approaches for rhinoplasty. On the side of the open approach, we are be able to better manage the techniques for shaping and restoring nasal structures in rhinoplasty outcomes; on the other side, the closed approach requires more practice and experience to achieve good results. Results: Author’s choice is the closed approach on rhinoplasty outcomes. Anyway, the open approach is most commonly preferred due to superior management and better vision on nasal structures. Conclusions: Both approaches are valid for the treatment of rhinoplasty outcomes, author's preferred approach is closed, with minimally invasive modification focused on restoring outcomes in nasal function and aesthetics.

Keywords: rhinoplasty, aesthetic, face, outcomes

Procedia PDF Downloads 77
3847 Biosorption of Cu (II) and Zn (II) from Real Wastewater onto Cajanus cajan Husk

Authors: Mallappa A. Devani, John U. Kennedy Oubagaranadin, Basudeb Munshi

Abstract:

In this preliminary work, locally available husk of Cajanus cajan (commonly known in India as Tur or Arhar), a bio-waste, has been used in its physically treated and chemically activated form for the removal of binary Cu (II) and Zn(II) ions from the real waste water obtained from an electroplating industry in Bangalore, Karnataka, India and from laboratory prepared binary solutions having almost similar composition of the metal ions, for comparison. The real wastewater after filtration and dilution for five times was used for biosorption studies at the normal pH of the solutions at room temperature. Langmuir's binary model was used to calculate the metal uptake capacities of the biosorbents. It was observed that Cu(II) is more competitive than Zn(II) in biosorption. In individual metal biosorption, Cu(II) uptake was found to be more than that of the Zn(II) and a similar trend was observed in the binary metal biosorption from real wastewater and laboratory prepared solutions. FTIR analysis was carried out to identify the functional groups in the industrial wastewater and EDAX for the elemental analysis of the biosorbents after experiments.

Keywords: biosorption, Cajanus cajan, multi metal remediation, wastewater

Procedia PDF Downloads 355
3846 Thermodynamic and Spectroscopic Investigation of Binary 2,2-Dimethyl-1-Propanol+ CO₂ Gas Hydrates

Authors: Seokyoon Moon, Yun-Ho Ahn, Heejoong Kim, Sujin Hong, Yunseok Lee, Youngjune Park

Abstract:

Gas hydrate is a non-stoichiometric crystalline compound consisting of host water-framework and low molecular weight guest molecules. Small gaseous molecules such as CH₄, CO₂, and N₂ can be captured in the host water framework lattices of the gas hydrate with specific temperature and pressure conditions. The three well-known crystal structures of structure I (sI), structure II (sII), and structure H (sH) are determined by the size and shape of guest molecules. In this study, we measured the phase equilibria of binary (2,2-dimethyl-1-propanol + CO₂, CH₄, N₂) hydrates to explore their fundamental thermodynamic characteristics. We identified the structure of the binary gas hydrate by employing synchrotron high-resolution powder diffraction (HRPD), and the guest distributions in the lattice of gas hydrate were investigated via dispersive Raman and ¹³C solid-state nuclear magnetic resonance (NMR) spectroscopies. The end-to-end distance of 2,2-dimethyl-1-propanol was calculated to be 7.76 Å, which seems difficult to be enclathrated in large cages of sI or sII. However, due to the flexibility of the host water framework, binary hydrates of sI or sII types can be formed with the help of small gas molecule. Also, the synchrotron HRPD patterns revealed that the binary hydrate structure highly depends on the type of help gases; a cubic Fd3m sII hydrate was formed with CH₄ or N₂, and a cubic Pm3n sI hydrate was formed with CO₂. Interestingly, dispersive Raman and ¹³C NMR spectra showed that the unique tuning phenomenon occurred in binary (2,2-dimethyl-1-propanol + CO₂) hydrate. By optimizing the composition of NPA, we can achieve both thermodynamic stability and high CO₂ storage capacity for the practical application to CO₂ capture.

Keywords: clathrate, gas hydrate, neopentyl alcohol, CO₂, tuning phenomenon

Procedia PDF Downloads 209
3845 Contourlet Transform and Local Binary Pattern Based Feature Extraction for Bleeding Detection in Endoscopic Images

Authors: Mekha Mathew, Varun P Gopi

Abstract:

Wireless Capsule Endoscopy (WCE) has become a great device in Gastrointestinal (GI) tract diagnosis, which can examine the entire GI tract, especially the small intestine without invasiveness and sedation. Bleeding in the digestive tract is a symptom of a disease rather than a disease itself. Hence the detection of bleeding is important in diagnosing many diseases. In this paper we proposes a novel method for distinguishing bleeding regions from normal regions based on Contourlet transform and Local Binary Pattern (LBP). Experiments show that this method provides a high accuracy rate of 96.38% in CIE XYZ colour space for k-Nearest Neighbour (k-NN) classifier.

Keywords: Wireless Capsule Endoscopy, local binary pattern, k-NN classifier, contourlet transform

Procedia PDF Downloads 458