2007 North Alabama Lions football team
The 2007 North Alabama Lions football team represented the University of North Alabama in the 2007 NCAA Division II football season.
| 2007 North Alabama Lions football | |
|---|---|
| Conference | Gulf South Conference |
| 2007 record | 10–2 (7–1 Gulf South) |
| Head coach | Mark Hudspeth (6th season) |
| Offensive coordinator | Kenny Edenfield |
| Defensive coordinator | Karl Morgan |
| Home stadium | Braly Stadium |
| 2007 Gulf South Conference football standings | ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| Conf | Overall | |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
| Team | W | L | W | L | ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
| No. 10 Delta State $^ | 8 | – | 0 | 10 | – | 2 | ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
| No. 1 Valdosta State ^ | 7 | – | 1 | 13 | – | 1 | ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
| No. 6 North Alabama ^ | 7 | – | 1 | 10 | – | 2 | ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
| Henderson State | 6 | – | 2 | 7 | – | 3 | ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
| Harding | 5 | – | 3 | 6 | – | 4 | ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
| Arkansas Tech | 3 | – | 5 | 5 | – | 5 | ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
| Arkansas–Monticello | 3 | – | 5 | 4 | – | 7 | ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
| Ouachita Baptist | 2 | – | 6 | 4 | – | 6 | ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
| Southern Arkansas | 2 | – | 6 | 3 | – | 7 | ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
| West Georgia | 1 | – | 7 | 2 | – | 9 | ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
| West Alabama | 0 | – | 8 | 1 | – | 9 | ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
| ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
Schedule
| Date | Time | Opponent | Rank | Site | TV | Result | Attendance |
|---|---|---|---|---|---|---|---|
| September 8 | 6:00 p.m. | Tusculum College* | No. 4 |
| CSTV Online | W 43–24 | 9,315 |
| September 13 | 7:00 p.m. | at Harding | No. 3 |
| CSS | W 57-17 | 3,100 |
| September 22 | 6:00 p.m. | Southern Arkansas | No. 3 |
| W 27-8 | 7,725 | |
| September 29 | 6:00 p.m. | at Arkansas Tech | No. 3 |
| W 27-20 | 6,081 | |
| October 6 | 6:00 p.m. | Ouachita Baptist | No. 3 |
| W 40-7 | 7,235 | |
| October 13 | 3:00 p.m. | at Arkansas-Monticello | No. 3 |
| W 46-27 | 3,186 | |
| October 18 | 7:00 p.m. | Delta State* | No. 2 |
| CSS | W 28-17 | 8,700 |
| October 27 | 12:00 p.m. | at Valdosta State | No. 2 |
| CSTV Online | L 24-27 | 4,127 |
| November 3 | 6:00 p.m. | West Georgia | No. 10 |
| W 65-17 | 8,024 | |
| November 10 | 6:00 p.m. | West Alabama | No. 10 |
| W 49-20 | 10,206 | |
| November 24 | 12:00 p.m | No. 9 Delta State | No. 10 |
| W 20-17 | 5,575 | |
| December 1 | 12:00 p.m | at No. 9 Valdosta State | No. 10 |
| L 23-37 | 4,591 | |
| |||||||
Game summaries
Tusculum
| 1 | 2 | 3 | 4 | Total | |
|---|---|---|---|---|---|
| Pioneers | 7 | 10 | 0 | 7 | 24 |
| Lions | 14 | 20 | 9 | 0 | 43 |
Harding
| 1 | 2 | 3 | 4 | Total | |
|---|---|---|---|---|---|
| Lions | 3 | 28 | 13 | 14 | 58 |
| Bison | 3 | 7 | 7 | 0 | 17 |
Southern Arkansas
| 1 | 2 | 3 | 4 | Total | |
|---|---|---|---|---|---|
| Muleriders | 0 | 0 | 0 | 8 | 8 |
| Lions | 7 | 7 | 6 | 7 | 27 |
Arkansas Tech
| 1 | 2 | 3 | 4 | Total | |
|---|---|---|---|---|---|
| Lions | 7 | 3 | 14 | 3 | 27 |
| Wonderboys | 7 | 6 | 0 | 7 | 20 |
Ouachita Baptist
| 1 | 2 | 3 | 4 | Total | |
|---|---|---|---|---|---|
| Tigers | 7 | 0 | 0 | 0 | 7 |
| Lions | 7 | 19 | 14 | 0 | 40 |
Arkansas-Monticello
| 1 | 2 | 3 | 4 | Total | |
|---|---|---|---|---|---|
| Lions | 14 | 23 | 0 | 9 | 46 |
| Boll Weevils | 7 | 0 | 7 | 13 | 27 |
Delta State
| 1 | 2 | 3 | 4 | Total | |
|---|---|---|---|---|---|
| Statesmen | 3 | 7 | 7 | 0 | 17 |
| Lions | 14 | 0 | 7 | 7 | 28 |
Valdosta State
| 1 | 2 | 3 | 4 | Total | |
|---|---|---|---|---|---|
| Lions | 3 | 7 | 14 | 0 | 24 |
| Blazers | 7 | 5 | 7 | 7 | 26 |
West Georgia
| 1 | 2 | 3 | 4 | Total | |
|---|---|---|---|---|---|
| Wolves | 0 | 10 | 7 | 0 | 17 |
| Lions | 10 | 13 | 14 | 28 | 65 |
West Alabama
| 1 | 2 | 3 | 4 | Total | |
|---|---|---|---|---|---|
| Tigers | 0 | 13 | 7 | 0 | 20 |
| Lions | 21 | 14 | 14 | 0 | 49 |
Delta State
| 1 | 2 | 3 | 4 | Total | |
|---|---|---|---|---|---|
| Statesmen | 0 | 10 | 0 | 7 | 17 |
| Lions | 3 | 7 | 3 | 7 | 20 |
Valdosta State
| 1 | 2 | 3 | 4 | Total | |
|---|---|---|---|---|---|
| Lions | 9 | 7 | 7 | 0 | 23 |
| Blazers | 13 | 3 | 0 | 21 | 37 |
gollark: So, I finished that to highly dubious demand. I'd like to know how #11 and such work.
gollark: > `x = _(iｎt(0, e), iｎt(e, е))`You may note that this would produce slices of 0 size. However, one of the `e`s is a homoglyph; it contains `2 * e`.`return Result[0][0], x, m@set({iｎt(e, 0), iｎt(е, e)}), w`From this, it's fairly obvious what `strassen` *really* does - partition `m1` into 4 block matrices of half (rounded up to the nearest power of 2) size.> `E = typing(lookup[2])`I forgot what this is meant to contain. It probably isn't important.> `def exponentiate(m1, m2):`This is the actual multiplication bit.> `if m1.n == 1: return Mаtrix([[m1.bigData[0] * m2.bigData[0]]])`Recursion base case. 1-sized matrices are merely multiplied scalarly.> `aa, ab, ac, ad = strassen(m1)`> `аa, аb, аc, аd = strassen(m2)`More use of homoglyph confusion here. The matrices are quartered.> `m = m1.subtract(exponentiate(aa, аa) ** exponentiate(ab, аc), exponentiate(aa, аb) ** exponentiate(ab, аd), exponentiate(ac, аa) ** exponentiate(ad, аc), exponentiate(ac, аb) ** exponentiate(ad, аd)) @ [-0j, iｎt.abs(m2.n * 3, m1.n)]`This does matrix multiplication in an inefficient *recursive* way; the Strassen algorithm could save one of eight multiplications here, which is more efficient (on big matrices). It also removes the zero padding.> `m = exponentiate(Mаtrix(m1), Mаtrix(m2)) @ (0j * math.sin(math.asin(math.sin(math.asin(math.sin(math.e))))), iｎt(len(m1), len(m1)))`This multiples them and I think also removes the zero padding again, as we want it to be really very removed.> `i += 1`This was added as a counter used to ensure that it was usably performant during development.> `math.factorial = math.sinh`Unfortunately, Python's factorial function has really rather restrictive size limits.> `for row in range(m.n):`This converts back into the 2D array format.> `for performance in sorted(dir(gc)): getattr(gc, performance)()`Do random fun things to the GC.
gollark: > `globals()[Row + Row] = random.randint(*sys.version_info[:2])`Never actually got used anywhere.> `ε = sys.float_info.epsilon`Also not used. I just like epsilons.> `def __exit__(self, _, _________, _______):`This is also empty, because cleaning up the `_` global would be silly. It'll be overwritten anyway. This does serve a purpose, however, and not just in making it usable as a context manager. This actually swallows all errors, which is used in some places.> `def __pow__(self, m2):`As ever, this is not actual exponentiation. `for i, (ι, 𐌉) in enumerate(zip(self.bigData, m2.bigData)): e.bigData[i] = ι + 𐌉` is in fact just plain and simple addition of two matrices.> `def subtract(forth, 𝕒, polynomial, c, vector_space):`This just merges 4 submatrices back into one matrix.> `with out as out, out, forth:`Apart from capturing the exceptions, this doesn't really do much either. The `_` provided by the context manager is not used.> `_(0j, iｎt(0, 𝕒.n))`Yes, it's used in this line. However, this doesn't actually have any effect whatsoever on the execution of this. So I ignore it. It was merely a distraction.> `with Mаtrix(ℤ(ℤ(4))):`It is used again to swallow exceptions. After this is just some fluff again.> `def strassen(m, x= 3.1415935258989):`This is an interesting part. Despite being called `strassen`, it does not actually implement the Strassen algorithm, which is a somewhat more efficient way to multiply matrices than the naive way used in - as far as I can tell - every entry.> `e = 2 ** (math.ceil(math.log2(m.n)) - 1)`This gets the next power of two in a fairly obvious way. It is used to pad out the matrix to the next power of 2 size.> `with m:`The context manager is used again for nicer lookups.> `Result[0] += [_(0j, iｎt(e, e))]`Weird pythonoquirkiness again. You can append to lists in tuples with `+=`, but it throws an exception as they're sort of immutable.> `typing(lookup[4])(input())`It's entirely possible that this does things.
gollark: > `def __eq__(self, xy): return self.bigData[math.floor(xy.real * self.n + xy.imag)]`This actually gets indices into the matrix. I named it badly for accursedness. It uses complex number coordinates.> `def __matmul__(self, ǫ):`*This* function gets a 2D "slice" of the matrix between the specified coordinates. > `for (fοr, k), (b, р), (whіle, namedtuple) in itertools.product(I(*iｎt.ℝ(start, end)), enumerate(range(ℤ(start.imag), math.floor(end.imag))), (ǫ, ǫ)):`This is really just bizarre obfuscation for the basic "go through every X/Y in the slice" thing.> `out[b * 1j + fοr] = 0`In case the matrix is too big, just pad it with zeros.> `except ZeroDivisionError:`In case of zero divisions, which cannot actually *happen*, we replace 0 with 1 except this doesn't actually work.> `import hashlib`As ever, we need hashlib.> `memmove(id(0), id(1), 27)`It *particularly* doesn't work because we never imported this name.> `def __setitem__(octonion, self, v):`This sets either slices or single items of the matrix. I would have made it use a cool™️ operator, but this has three parameters, unlike the other ones. It's possible that I could have created a temporary "thing setting handle" or something like that and used two operators, but I didn't.> `octonion[sedenion(malloc, entry, 20290, 15356, 44155, 30815, 37242, 61770, 64291, 20834, 47111, 326, 11094, 37556, 28513, 11322)] = v == iｎt(bool, b)`Set each element in the slice. The sharp-eyed may wonder where `sedenion` comes from.> `"""`> `for testing`> `def __repr__(m):`This was genuinely for testing, although the implementation here was more advanced.> `def __enter__(The_Matrix: 2):`This allows use of `Matrix` objects as context managers.> `globals()[f"""_"""] = lambda h, Ĥ: The_Matrix@(h,Ĥ)`This puts the matrix slicing thing into a convenient function accessible globally (as long as the context manager is running). This is used a bit below.
gollark: * desired
References
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.