dynabook E10-S, Maintenance Manual

Page: 81 / 133

5. Appendix
3 Dia
gnostic Programs
3-33 Maintenance Manual Satellite Pro E10-S / dynabook E10-S
As you see this figure, the vertical lines and horizontal lines are drawn with equal intervals.
Additionally, the vertical and horizontal intervals are identical. It means that every grid made by two pair of the adjacent vertical and
horizontal lines is a square.
The interval’s value or the grid side’s length, which is referred as “Z” in this section 4-10, is calculated as follows.
“Z” is calculated based on the Greatest Common Measure (GCM) of the Full screen’s width and height.
Suppose that X = Full screen’s width, Y = Full screen’s height and “z" is the GCM of X and Y.
Hence,
z = GCM(X, Y); // z is calculated by Euclidean algorithm for GCM.
Usually, as “z” is a large integer value, it will be adjusted by the following logic to get a factor of “z” that is approximately equal to
X/40. The factor will be defined as “Z”.
z = GCM(X, Y); // X = Full screen’s width, Y = Full screen’s height.
for (d = 2; d<= z; d++)
{
if (z % d == 0)
{ // “z” is dividable by “d”
z = z / d;
if (X<= 1000) {if (z <= 25)break;}
else if (X<= 2000) {if (z <= 50)break; }
else if (X<= 3000) {if (z <= 75)break; }
else if (X<= 4000) {if (z <= 100)break;}
else if (X<= 5000) {if (z <= 125)break;}
else if (X<= 6000) {if (z <= 150)break; }
else if (X<= 7000) {if (z <= 175)break;}
else {if (z <= 200)break;}
d = 1; // to find the next factor of “z
}
}
Z = z; // “Z” will be the interval for both of the vertical and horizontal lines
// In case that z=GCM(X, Y) is a prime number, Z = GCM(X, Y), too.
# Note for this logic
The logic to define “Z” above does not seem to be very good because “z” is always divided by the smallest factor.
Although the logic can be acceptable for a while as long as there is no problem with the target PCs for this time, it is better to modify
the logic sometime in future as follows for example:
First, factorize “z” into prime factors:
z= S
1
^t
1
*S
2
^t
2
*….*S
n
^t
n
where S
1
,S
2
,…,S
n
are prime numbers with S
1
<S
2
<….<S
n
and 0 < t
1
, t
2
, … t
n