Results 1  10
of
280,613
Decimal to Binary Conversion Procedure
"... Consider a base r number system Radix point separates integer & fractional components Finite set of r symbols called digits Position of digit determines weight of digit A positive number, N, can be written in positional notation as: N = (dn1 dn2 … d1 d0. d1 d2 … dm)r where. = radix point r ..."
Abstract
 Add to MetaCart
Consider a base r number system Radix point separates integer & fractional components Finite set of r symbols called digits Position of digit determines weight of digit A positive number, N, can be written in positional notation as: N = (dn1 dn2 … d1 d0. d1 d2 … dm)r where. = radix point r = radix (base) of number system n = number of integer digits to the left of the radix point m = number of fractional digits to the right of the radix point di = integer digit i, where n1 ≥ i ≥ 0 di = integer digit i, where1 ≥ i ≥m dn1 = most significant digit dm = least significant digit General form as a power series in r
Correctly Rounded BinaryDecimal and DecimalBinary Conversions
 NUMERICAL ANALYSIS MANUSCRIPT 9010, AT&T BELL LABORATORIES
, 1990
"... This note discusses the main issues in performing correctly rounded decimaltobinary and binarytodecimal conversions. It reviews recent work by Clinger and by Steele and White on these conversions and describes some efficiency enhancements. Computational experience with several kinds of arithmeti ..."
Abstract

Cited by 27 (5 self)
 Add to MetaCart
This note discusses the main issues in performing correctly rounded decimaltobinary and binarytodecimal conversions. It reviews recent work by Clinger and by Steele and White on these conversions and describes some efficiency enhancements. Computational experience with several kinds
Efficient binary conversion for Paillier encrypted values
 in Advances in Cryptology – EUROCRYPT, ser. LNCS
"... Abstract. We consider the framework of secure nparty computation based on threshold homomorphic cryptosystems as put forth by Cramer, Damg˚ard, and Nielsen at Eurocrypt 2001. When used with Paillier’s cryptosystem, this framework allows for efficient secure evaluation of any arithmetic circuit defi ..."
Abstract

Cited by 28 (2 self)
 Add to MetaCart
/ℓ compared to the general case. Thus, intermediate computations that rely in an essential way on the binary representations of their input values can be handled without enforcing that the entire computation is done bitwise. Typical examples involve the relational operators such as < and =. As a specific
A program for testing IEEE decimalbinary conversion
, 1991
"... Regardless of how accurately a computer performs floatingpoint operations, if the data to operate on must be initially converted from the decimalbased representation used by humans into the internal representation used by the machine, then errors in that conversion will irrevocably pollute the res ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
Regardless of how accurately a computer performs floatingpoint operations, if the data to operate on must be initially converted from the decimalbased representation used by humans into the internal representation used by the machine, then errors in that conversion will irrevocably pollute
The Capacity of LowDensity ParityCheck Codes Under MessagePassing Decoding
, 2001
"... In this paper, we present a general method for determining the capacity of lowdensity paritycheck (LDPC) codes under messagepassing decoding when used over any binaryinput memoryless channel with discrete or continuous output alphabets. Transmitting at rates below this capacity, a randomly chos ..."
Abstract

Cited by 569 (9 self)
 Add to MetaCart
In this paper, we present a general method for determining the capacity of lowdensity paritycheck (LDPC) codes under messagepassing decoding when used over any binaryinput memoryless channel with discrete or continuous output alphabets. Transmitting at rates below this capacity, a randomly
Good ErrorCorrecting Codes based on Very Sparse Matrices
, 1999
"... We study two families of errorcorrecting codes defined in terms of very sparse matrices. "MN" (MacKayNeal) codes are recently invented, and "Gallager codes" were first investigated in 1962, but appear to have been largely forgotten, in spite of their excellent properties. The ..."
Abstract

Cited by 741 (23 self)
 Add to MetaCart
. The decoding of both codes can be tackled with a practical sumproduct algorithm. We prove that these codes are "very good," in that sequences of codes exist which, when optimally decoded, achieve information rates up to the Shannon limit. This result holds not only for the binarysymmetric channel
The SimpleScalar tool set, version 2.0
 Computer Architecture News
, 1997
"... This report describes release 2.0 of the SimpleScalar tool set, a suite of free, publicly available simulation tools that offer both detailed and highperformance simulation of modern microprocessors. The new release offers more tools and capabilities, precompiled binaries, cleaner interfaces, bette ..."
Abstract

Cited by 1827 (44 self)
 Add to MetaCart
This report describes release 2.0 of the SimpleScalar tool set, a suite of free, publicly available simulation tools that offer both detailed and highperformance simulation of modern microprocessors. The new release offers more tools and capabilities, precompiled binaries, cleaner interfaces
Boosting a Weak Learning Algorithm By Majority
, 1995
"... We present an algorithm for improving the accuracy of algorithms for learning binary concepts. The improvement is achieved by combining a large number of hypotheses, each of which is generated by training the given learning algorithm on a different set of examples. Our algorithm is based on ideas pr ..."
Abstract

Cited by 516 (15 self)
 Add to MetaCart
We present an algorithm for improving the accuracy of algorithms for learning binary concepts. The improvement is achieved by combining a large number of hypotheses, each of which is generated by training the given learning algorithm on a different set of examples. Our algorithm is based on ideas
Computational LambdaCalculus and Monads
, 1988
"... The calculus is considered an useful mathematical tool in the study of programming languages, since programs can be identified with terms. However, if one goes further and uses fijconversion to prove equivalence of programs, then a gross simplification 1 is introduced, that may jeopardise the ..."
Abstract

Cited by 505 (7 self)
 Add to MetaCart
The calculus is considered an useful mathematical tool in the study of programming languages, since programs can be identified with terms. However, if one goes further and uses fijconversion to prove equivalence of programs, then a gross simplification 1 is introduced, that may jeopardise
Dynamic taint analysis for automatic detection, analysis, and signature generation of exploits on commodity software
 In Network and Distributed Systems Security Symposium
, 2005
"... Software vulnerabilities have had a devastating effect on the Internet. Worms such as CodeRed and Slammer can compromise hundreds of thousands of hosts within hours or even minutes, and cause millions of dollars of damage [32, 51]. To successfully combat these fast automatic Internet attacks, we nee ..."
Abstract

Cited by 634 (30 self)
 Add to MetaCart
, and hence works on commodity software. To demonstrate this idea, we have implemented TaintCheck, a mechanism that can perform dynamic taint analysis by performing binary rewriting at run time. We show that TaintCheck reliably detects most types of exploits. We found that TaintCheck produced no false
Results 1  10
of
280,613