Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]


Groups > comp.compression > #2364

Re: Introduction to Dynamic Unary Encoding

Newsgroups comp.compression
Date 2014-06-09 13:03 -0700
References (3 earlier) <7d246$538947e6$5419b3e4$14998@cache1.tilbu1.nb.home.nl> <10d39df4-041c-4e86-84a6-fab8eca2b852@googlegroups.com> <645fe$538fee8a$5419b3e4$4290@cache50.multikabel.net> <47647$538feed3$5419b3e4$4855@cache50.multikabel.net> <0e9cd8f1-7547-48c0-957c-268e3ea4a684@googlegroups.com>
Message-ID <3642472e-46f3-41cb-8cd0-80bbcd0d3cdc@googlegroups.com> (permalink)
Subject Re: Introduction to Dynamic Unary Encoding
From Ernst <ernst_berg@sbcglobal.net>

Show all headers | View raw


On Sunday, June 8, 2014 2:20:31 PM UTC-7, Ernst wrote:
> On Wednesday, June 4, 2014 9:15:17 PM UTC-7, Skybuck Flying wrote:
> 
> > Woops.
> 
> > 
> 
> > 
> 
> > 
> 
> > I see I made the same damn typo again.
> 
> > 
> 
> > 
> 
> > 
> 
> > See * correction
> 
> > 
> 
> > 
> 
> > 
> 
> > 
> 
> > 
> 
> > Ok,
> 
> > 
> 
> > 
> 
> > 
> 
> > Thanks for your reply.
> 
> > 
> 
> > 
> 
> > 
> 
> > It did clear up a little bit.
> 
> > 
> 
> > 
> 
> > 
> 
> > I have now spent too much energy on trying to understand your paper.
> 
> > 
> 
> > *I have not spent too much energy on trying to understand your paper.
> 
> > 
> 
> > 
> 
> > 
> 
> > I also do not want to spent too much energy on it because it could be a
> 
> > 
> 
> > troll.
> 
> > 
> 
> > 
> 
> > 
> 
> > I am also not trying to hurt your feeling, but I must take into account the
> 
> > 
> 
> > possibility of trolling which is an activity which happens on the internet
> 
> > 
> 
> > all the time, even with scientific papers.
> 
> > 
> 
> > 
> 
> > 
> 
> > At first glance, at least the first part of your paper seems ok, and second
> 
> > 
> 
> > part might be ok too.
> 
> > 
> 
> > 
> 
> > 
> 
> > I am just being lazy and I am very bad at math.
> 
> > 
> 
> > 
> 
> > 
> 
> > Seeing some source code or something proving that this works might convince
> 
> > 
> 
> > me and others that there is something to this.
> 
> > 
> 
> > 
> 
> > 
> 
> > However it may also expose that this is nothing.
> 
> > 
> 
> > 
> 
> > 
> 
> > I have one last tip for you, instead of using PDF, perhaps using HTML might
> 
> > 
> 
> > be easier... not sure about that.
> 
> > 
> 
> > 
> 
> > 
> 
> > MS-Word does have some features for graphics and such.
> 
> > 
> 
> > 
> 
> > 
> 
> > Should be sufficient to explain bits and bit positions.
> 
> > 
> 
> > 
> 
> > 
> 
> > Not sure if MS-Word to PDF conversion would work with graphics in it and
> 
> > 
> 
> > such.
> 
> > 
> 
> > 
> 
> > 
> 
> > Also 2N versus 2^N is a big difference so at least that should be fixed.
> 
> > 
> 
> > 
> 
> > 
> 
> > Bye,
> 
> > 
> 
> >   Skybuck.
> 
> 
> 
> 
> 
> 
> 
>  I have taken some of your advice and changed wording. I will continue to consider crafting a version that is easier to read. I am not in a hurry to have this paper published. I'll continue to work towards perfection. It's all a learning experience for me. I think it would be wise to wait at least a year. That way I have time enough to grow as a writer. Knowing something is one thing. Writing it down is another. Not everyone that can do a thing can write a paper. 
> 
> 
> 
>  I realize that the signal to noise ratio of paper is high. I also realize my original intent is to have reader do the work of reasoning along with reading what is written. If it requires several reads so be it. I have to read stuff several times; "it ain't no big thang"
> 
> 
> 
>  If I may suggest a simple method of seeing there is no need to doubt the foundation of Dynamic Unary Encoding?  Simply work out a few cycles by hand. perhaps lengths 2,3 and 4? Encode and Decode. I think once you go hands on the rest will become more interesting to you. 
> 
> 
> 
> Also you prompted me to review my paper. Because of that prompting I realize now that the last update was made with a really old draft. Some of the early maths were just place-holders so to speak. I had a serious and embarrassing boo-boo. I still feel unsure having spaced-out the obvious flaw so I should write a program to test the maths. C Language programs have become my maths and proofs ( of a kind) are a lot of the programming I do.
> 
> 
> 
> 
> 
>  Again I appreciate the conversation. You can read the updated paper probably after Tuesday. Weekend updates are slow on arXiv
> 
> 
> 
> I will attempt humour again with a video link https://www.youtube.com/watch?feature=player_detailpage&v=jYyBZE0kBtE



 Yeah I had about a week of "programmers Block." Nothing seemed real and that part of my brain that works with DUE seemed to be off-line.. It feels like it's coming back.

So without further Ammonium diuranate (a·dieu) I believe this is a mathematics generating the Element and Cycle counts.

#include <stdio.h>
#include <stdlib.h>
#include <math.h>

#define LIMIT1 500

