اس.ال. حکیمی: تفاوت میان نسخه‌ها

محتوای حذف‌شده محتوای افزوده‌شده

درخط

نسخهٔ ‏۲۵ فوریهٔ ۲۰۱۹، ساعت ۱۶:۲۹

سیف الله لوئیس حکیمی (زاده ۱۹۳۲ در مشهد - درگذشته ۲۳ ژوئن ۲۰۰۵)^[۱] ریاضیدان آمریکایی ایرانی‌تبار بود. استاد ممتاز بازنشسته در دانشگاه نورث وسترن، جایی که او ریاست بخش مهندسی برق از سال ۱۹۷۳ تا سال ۱۹۷۸ را برعهده داشت.^[۲] او نیز رئیس بخش مهندسی برق در دانشگاه کالیفرنیا، دیویس، از سال ۱۹۸۶ تا ۱۹۹۶ بود.^[۱]

او برای توصیف دنباله های درجه ای گراف های بی جهت^[۳]، به فرمول درآوردن مسئله درخت اشتاینر در شبکه ها ^[۴]، و برای کارش روی مکان‌یابی تسهیلات در شبکه ها شناخته شده است.^[۵]

منابع

↑ ^۱٫۰ ^۱٫۱ Pat Bailey (July 21, 2006). "Harold Olmo: Pioneering wine, grape scientist, and other obituaries". UCDavis. Retrieved 29 August 2017.
↑ Fine, Morris E. (ed.), Tech, the early years: An anthology of the history of the technological institute at Northwestern University from 1939 to 1969 (PDF), p. 103, archived from the original (PDF) on 2013-12-03.
↑ Allenby, R.B.J.T.; Slomson, Alan (2011), "Theorem 9.3: the Havel–Hakimi theorem", How to Count: An Introduction to Combinatorics, Discrete Mathematics and Its Applications (2nd ed.), CRC Press, p. 159, ISBN 9781420082616, A proof of this theorem was first published by Václav Havel ... in 1963 another proof was published independently by S. L. Hakimi.
↑ Hwang, F. K.; Richards, D. S.; Winter, P. (1992), The Steiner Tree Problem, Annals of Discrete Mathematics, Elsevier, p. 94, ISBN 9780080867939, The Steiner tree problem in networks was originally formulated by Hakimi and independently by Levin in 1971.
↑ Marianov, Vladimir; Serra, Daniel (2011), "Median problems in networks", in Eiselt, Horst A.; Marianov, Vladimir (eds.), Foundations of Location Analysis, International series in operations research & management science, vol. 155, Springer, pp. 39–59, doi:10.1007/978-1-4419-7572-0_3, ISBN 9781441975720. On p. 53, Marianov and Serra write "The impact of Hakimi's two contributions is hard to overstate. A common opinion among location researchers is that the paper by Hakimi (1964) strongly contributed to trigger the interest in location theory and analysis, and started a long string of related publications that does not seem to be decreasing."

[Davis-1] ۱٫۰ ^۱٫۱ Pat Bailey (July 21, 2006). "Harold Olmo: Pioneering wine, grape scientist, and other obituaries". UCDavis. Retrieved 29 August 2017.

[2] Fine, Morris E. (ed.), Tech, the early years: An anthology of the history of the technological institute at Northwestern University from 1939 to 1969 (PDF), p. 103, archived from the original (PDF) on 2013-12-03.

[3] Allenby, R.B.J.T.; Slomson, Alan (2011), "Theorem 9.3: the Havel–Hakimi theorem", How to Count: An Introduction to Combinatorics, Discrete Mathematics and Its Applications (2nd ed.), CRC Press, p. 159, ISBN 9781420082616, A proof of this theorem was first published by Václav Havel ... in 1963 another proof was published independently by S. L. Hakimi.

[4] Hwang, F. K.; Richards, D. S.; Winter, P. (1992), The Steiner Tree Problem, Annals of Discrete Mathematics, Elsevier, p. 94, ISBN 9780080867939, The Steiner tree problem in networks was originally formulated by Hakimi and independently by Levin in 1971.

