-
Notifications
You must be signed in to change notification settings - Fork 59
/
Copy pathfootball.html
202 lines (177 loc) · 4.9 KB
/
football.html
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
<html>
<head>
<title>
FOOTBALL - Ranking Football Teams
</title>
</head>
<body bgcolor="#EEEEEE" link="#CC0000" alink="#FF3300" vlink="#000055">
<h1 align = "center">
FOOTBALL <br> Ranking Football Teams
</h1>
<hr>
<p>
<b>FOOTBALL</b>
is a FORTRAN90 program which
ranks college football teams.
</p>
<p>
A sample file of scores is available from
Knuth's Stanford Graph Base. The program reads this file, computes
a scoring matrix, and determines a ranking. At the moment, only
some of Keener's methods have been implemented.
</p>
<h3 align = "center">
Licensing:
</h3>
<p>
The computer code and data files described and made available on this web page
are distributed under
<a href = "../../txt/gnu_lgpl.txt">the GNU LGPL license.</a>
</p>
<h3 align = "center">
Related Data and Programs:
</h3>
<p>
<a href = "../../datasets/sgb/sgb.html">
SGB</a>,
a dataset directory which
contains files used as input data for
demonstrations and tests of Donald Knuth's Stanford Graph Base.
</p>
<h3 align = "center">
Reference:
</h3>
<p>
<ol>
<li>
Donald Knuth,<br>
The Stanford Graph Base,<br>
ACM Press, 1993.
</li>
<li>
James Keener,<br>
The Perron-Frobenius Theorem and the Ranking of Football Teams,<br>
SIAM Review,<br>
Volume 35, Number 1, pages 80-93, March 1993.
</li>
</ol>
</p>
<h3 align = "center">
Source Code:
</h3>
<p>
<ul>
<li>
<a href = "football.f90">football.f90</a>, the source code;
</li>
<li>
<a href = "football.sh">football.sh</a>, commands to
compile and load the source code;
</li>
</ul>
</p>
<h3 align = "center">
Examples and Tests:
</h3>
<p>
<ul>
<li>
<a href = "football_input.txt">football_input.txt</a>,
a list of game scores;
</li>
<li>
<a href = "football_output.txt">football_output.txt</a>,
the output file;
</li>
</ul>
</p>
<h3 align = "center">
List of Routines:
</h3>
<p>
<ul>
<li>
<b>MAIN</b> is the main program for FOOTBALL.
</li>
<li>
<b>CH_CAP</b> capitalizes a single character.
</li>
<li>
<b>CH_EXTRACT</b> extracts the next nonblank character from a string.
</li>
<li>
<b>GAME_PRINT</b> prints the game information.
</li>
<li>
<b>GAMES_READ</b> reads the game score data file.
</li>
<li>
<b>GET_UNIT</b> returns a free FORTRAN unit number.
</li>
<li>
<b>I4_EXTRACT</b> "extracts" an I4 from the beginning of a string.
</li>
<li>
<b>I4VEC_IDENTITY</b> sets an I4VEC to the identity vector A(I)=I.
</li>
<li>
<b>PICARD</b> uses Picard iteration to find an approximate nonlinear ranking.
</li>
<li>
<b>R8MAT_POWER_METHOD</b> applies the power method to a matrix.
</li>
<li>
<b>R8VEC_SORT_INSERT_INDEX_D</b> descending index sorts an R8VEC using insertion.
</li>
<li>
<b>S_BEFORE_SS_COPY</b> copies a string up to a given substring.
</li>
<li>
<b>S_EQI</b> is a case insensitive comparison of two strings for equality.
</li>
<li>
<b>S_TO_I4</b> reads an I4 from a string.
</li>
<li>
<b>S_TOKEN_MATCH</b> matches the beginning of a string and a set of tokens.
</li>
<li>
<b>SCORE_MATRIX_SET</b> sets the entries of the score matrix.
</li>
<li>
<b>SCORE_MATRIX_SET2</b> sets the entries of the score matrix.
</li>
<li>
<b>TEAM_PRINT</b> prints the team name information.
</li>
<li>
<b>TEAM_READ</b> reads the team name information from the game score data file.
</li>
<li>
<b>TIMESTAMP</b> prints the current YMDHMS date as a time stamp.
</li>
<li>
<b>TOKEN_EXTRACT</b> "extracts" a token from the beginning of a string.
</li>
<li>
<b>WARP</b> computes a score that tries to factor out wipeouts.
</li>
<li>
<b>WARP2</b> computes a score that tries to factor out wipeouts.
</li>
<li>
<b>WORD_EXTRACT</b> extracts the next word from a string.
</li>
</ul>
</p>
<p>
You can go up one level to <a href = "../f_src.html">
the FORTRAN90 source codes</a>.
</p>
<hr>
<i>
Last revised on 27 November 2006.
</i>
<!-- John Burkardt -->
</body>
</html>