Scanning code - Revision history

Teorth at 01:34, 13 June 2009

2009-06-13T01:34:20Z

← Older revision		Revision as of 18:34, 12 June 2009
Line 1,472:		Line 1,472:


	#define MAX_PARETO 26 // at most 26 pareto-optimals per forbidden set		#define MAX_PARETO 27 // at most 27 pareto-optimals per forbidden set
	short int table[144][16384][MAX_PARETO];		short int table[144][16384][MAX_PARETO];

Teorth at 23:45, 11 June 2009

2009-06-11T23:45:23Z

← Older revision		Revision as of 16:45, 11 June 2009
Line 1,597:		Line 1,597:
	if ((level1 & masks[0][k]) && (level3 & masks[2][k])) level2 \|= masks[1][k];		if ((level1 & masks[0][k]) && (level3 & masks[2][k])) level2 \|= masks[1][k];
	// printf("\n[%lo %lo %lo] \n", level1, level3, level2);		// printf("\n[%lo %lo %lo] \n", level1, level3, level2);
	test(level2,numouter); // level2 is the forbidden set		test(level2,numouter); // level2 is the forbidden set
	}		}
	}		}
Line 1,603:		Line 1,603:

	char paretos[17][33][25][9][2]; // paretos[a][b][c][d][e] = 1 if (a,b,c,d,e) is found to be feasible		char paretos[17][33][25][9][2]; // paretos[a][b][c][d][e] = 1 if (a,b,c,d,e) is found to be feasible

			FILE * output;

	void analyse(void) // dump the feasible table		void analyse(void) // dump the feasible table
Line 1,627:		Line 1,629:
	{		{
	printf("Feasible: (%d %d %d %d %d)\n", a, b, c, d, e);		printf("Feasible: (%d %d %d %d %d)\n", a, b, c, d, e);
			fprintf(output, "%d %d %d %d %d\n", a, b, c, d, e);
	paretos[a][b][c][d][e] = 1;		paretos[a][b][c][d][e] = 1;
	}		}
Line 1,655:		Line 1,658:
	return;		return;
	}		}

			char str[100];

	buildperms();		buildperms();
Line 1,669:		Line 1,674:

	if (argc > 3) return;		if (argc > 3) return;

			strcpy(str, "output_");
			strcat(str, argv[1]);
			strcat(str, "_");
			strcat(str, argv[2]);
			strcat(str, ".txt");
			output = fopen(str,"w");
			printf("All pairs found will be output to %s.\n", str);

	init_data();		init_data();
Line 1,690:		Line 1,703:
	analyse(); // convert the compressed table to uncompressed, dump any new statistics obtained		analyse(); // convert the compressed table to uncompressed, dump any new statistics obtained
	}		}
			fclose(output);
	}		}

Teorth at 23:34, 11 June 2009

2009-06-11T23:34:27Z

← Older revision		Revision as of 16:34, 11 June 2009
Line 1,576:		Line 1,576:
	double total;		double total;

	void testpair(int stage, int x, int y)		void testpair(int stage, int x, int y) // scans all Level 1/Level 3 pairs with a-signatures x, y respectively
	{		{
	int i,j,k;		int i,j,k;
Line 1,590:		Line 1,590:
	for (j=0; j<astatnum[y]; j++)		for (j=0; j<astatnum[y]; j++)
	{		{
	numouter = datastat[x][i] + datastat[y][j];		numouter = datastat[x][i] + datastat[y][j]; // the total stats of the level 1/ level 3 pair
	level1 = data[x][i];		level1 = data[x][i];
	level3 = data[y][j];		level3 = data[y][j]; // compute the level 1 / level 3 pairs
	level2 = 0;		level2 = 0;
	for (k=0; k<NUM_4D_LINES; k++)		for (k=0; k<NUM_4D_LINES; k++)
	if ((level1 & masks[0][k]) && (level3 & masks[2][k])) level2 \|= masks[1][k];		if ((level1 & masks[0][k]) && (level3 & masks[2][k])) level2 \|= masks[1][k];
	// printf("\n[%lo %lo %lo] \n", level1, level3, level2);		// printf("\n[%lo %lo %lo] \n", level1, level3, level2);
	test(level2,numouter);		test(level2,numouter); // level2 is the forbidden set
	}		}
	}		}
Line 1,615:		Line 1,615:
	b0 = (i/17)%25;		b0 = (i/17)%25;
	c0 = (i/(17*25))%13;		c0 = (i/(17*25))%13;
	d0 = (i/(172513));		d0 = (i/(172513)); // the outer layers (Level 1, Level 3) contribute to a,b,c,d statistics
	for (j=0; j<NUM_PARETO;j++)		for (j=0; j<NUM_PARETO;j++)
	for (k=0; k<2; k++)		for (k=0; k<2; k++)
	if (feasible[i][j][k])		if (feasible[i][j][k])
	{		{
	b=b0 + alist[j];		b=b0 + alist[j]; // The middle layer (Level 2) contribute to b,c,d,e statistics
	c=c0 + blist[j];		c=c0 + blist[j];
	d=d0 + clist[j];		d=d0 + clist[j];
Line 1,678:		Line 1,678:
	for (l=0; l<9; l++)		for (l=0; l<9; l++)
	for (m=0; m<2; m++)		for (m=0; m<2; m++)
	paretos[i][j][k][l][m] = 0;		paretos[i][j][k][l][m] = 0; // initialise the table of feasible 4D statistics

	for (i=0; i<NUMOUTER; i++)		for (i=0; i<NUMOUTER; i++)
	for (j=0; j<NUM_PARETO; j++)		for (j=0; j<NUM_PARETO; j++)
	for (k=0; k<2; k++)		for (k=0; k<2; k++)
	feasible[i][j][k]=0;		feasible[i][j][k]=0; // initialise the compressed table of feasible 4D statistics

	for (i=x; i<=y; i++)		for (i=x; i<=y; i++)
	{		{
	testpair(i,a1[i], a2[i]);		testpair(i,a1[i], a2[i]); // scan stage i
	analyse();		analyse(); // convert the compressed table to uncompressed, dump any new statistics obtained
	}		}
	}		}

Teorth: New page: // Computes Pareto-optimal 4D Moser statistics. #include #include #include #include #define NUM_LINES_3D 25 // 25 non-horizontal lines in [3]^3...

2009-06-11T23:30:51Z

New page: // Computes Pareto-optimal 4D Moser statistics. #include <stdio.h> #include <stdlib.h> #include <string.h> #include <time.h> #define NUM_LINES_3D 25 // 25 non-horizontal lines in [3]^3...

Show changes