[5] Marianov, Vladimir; Serra, Daniel (2011), "Median problems in networks", in Eiselt, Horst A.; Marianov, Vladimir (eds.), Foundations of Location Analysis, International series in operations research & management science, vol. 155, Springer, pp. 39–59, doi:10.1007/978-1-4419-7572-0_3, ISBN 9781441975720. On p. 53, Marianov and Serra write "The impact of Hakimi's two contributions is hard to overstate. A common opinion among location researchers is that the paper by Hakimi (1964) strongly contributed to trigger the interest in location theory and analysis, and started a long string of related publications that does not seem to be decreasing."

[۱]

[۲]

[۳]

[۴]

[۵]

@@ خط ۱: / خط ۱: @@
 '''سیف الله لوئیس حکیمی''' (زاده ۱۹۳۲ در [[مشهد]] - درگذشته  ۲۳ ژوئن ۲۰۰۵)<ref name="Davis">{{Cite web|url=https://www.ucdavis.edu/news/harold-olmo-pioneering-wine-grape-scientist-and-other-obituaries/|title=Harold Olmo: Pioneering wine, grape scientist, and other obituaries|date=July 21, 2006|accessdate=29 August 2017|website=UCDavis|last=Pat Bailey}}</ref> ریاضیدان آمریکایی ایرانی‌تبار بود. استاد ممتاز بازنشسته در [[دانشگاه نورت‌وسترن|دانشگاه نورث وسترن]]، جایی که او ریاست بخش [[مهندسی برق]] از سال ۱۹۷۳ تا سال ۱۹۷۸ را برعهده داشت.<ref>{{Citation|title=Tech, the early years: An anthology of the history of the technological institute at Northwestern University from 1939 to 1969|url=http://www.mccormick.northwestern.edu/100/pdfbooks/tech_anthology1/files/tech%20anthology%20i.pdf|archiveurl=https://web.archive.org/web/20131203073111/http://www.mccormick.northwestern.edu/100/pdfbooks/tech_anthology1/files/tech%20anthology%20i.pdf|deadurl=yes|page=103|editor-last=Fine|editor-first=Morris E.|archivedate=2013-12-03}}.</ref> او نیز رئیس بخش [[مهندسی برق]] در [[دانشگاه کالیفرنیا، دیویس]]، از سال ۱۹۸۶ تا ۱۹۹۶ بود.<ref name="Davis" />
+او برای توصیف دنباله های درجه ای گراف های بی جهت<ref>{{citation|title=How to Count: An Introduction to Combinatorics|edition=2nd|series=Discrete Mathematics and Its Applications|first1=R.B.J.T.|last1=Allenby|first2=Alan|last2=Slomson|publisher=CRC Press|year=2011|isbn=9781420082616|page=159|url=https://books.google.com/books?id=1oyMQGHqv_0C&pg=PA159|contribution=Theorem 9.3: the Havel–Hakimi theorem|quote=A proof of this theorem was first published by [[V. J. Havel|Václav Havel]] ... in 1963 another proof was published independently by S. L. Hakimi}}.</ref>، به فرمول درآوردن مسئله درخت اشتاینر در شبکه ها
+<ref>{{citation|title=The Steiner Tree Problem|series=Annals of Discrete Mathematics|first1=F. K.|last1=Hwang|first2=D. S.|last2=Richards|first3=P.|last3=Winter|publisher=Elsevier|year=1992|isbn=9780080867939|page=94|url=https://books.google.com/books?id=-_yKbY3X_jUC&pg=PA94|quote=The Steiner tree problem in networks was originally formulated by Hakimi and independently by Levin in 1971.}}</ref>، و برای کارش روی مکان‌یابی تسهیلات در شبکه ها شناخته شده است.<ref>{{citation|title=Foundations of Location Analysis|volume=155|pages=39–59|series=International series in operations research & management science|editor1-first=Horst A.|editor1-last=Eiselt|editor2-first=Vladimir|editor2-last=Marianov|publisher=Springer|year=2011|isbn=9781441975720|doi=10.1007/978-1-4419-7572-0_3|contribution=Median problems in networks|first1=Vladimir|last1=Marianov|first2=Daniel|last2=Serra}}. On [https://books.google.com/books?id=6bQ8JJ_Rx6sC&pg=PA53 p.&nbsp;53], Marianov and Serra write "The impact of Hakimi's two contributions is hard to overstate. A common opinion among location researchers is that the paper by Hakimi (1964) strongly contributed to trigger the interest in location theory and analysis, and started a long string of related publications that does not seem to be decreasing."</ref>
 == منابع ==
 {{پانویس|۲|چپ‌چین=بله}}