Re: [racket-users] accumulators vs foldl? was: Fwd: Rsound question

2015-03-25 Thread George Neuner

On 3/25/2015 2:07 PM, 'John Clements' via users-redirect wrote:

This is a pedagogic question. The discussion below (forwarded with permission) 
is basically about the best way to find the maximum value in a vector of length 
four million, a.k.a. a sound file. Non-tail recursion is problematic; I blow a 
512M-limited evaluator in about 14 seconds without finding the answer, where 
tail-calling gets me the answer in about 2 seconds.


I have to ask ... how exactly did you search a vector non-tail recursively?



So! Here’s the question. Is it better to give students an “rs-foldl” that 
performs a fold over sound, or to show them accumulator-style programming? I 
was a bit surprised to see that in HtDP 2e, foldl (a.k.a. “Programming to an 
Abstraction”) appears much earlier (section 18.4) than accumulator-style 
(section 35). I suppose this could be because using an abstraction can be 
easier than devising it, although in the case of (say) map, the book takes care 
to ensure that students can implement map-like functions in their sleep before 
showing them the abstraction.

Opinions appreciated!


That's tough.  On one hand, teaching map and fold shows the proper (IMO) 
way to *think* about the problem - loops are implementation detail.  On 
the other hand, regarding map and fold as black boxes does not give the 
student any appreciation of their complexity. It's very much like the 
loop vs recursion argument: unless you have fought with a loop + 
auxiliary stack implementation, you don't appreciate what recursion is 
doing for you automagically, nor do you really appreciate its hidden 
management costs.


Having learned loops first  [because Lisp was, IIRC, my 5th programming 
language]  I can only speculate on the reverse.  I can say that it was 
easy to understand map and fold [reduce in Lisp] in terms of loops and 
accumulators, but I think that lacking that perspective it would be 
possible for a student to compartmentalize and disassociate them.  
There's also the possibility of mistaking implementation for general 
concept: e.g., people learning "don't use right fold because it takes 
O(n) space" ... when _we_ know that is due to an implementation detail 
and not a failing of right fold in general.


I know none of this answers your question.
George

--
You received this message because you are subscribed to the Google Groups "Racket 
Users" group.
To unsubscribe from this group and stop receiving emails from it, send an email 
to racket-users+unsubscr...@googlegroups.com.
For more options, visit https://groups.google.com/d/optout.


[racket-users] accumulators vs foldl? was: Fwd: Rsound question

2015-03-25 Thread 'John Clements' via users-redirect
This is a pedagogic question. The discussion below (forwarded with permission) 
is basically about the best way to find the maximum value in a vector of length 
four million, a.k.a. a sound file. Non-tail recursion is problematic; I blow a 
512M-limited evaluator in about 14 seconds without finding the answer, where 
tail-calling gets me the answer in about 2 seconds.

So! Here’s the question. Is it better to give students an “rs-foldl” that 
performs a fold over sound, or to show them accumulator-style programming? I 
was a bit surprised to see that in HtDP 2e, foldl (a.k.a. “Programming to an 
Abstraction”) appears much earlier (section 18.4) than accumulator-style 
(section 35). I suppose this could be because using an abstraction can be 
easier than devising it, although in the case of (say) map, the book takes care 
to ensure that students can implement map-like functions in their sleep before 
showing them the abstraction.

Opinions appreciated!

Many thanks,

John


Begin forwarded message:

> From: John Clements 
> Subject: Re: Rsound question
> Date: March 25, 2015 at 9:48:09 AM PDT
> To: James Vanderhyde 
> 
> 
> On Mar 25, 2015, at 5:54 AM, James Vanderhyde  
> wrote:
> 
>> John,
>> 
>> There are some sound processing tasks I’m not sure how to do with Rsound. 
>> For example, to normalize the sound (make it as loud as possible with no 
>> clipping), I need to find the maximum absolute sample value, and then 
>> multiply everything by 1 over that value. I can use rs-map for the second 
>> part, but I don’t know how to find the max in a sound (or do other audio 
>> analysis). It seems like I need something like rs-fold. What would you 
>> recommend?
> 
> I see two ways to solve this. The first is “by the book”.
> 
> FIRST:
> 
> This problem requires two medium-advanced concepts. First, the notion of 
> recursion over the natural numbers, introduced in section 10.3 of HtDP2e 
> 
> http://www.ccs.neu.edu/home/matthias/HtDP2e/part_two.html#%28part._sec~3anats%29
> 
> … and, more challenging, the notion of an accumulator:
> 
> http://www.ccs.neu.edu/home/matthias/HtDP2e/part_six.html
> 
> Here’s the resulting code:
> 
> (require rsound)
> 
> ;; given a sound, return the maximum value
> ;; of a sample in that sound
> ;; rsound -> number
> (define (max-volume rs)
>  (max-volume-helper rs 0 0.0))
> 
> ;; given a sound, an index, and a maximum-so-far,
> ;; compute the maximum volume of the sound
> (define (max-volume-helper rs idx max-so-far)
>  (cond [(<= (rs-frames rs) idx) max-so-far]
>[else (max-volume-helper rs (add1 idx)
> (max (abs (rs-ith/left rs idx))
>  (abs (rs-ith/right rs idx))
>  max-so-far))]))
> 
> (define test-sound (mono 101 x (* -0.0025 x)))
> 
> (check-within (max-volume-helper test-sound 50 0.0) 0.25 1e-4)
> (check-within (max-volume-helper test-sound 50 0.96) 0.96 1e-4)
> (check-within (max-volume test-sound) 0.25 1e-4)
> 
> In this case, the accumulator isn’t really necessary, but if you want to run 
> the program on more than a few hundred samples, it’s going to be important.
> 
> SECOND:
> 
> We could certainly add rs-fold. It would require students to define a more 
> challenging higher-order function, but perhaps that’s simpler than writing it 
> in accumulator style? I’d be interested to hear what you have to say.
> 
> P.S.: mind if I forward this question to the racket-users mailing list?
> 
> John
> 
> 
> 
>> 
>> James
>> --
>> Dr. James Vanderhyde
>> Math and Computer Science
>> Benedictine College
>> jvanderh...@benedictine.edu
>> http://vanderhyde.us/~james/pro/
>> 
>> 
>> 
>>> On Mar 18, 2015, at 2:24 PM, John Clements  
>>> wrote:
>>> 
>>> 
>>> On Mar 18, 2015, at 6:28 AM, James Vanderhyde  
>>> wrote:
>>> 
 Thank you, John. You are so helpful. I’ve really appreciated your quick 
 responses. I don’t really like mono because it introduces additional 
 syntax, and signals introduce additional structures. But either one will 
 give me a much better approach than what I was going to do.
>>> 
>>> Thanks for the thanks! Also, I’d like to point out that if you use 
>>> indexed-signal, you certainly don’t need to get into details; you can 
>>> describe a signal as a box with a function in it.
>>> 
>>> HOWEVER… after looking at this for a while longer, I see that a 
>>> ‘build-sound’ function such as the one you describe is probably a good 
>>> addition to the library. So, I added it. (I also
>>> added some other documentation, and fixed one long-term documentation 
>>> niggle).
>>> 
>>> I’ve pushed this to the github repo, and poked pkgs.racket-lang.org. I’m 
>>> not sure how long it’ll take for the catalog to reflect the change.
>>> 
>>> Thanks again,
>>> 
>>> John Clements
>>> 
>>> 
 
 By the way, rs-map is also undocumented.
 
 James
 --
 Dr. James Vanderhyde
 Math and Computer Science
 Benedictine College
 jvander