Alternative to Rogers and Bell in Canada

1) Get Tech-Savvy (get alot for little, around 45 bucks a month)

2) Get Netflix (78bucks a month)

3) Get Voip for phone (20 bucks a month)

3) Get FTA (Free To Air) satellite (preferably with a motorized dish which isn’t expensive at all, a one time fee).

4) Get HD Antenna (maybe around 30 bucks one time fee)

5) Get Magic Jack app for Android, completely FREE one-way communication

The best part is you will never have to deal with rogers (or Bell) again.

Advertisements

Installing PIL for Google App Engine Windows 7

NotImplementedError: Unable to find the Python PIL library.

1)

There problem is that you have not installed PIL into Python25/Lib/site-packages/

Download it here

2)

If error still comes up, make sure to explicitly tell the development server (Google App Engine Launcher) which Python distribution you are using as you may have multiple installations of Python (2.5, 2.7 etc..) and it registered by default with a different distribution.

Go into Edit -> Preferences

In “Python Path”, specify path to Python exe : C:\Python25\pythonw.exe

Dawkins the weasel, and a program

Below is a simple version of Dawkins weasel algorithm I got rolling quickly (a while back) in c. It attempts to model natural selection and random mutations.
Darwinists believe this mechanism explains all of life after the origin of life (or the first cell).

How it works:

At each iteration, a new random sequence is chosen based on the current sequence. Both sequences are compared to each other
based on their relation to the target sequence, whichever one is closest to the target sequence moves on to become the next
current sequence (the one that “survives”). What it therefore attempts to model is the better fit organisms relative to the environment
(or target sequence), hence natural selection. In effect, the organisms less fit are eventually replaced with better fit organisms.

Why its speculative:

The environment is not the only thing that organisms have to worry about. When you consider the random component (random mutations)
it directly results in a change to the organism which directly affects protein fold. All Darwinists seem to really care about
is “if it survives”, but if an organism can’t adapt to “itself” (surely a change has a direct effect on how it works and if it will even work at all) then how is it ever going to adapt to
the environment? If you make a change to something, that something has to survive the change before it can be considered for natural
selection. All changes are assumed to be up for a selective criteria. We are also assuming a pre-existing functional state. We never hear about how x came to be in the first place, we only hear about how y came from x or how y improved (ie: variation). Variation occurs, but we don’t know whether variation is the reason for initial function or whether random mutations are random at all, and are instead programmed responses to environmental queues.


#include
#include
#include
#include

#define ALPHABET "ABCDEFGHIJKLMNOPQRSTUVWXYZ "
#define ALPHA_LENGTH 27

typedef enum { FALSE = 0, TRUE = 1 } boolean;

void upString(char *);
void mutate(char *, char *, int);
void shuffle(char *);
int randInt(int, int);
int fitness(char *);
boolean isLocked(char *);

char TARGET_STRING[100];
int TARGET_LENGTH;

int main(int argc, char **argv) {

 float rate = 0.0;
 FILE* file = (argv[1] == NULL) ? fopen("output.txt", "w") : fopen(argv[1], "w");

 if(file == NULL) {
    return 1;
 }

 fprintf(stdout,"\nEnter a target string:\t");gets(TARGET_STRING);

 fprintf(stdout,"\nEnter a mutation rate:\t");fscanf(stdin,"%f", &rate);

 TARGET_LENGTH = strlen(&TARGET_STRING[0]);

 float mutation_rate = ceil((rate / 100) * TARGET_LENGTH);int m_rate = (int)mutation_rate;

 upString(&TARGET_STRING[0]);

 char *current_ptr;
 char current[TARGET_LENGTH];

 current_ptr = &current[0];

 strcpy(&current_ptr[0], &TARGET_STRING[0]);

 shuffle(&current_ptr[0]);

 char *buffer_ptr;
 char buffer[TARGET_LENGTH];

 buffer_ptr = &buffer[0];

 int gen_count = 0;    char str_gc[100];
 int i;

 while(!isLocked(buffer_ptr)) {

 if (system("cls")) system("clear");

 mutate(current_ptr, buffer_ptr, m_rate);

 if(fitness(&buffer_ptr[0]) >= fitness(&current_ptr[0])) {
    strcpy(&current_ptr[0], &buffer_ptr[0]);
 }

 puts(current_ptr);
 fputs(current_ptr, file);
 fputs("\n", file);
 gen_count++;
 }

 fprintf(stdout,"\nNumber of trials to reach target: %d", gen_count);

 fputs("\n", file);
 fputs("\nNumber of trials to reach target: ", file);
 fputs(itoa(gen_count, str_gc, 10), file);

 fclose(file);

return 0;
}

void upString(char *string) {
 int i;
 for(i=0;i    string[i] = toupper(string[i]);
}

void mutate(char* cPtr, char* bPtr, int m_rate) {
 strcpy(&bPtr[0], &cPtr[0]);
 int i;
 for(i=0;i    bPtr[randInt(0, (TARGET_LENGTH - 1))] = ALPHABET[randInt(0,(ALPHA_LENGTH - 1))];
 }
}

void shuffle(char *string) {
 int j, k;
 for(j=0; j for(k=0; k   int r = randInt(0, TARGET_LENGTH - 1);
   int temp = string[k];

    string[k] = string[r];
    string[r] = temp;
 }
 }

}

int fitness(char *cString) {
 int i;int count = 0;
 for(i=0;i    if(*(cString + i) == TARGET_STRING[i]) {
    count++;
 }
 }
return count;
}

int randInt(int min, int max) {
 static int kState = 0;int i;
 if(kState == 0) {
   srand(time(NULL));
    kState = 1;
 }
 i = (rand() % (max - min + 1) + min);

return i;
}

boolean isLocked(char *curPtr) {
 boolean state = FALSE;
 if(strcmp(&curPtr[0], &TARGET_STRING[0]) == 0) {
   state = TRUE;
 }
return state;
}

Example output on string METHINKS DAWKINS IS A WEASEL

T SEAASMENQKAIWLSW IIS HDNE
T SEAASMENQKAIWLSW  IS HDNE
T SEAASMENQKJIWLSW  IS HDNE
K SEAASMENQKJIWLSW  IS HDNE
S SEAASMENQKJIWLSW  IS HDNE
S SEAASMENQKJIWLSW IIS HDNE
S SEAASMENQKJIWLSW IISRHDNE
G SEAASMENQKJIWLSW IISRHDNE
………
METHINKS DASKINS IS A WEASEL
METHINKS DAJKINS IS A WEASEL
METHINKS DAJKINS IS A WEASEL
METHINKS DAJKINS IS A WEASEL
METHINKS DAWKINS IS A WEASEL

Number of trials to reach target: 3703