LaVerne Carter

LaVerne Carter (née Thompson; July 30, 1925 – March 8, 2012), was an American professional bowler.

Career

Born in Brentwood, Missouri as Laverne Thompson, Carter moved to Tucson as a teenager, and ultimately to Los Angeles, where she acquired the nickname "The Blonde Bombshell" for her beauty and feisty antics on the lanes. In 1947, she began hosting an instructional and exhibition series known as "Bowl with Laverne", which was hosted by various bowling centers across the United States over the next seven years.[1]

Carter won several singles, doubles, and team tournaments between 1951 and 1974 for the various bowling organizations that existed then. Along with then-husband Don Carter, she was one of the founding members of the Professional Bowlers Association (PBA) in 1958, for which she was given the informal title of "The First Lady of the PBA", and she was one of the founding members of the Professional Women's Bowling Association (PWBA) in 1960.

Awards

The Bowling Writers Association of America named her Bowler of the Year in 1964.[2] In that same year, she was named to the Women's All-American Team by Bowlers Journal. Carter was elected to the United States Bowling Congress (USBC) Hall of Fame in 1977 and the PWBA Hall of Fame in 1995.[1]

Personal life

Carter was married twice. The first was to Bill Haverly, by whom she had a daughter, Cayce (1950). Her second marriage was to bowler Don Carter, from 1953-64, by whom she had a son, Jim (1954). After her divorce in 1964, she moved to Las Vegas, where she lived until she moved to Florida in 2005.

Carter died of heart failure on March 8, 2012, two months after her former husband Don Carter. She is survived by both children, three grandchildren and five great-grandchildren.[1]

gollark: It allocates memory and doesn't consider it a side effect.
gollark: I didn't do any horrible homoglyph hacks with THAT.
gollark: It uses the function, yes.
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.

References
  1. "Former "First Lady of PBA" LaVerne Carter Dies". March 9, 2012.
  2. "LaVerne Carter, USBC Hall of Famer, dies". March 9, 2012.


This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.