| 词条 | Ileana Streinu |
| 释义 |
| name = Ileana Streinu | image = Ileana Streinu in Limerick.jpg | image_size = 200px | alt = | caption = | birth_date = | birth_place = | death_date = | death_place = | residence = | citizenship = | nationality = | fields = Computer Science, Mathematics | workplaces = Smith College | alma_mater = University of Bucharest Rutgers University | doctoral_advisor = Solomon Marcus William L. Steiger | doctoral_students = | notable_students = | known_for = Work on kinematics, structural rigidity | author_abbrev_bot = | author_abbrev_zoo = | signature = | signature_alt = | footnotes = | spouse = }} Ileana Streinu is a Romanian-American computer scientist and mathematician, the Charles N. Clark Professor of Computer Science and Mathematics at Smith College in Massachusetts.[1] She is known for her research in computational geometry, and in particular for her work on kinematics and structural rigidity. BiographyStreinu did her undergraduate studies at the University of Bucharest in Romania. She earned two doctorates in 1994, one in mathematics and computer science from the University of Bucharest under the supervision of Solomon Marcus and one in computer science from Rutgers University under the supervision of William L. Steiger.[1][2] She joined the Smith computer science department in 1994, was given a joint appointment in mathematics in 2005, and became the Charles N. Clark Professor in 2009.[1] She also holds an adjunct professorship in the computer science department at the University of Massachusetts Amherst.[3] At Smith, Streinu is director of the Biomathematical Sciences Concentration[4][5] and has been the co-PI on a million-dollar grant shared between four schools to support this activity.[6] Awards and honorsIn 2006, Streinu won the Grigore Moisil Award of the Romanian Academy for her work with Ciprian Borcea using complex algebraic geometry to show that every minimally rigid graph with fixed edge lengths has at most 4n different embeddings into the Euclidean plane, where n denotes the number of distinct vertices of the graph.[7]{{sfn|Borcea|Streinu|2004}} In 2010, Streinu won the David P. Robbins Prize of the American Mathematical Society for her combinatorial solution to the carpenter's rule problem. In this problem, one is given an arbitrary simple polygon with flexible vertices and rigid edges, and must show that it can be manipulated into a convex shape without ever introducing any self-crossings. Streinu's solution augments the input to form a pointed pseudotriangulation, removes one convex hull edge from this graph, and shows that this edge removal provides a single degree of freedom allowing the polygon to be made more convex one step at a time.[8][9]{{sfn|Streinu|2005}} In 2012 she became a fellow of the American Mathematical Society.[10] Selected publications
| last1 = Borcea | first1 = Ciprian | last2 = Streinu | first2 = Ileana | doi = 10.1007/s00454-003-2902-0 | issue = 2 | journal = Discrete and Computational Geometry | mr = 2060642 | pages = 287–303 | title = The number of embeddings of minimally rigid graphs | volume = 31 | year = 2004| arxiv = math/0207126
| last = Streinu | first = Ileana | doi = 10.1007/s00454-005-1184-0 | issue = 4 | journal = Discrete and Computational Geometry | mr = 2173930 | pages = 587–635 | title = Pseudo-triangulations, rigidity and motion planning | volume = 34 | year = 2005}}. References1. ^1 2 Curriculum vitae{{dead link|date=March 2018 |bot=InternetArchiveBot |fix-attempted=yes }}, retrieved 2012-03-06. 2. ^{{mathgenealogy|id=53451}} 3. ^UMass Department of Computer Science Faculty Directory, retrieved 2012-03-06. 4. ^{{citation|url=http://alumnae.smith.edu/cms/?smithstories=unlocking-the-secrets-of-life|title=Unlocking the Secrets of Life: Biology, math, technology converge in a hot new field|first=Elise|last=Gibson|publisher=Alumnae Association of Smith College|date=December 2011|accessdate=2012-03-06}}. 5. ^Smith Biomathematical Sciences Concentration, retrieved 2012-03-06. 6. ^{{citation|url=http://www.smithsophian.com/news/national-science-foundation-awards-smith-1-million-biomathematics-grant-1.2590101|title=National Science Foundation awards Smith $1 million biomathematics grant|first=Kelsey|last=Cummings|date=September 14, 2011|journal=The Sophian|deadurl=yes|archiveurl=https://archive.is/20120910163716/http://www.smithsophian.com/news/national-science-foundation-awards-smith-1-million-biomathematics-grant-1.2590101|archivedate=September 10, 2012|df=}}. 7. ^{{citation|url=http://www.smith.edu/news/2006-07/PeopleNews1-2-07.html|title=People News|publisher=Smith College|date=January 2, 2007|accessdate=2012-03-06}}. 8. ^{{citation|contribution=David P. Robbins Prize|pages=37–38|title=January 2010 Prizes and Awards|publisher=American Mathematical Society|date=January 14, 2010|url=http://www.ams.org/profession/prizebooklet-2010.pdf}}. 9. ^{{citation|url=http://www.smith.edu/newsoffice/releases/NewsOffice09-062.html|title=Smith College Professor Recognized for Her Groundbreaking Mathematical Research|publisher=Smith College|date=January 14, 2010}}. 10. ^List of Fellows of the American Mathematical Society, retrieved 2013-08-05. External links
18 : Year of birth missing (living people)|Living people|American computer scientists|Romanian emigrants to the United States|20th-century American mathematicians|21st-century American mathematicians|Romanian computer scientists|Romanian women computer scientists|Romanian mathematicians|Women computer scientists|American women mathematicians|University of Bucharest alumni|Rutgers University alumni|Smith College faculty|Researchers in geometric algorithms|Fellows of the American Mathematical Society|20th-century women mathematicians|21st-century women mathematicians |
| 随便看 |
开放百科全书收录14589846条英语、德语、日语等多语种百科知识，基本涵盖了大多数领域的百科知识，是一部内容自由、开放的电子版国际百科全书。