Anissa Yuenming Mak
NEW YORK
Anissa Yuenming Mak, 18, of Oakland Gardens, submitted an Intel Science
Talent Search project in mathematics that involved graphs and algorithms. A
fundamental question that arises about an algorithm concerns its implementation:
how can we know that the computation is free of bugs? A certifying algorithm
gives evidence that the result of the computation is correct. The modular
decomposition of a graph is a useful way of describing a graph in terms of a
certain tree. Anissa provided a certification algorithm for modular
decomposition. Anissa attends Stuyvesant High School in New York City, where she
serves as the yearbook art editor. She frequently volunteers at the local
hospital, and practices Chinese calligraphy and graphic design. She also enjoys
exploring modular origami, and used graph theory to create a tri-color truncated
icosahedron, which resembled a soccer ball and consisted of twelve pentagons and
twenty hexagons. The daughter of Randy Kaiyin Mak and Polly Tzeying Mak, Anissa
was born in Hong Kong and speaks fluent Cantonese and Mandarin. She plans to attend
MIT to pursue a career in mathematical research.
|
