Yasuhiro Yamada

Yasuhiro Yamada (山田 泰寛, Yamada Yasuhiro, February 13, 1968 – April 8, 2013) was a Japanese football player.

Yasuhiro Yamada
山田 泰寛
Personal information
Full name Yasuhiro Yamada
Date of birth (1968-02-13)February 13, 1968
Place of birth Hiroshima, Hiroshima, Japan
Date of death April 8, 2013(2013-04-08) (aged 45)
Place of death Shizuoka, Shizuoka, Japan
Height 1.74 m (5 ft 8 12 in)
Playing position(s) Defender
Youth career
1983–1985 Tokai University Daiichi High School
1986–1989 Waseda University
Senior career*
Years Team Apps (Gls)
1990–1991 Yanmar Diesel 14 (0)
1992–1995 Shimizu S-Pulse 31 (0)
Total 45 (0)
* Senior club appearances and goals counted for the domestic league only

Playing career

Yamada was born in Hiroshima on February 13, 1968. After graduating from Waseda University, he joined Yanmar Diesel in 1990. He played many matches from first season. In 1992, he moved to new club Shimizu S-Pulse. He played as left side back and the club won the 2nd place 1992 and 1993 J.League Cup. He retired end of 1995 season.

Coaching career

After retirement, Yamada started coaching career at Shimizu S-Pulse in 1996. He coached youth team until 1997. In 2000, he became a manager for new university, Fuji Tokoha University. In April 2013, the university was integrated into Tokoha University and he managed Tokoha University.

On April 8, 2013, Yamada died of liver cancer in Shizuoka at the age of 45.[1][2]

Club statistics

Club performance League Cup League Cup Total
Season Club League AppsGoals AppsGoals AppsGoals AppsGoals
Japan League Emperor's Cup J.League Cup Total
1990/91Yanmar DieselJSL Division 2140140
1992Shimizu S-PulseJ1 League-2020
199330006090
19942600010270
19952000-20
Total 4500090540
gollark: I actually stole this particular quicksort from a r/haskell post talking about it.
gollark: ```lisp (let (partition_rec xs pred acc) (cond ((= xs '()) acc) (true (partition_rec (tail xs) pred (cond ((pred (head xs)) (list (cons (head xs) (head acc)) (snd acc))) (true (list (head acc) (cons (head xs) (snd acc)))) ))) )) (let (qsort xs cont) (cond ((= xs '()) (cont '())) (true (do (let h (head xs)) (let t (tail xs)) (let part_result (partition_rec t (lambda (x) (< x h)) '(() ()))) (qsort (head part_result) (lambda (ls) (qsort (snd part_result) (lambda (rs) (cont (+ ls (list h) rs)))))) )) ))```These all have to be done tail recursively or it could overflow.
gollark: Continuation passing style quicksort in a hilariously slow interpreter.
gollark: It manages *1* second, which is great.
gollark: When writing osmarkslisp™, I cared about performance to the extent that it would sort a list of 200 integers in under 5 seconds.

References


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