Conceptual change is a gradual process that occurs as students integrate new information into their existing conceptions. Throughout this process, assessing learning requires measures to diagnose misconceptions and understand how knowledge is changing. We developed three measures of misconceptions to assess students' knowledge early in instruction on decimals that measured the: 1) prevalence of...

In this paper, we propose a novel shape descriptor, called Global Binary Patterns (GBP), based on interpreting intensity values along a direction in an image as binary numbers, converting these binary numbers to their decimal values and concatenating these decimal values as the elements of a vector that is the GBP representation of the shape. Comparing with some widelyused state-of-the-art meth...

We exhibit a numerical technique based on Newton’s method for finding all the roots of Legendre and Chebyshev polynomials, which execute less iterations than the standard Newton’s method and whose results can be compared with those for Chebyshev polynomials roots, for which exists a well known analytical formula. Our algorithm guarantees at least nine decimal correct ciphers in the worst case, ...

The problem of finding the prime factors of large composite numbers is of practical importance since the advent of public key cryptosystems whose security depends on the presumed difficulty of this problem. In recent years the best known integer factorisation algorithms have improved greatly. It is now routine to factor 60-decimal digit numbers, and possible to factor numbers of more than 110 d...

In this paper, the authors propose a new key generation algorithm based on using a binary image. The proposed algorithm converts 16×16 binary array representing the digital image into 4×4 array, then it converts the new generated array into 4×4 decimal array. The decimal array and the left diagonal of the original array are then used to generate the public key that is used to encrypt the data t...

This paper presents the delay of carry save based multiplier of 65nm technology using Field Programmable Gate Array is in enable mode. Here we present a design of floating point multiplication and that can utilize the decimal carry save addition is reduce path delay and dissipation power. The multiplier can stores a less number of multiplicand uses a decimal carry save addition in the portion o...

Algorithms for finding the prime factors of large composite numbers are of practical importance because of the widespread use of public key cryptosystems whose security depends on the presumed difficulty of the factorisation problem. In recent years the limits of the best integer factorisation algorithms have been extended greatly, due in part to Moore’s law and in part to algorithmic improveme...

The RSA-768 (270 decimal digits) was factored by Kleinjung et al. on December 12 2009, and the RSA-704 (212 decimal digits) was factored by Bai et al. on July 2, 2012. And the RSA-200 (663 bits) was factored by Bahr et al. on May 9, 2005. Until right now, there is no body successful to break the RSA210 (696 bits) currently. In this paper, we would discuss an estimation method to approach lower/...