void main(void)
         {
//
           double two = 2,d1,d2,n;
printf("This code is the property of Ernst. D. Berg\n" Non-commercial use is granted.\n Any modifications must be documented and the original code must be included with any subsequent distribution.\n"); 
           printf("===================================================== First set ===========================================\n");

          for(n=1;n<LIMIT1;n+=1)
            {
                d1 = pow( two, n ); d1 = pow(two,d1);
                d2 = n + 1; d2 = pow( two, d2 );
                printf("For N = %f The number of Elements are %f The number of Cycles are %f \n",n,d2,d1/d2);
            }


          /* Generate the Element count and cycle counts for all other parity reference and length combinations */
          printf("==================================================== Second set =============================================\n");

         for(n=1;n<LIMIT1;n+=1)
            {
               d1 = log2(n); d1 = floor(d1); d1 += 1; d1 = pow(two,d1); //pow( two, n );
               d2 = n+1; d2 = pow( two, d2 ); // ;
              printf("For N = %f The number of Elements are %f The number of Cycles are %f \n",n,d1,d2/d1);
           }

         } // endo main  
~                                                                                                                                                            
~                                                                                                                                                            
Sorry to have gone brain dead on uploading the prior to tomorrow revision. Like I said I know what it is and does but writing it down is tricky.

Back to comp.compression | Previous | NextPrevious in thread | Next in thread | Find similar | Unroll thread


Thread

Introduction to Dynamic Unary Encoding Ernst <ernst_berg@sbcglobal.net> - 2014-05-13 09:24 -0700
  Re: Introduction to Dynamic Unary Encoding Ernst <ernst_berg@sbcglobal.net> - 2014-05-16 14:16 -0700
    Re: Introduction to Dynamic Unary Encoding Ernst <ernst_berg@sbcglobal.net> - 2014-05-28 16:56 -0700
      Re: Introduction to Dynamic Unary Encoding "Skybuck Flying" <Windows7IsOK@DreamPC2006.com> - 2014-05-31 05:09 +0200
        Re: Introduction to Dynamic Unary Encoding "Skybuck Flying" <Windows7IsOK@DreamPC2006.com> - 2014-05-31 05:27 +0200
          Re: Introduction to Dynamic Unary Encoding "Skybuck Flying" <Windows7IsOK@DreamPC2006.com> - 2014-05-31 05:37 +0200
            Re: Introduction to Dynamic Unary Encoding Ernst <ernst_berg@sbcglobal.net> - 2014-06-03 15:47 -0700
        Re: Introduction to Dynamic Unary Encoding Ernst <ernst_berg@sbcglobal.net> - 2014-06-03 15:18 -0700
          Re: Introduction to Dynamic Unary Encoding "Skybuck Flying" <Windows7IsOK@DreamPC2006.com> - 2014-06-05 06:14 +0200
            Re: Introduction to Dynamic Unary Encoding "Skybuck Flying" <Windows7IsOK@DreamPC2006.com> - 2014-06-05 06:15 +0200
              Re: Introduction to Dynamic Unary Encoding Ernst <ernst_berg@sbcglobal.net> - 2014-06-08 14:20 -0700
                Re: Introduction to Dynamic Unary Encoding Ernst <ernst_berg@sbcglobal.net> - 2014-06-09 13:03 -0700
      Re: Introduction to Dynamic Unary Encoding Ernst <ernst_berg@sbcglobal.net> - 2014-06-16 14:40 -0700
  Re: Introduction to Dynamic Unary Encoding jacko <jackokring@gmail.com> - 2014-05-29 17:54 -0700
    Re: Introduction to Dynamic Unary Encoding Ernst <ernst_berg@sbcglobal.net> - 2014-06-03 13:52 -0700
  Re: Introduction to Dynamic Unary Encoding matrix29bear@gmail.com - 2014-06-11 00:56 -0700
    Re: Introduction to Dynamic Unary Encoding matrix29bear@gmail.com - 2014-06-11 03:38 -0700
      Re: Introduction to Dynamic Unary Encoding Ernst <ernst_berg@sbcglobal.net> - 2014-06-11 13:23 -0700
      Re: Introduction to Dynamic Unary Encoding Ernst <ernst_berg@sbcglobal.net> - 2014-06-11 13:37 -0700
        Re: Introduction to Dynamic Unary Encoding matrix29bear@gmail.com - 2014-06-11 18:39 -0700
          Re: Introduction to Dynamic Unary Encoding Ernst <ernst_berg@sbcglobal.net> - 2014-06-13 12:10 -0700
            Re: Introduction to Dynamic Unary Encoding matrix29bear@gmail.com - 2014-06-13 16:30 -0700
        Re: Introduction to Dynamic Unary Encoding matrix29bear@gmail.com - 2014-06-11 19:12 -0700
  Re: Introduction to Dynamic Unary Encoding Ernst <ernst_berg@sbcglobal.net> - 2014-06-13 12:07 -0700
    Re: Introduction to Dynamic Unary Encoding matrix29bear@gmail.com - 2014-06-13 16:14 -0700
      Re: Introduction to Dynamic Unary Encoding Ernst <ernst_berg@sbcglobal.net> - 2014-06-16 12:38 -0700
  Re: Introduction to Dynamic Unary Encoding Ernst <ernst_berg@sbcglobal.net> - 2014-09-04 19:30 -0700
  Re: Introduction to Dynamic Unary Encoding Ernst <ernst_berg@sbcglobal.net> - 2014-12-14 18:58 -0800
  Re: Introduction to Dynamic Unary Encoding ernst@eberg.us - 2017-03-14 12:48 -0700

csiph-web