The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
Journal of Philosophy of Education
Debate about teacher-proof materials and the problem of teaching to tests has a venerable history, and in many ways it is depressing that it is necessary Once more to revisit the arguments. ... He requires a range of estimation skills, and a sense of which arithmetical operation to apply to a given practical problem. ...
I will introduce a semi-formalism to allow us to conceptually reason about the differences between customised arithmetic design, as one might see in FPGAbased compute, and general purpose arithmetic, as ... I will then provide a concrete example from the literature on matrix computation where some careful algorithmic tweaking results in the ability to use fixed-point arithmetic and, hence, far higher performance ... This code is typically implemented using floatingpoint arithmetic, because the dynamic range of the variables involved can be significant and is data dependent. ...doi:10.1109/arith.2017.17 dblp:conf/arith/Constantinides17 fatcat:f3ujrv3jjjcujlzr7bvfoudqje
We study the effect of an optimizing algorithm for straight-line code which first constructs a directed acyclic graph representing the given program and then generates code from it. ... We show that this algorithm produces optimal code with respect to the classical transformations known as Constant Folding, Common Subexpression Elimination, and Dead Code Elimination. ... Optimality in general is only decidable for a small subclass of operations, such as the arithmetics on the integers without division  . ...dblp:journals/stt/NollR06 fatcat:p5y5yq3effcvtb4wrl7yfb2ho4
As well as this, comparison is made to analyze effects of enabling and disabling the pre-processing output to the Entropy Coding block. ... First, we aim to review and analyze the performance of the IEEE 1857.2 standard, focusing is on the Golomb-Rice and Arithmetic entropy algorithms as well as the effect of the pre-processing block on these ... Then, in section 4, we will divide into 4 subsections, were we will detail components of the IEEE1857.2, by revisiting the pre-processing block cocept, entropy selection, Golomb-Rice encoding, and arithmetic ...doi:10.11591/ijeecs.v10.i1.pp176-183 fatcat:mhxrll4qbvgzvm7iwunsf4r2uq
In this paper we have implemented 4 different algorithms for DNA data compression: LZW (Lampel-ziv-Welch) algorithm, run length encoding algorithm, Arithmetic coding and Substitution method. ... Run-length encoding is also used in fax machines (combined with other techniques into Modified Huffman coding). C. Arithmetic Coding  Arithmetic coding is a method for lossless data compression. ... When the next time LZW revisits a substring, it will be encoded using a single number. ...doi:10.14257/ijbsbt.2016.8.3.05 fatcat:todrnisdu5biveiaosdxhds7te
Hacettepe Journal of Mathematics and Statistics
In this work, we give some new conditions for the construction of arithmetic secret sharing schemes. ... Theory, 2014] gave a construction of arithmetic secret sharing schemes by using the torsion limits of algebraic function fields and Riemann-Roch systems. ... An (n, t, d, r)-arithmetic secret sharing scheme for F k q over F q is an n-code C for F k q such that t ≥ 1, d ≥ 2, C is t-disconnected, the d powering C * d is an n-code for F k q , and C * d is r-reconstructing ...doi:10.15672/hujms.460348 fatcat:ikqzpatkvjenvfaemqyb2z5gxy
The presented qualitative exploratory empirical study maps and codes various kinds of reasoning that can be identified with the tool and investigates possibilities of a joint coding procedure. ... We employ an educational tool called Concept Cartoons and perceive it as a common diagnostic tool for investigating modes of reasoning about general statements in arithmetic, geometry and biology. ... During the constant comparison process, we also revisited data from the arithmetic and geometry substudies. ...doi:10.7160/eriesj.2021.140406 fatcat:3i36b37jkfdujjkc3gqhdoirj4
Distributed arithmetic coding has been shown to be effective for Slepian-Wolf coding with side information. ... In this letter, we extend it to rate-compatible coding, which is useful in presence of a feedback channel between encoder and decoder. ... DISTRIBUTED ARITHMETIC CODING Let X = [X 0 , X 1 , · · · X N −1 ] be a length-N binary sequence to be encoded, with probability distribution p 0 = P (X i = 0) and p 1 = P (X i = 1), i = 0, · · · , N − ...doi:10.1109/lcomm.2008.080645 fatcat:vp6bf43ixvcx5kag6b2bbraib4
Popadié (Belgrade) Yasugi, Mariko 83e:03093 Gentzen reduction revisited. Publ. Res. Inst. Math. Sci. 16 (1980), no. 1, 1-33. The main result of the paper is a reformulation of G. ... comprehension if and only if / is strong, where R,,/ is the family of all subsets of J coded in M. The author then considers the “spacing” property (due to Paris and P. ...
Van Tilborg, H.C.A., Fire codes revisited Wilbrink, H.A., see Brouwer, A.E. Wild, P., see Piper, F. ... Lobstein, A.C., On perfect arithmetic codes Massey, J.L., Linear codes with complementary duals Mattson Jr, H.F., Fault-detection in networks McEhece, R., see Dolinar, On decoding by error location and ...doi:10.1016/0012-365x(92)90583-2 fatcat:m5qjrqjhlfhgnftknrsgsgm5hq
After he retired from IBM, Iverson returned to Canada where, with new colleagues, he revisited the notational approach. ... to make the code easy to understand. ...doi:10.1109/mc.2002.1016910 fatcat:c3fp2xxf7ngptjya72aqvbprqy
Seog Chung SEO•õa), Student Member, Dong-Guk HAN•õb), Hyung Chan KIM•õ•õ•õc), and Seokhie HONG•õd), Nonmembers SUMMARY In this paper, we revisit a generally accepted opinion: implementing Elliptic Curve ... Through comparisons with existing software implementations of ECC built in C or hybrid of C and inline assembly on sensor motes, we show that TinyECCK outperforms them in terms of running time, code size ... Consideration of Code Size Even though TinyECCK implements the field arithmetics over both GF(2m) and GF(p) to provide ECDSA services, it requires less code size than that TinyECC uses. ...doi:10.1093/ietisy/e91-d.5.1338 fatcat:acimbmhdcjh7bmr4ldiy5nmpfm
It concludes by applying van den Berg and van Slooten's result (2018) that Heyting arithmetic with partial terms plus the schema of self realizability for arithmetic formulae is conservative over HA. ... This paper presents a novel proof of the conservativity of the intuitionistic theory of strictly positive fixpoints, ID_1^i, over Heyting arithmetic (HA), originally proved in full generality by Arai ( ... In the interest of readability we will conflate coding and concatenation in the coded language. ...arXiv:2110.08240v3 fatcat:4pvzdz3sdfbmhdxv3ofscly3lu
Experimental results using arithmetic coding will be presented. ... Many coding schemes have been proposed to make the codeword length as close to the optimal value as possible. ... Actually, a practical implementation of arithmetic coding is due to Witten et al.  and a revisited version of arithmetic coding should be attributed to Moffat et al.  . ...doi:10.3390/e16063315 fatcat:f667plqsyrbdtnklszuvxu5zta
Symbolic differentiation revisited. Symbolic and automatic differentiation have different goals. ... V to the original code list (2.1). 4. Differentiation arithmetic. The idea behind differentiation arithmetic is t familiar one of an ordered-pair arithmetic. ... The arithmetic subroutines calculate (h,h') -(f,f')*(g,g'), where * E (+,-,*,/). ...doi:10.1080/0025570x.1986.11977261 fatcat:h7ab5oyy3zcbnpp6rkpybhpv4i
« Previous Showing results 1 — 15 out of 13,677 results