Discovering and demonstrating patterns

Harvey Mudd College\u27s President Maria Klawe shares her personal journey in combining a love of mathematics and art

Alphabetic Minimax Trees of Degree at Most t*

Problems in circuit fan-out reduction motivate the study of constructing various types of weighted trees that are optimal with respect to maximum weighted path length. An upper bound on the maximum weighted path length and an efficient construction algorithm will be presented for trees of degree at most t, along with their implications for circuit fan-out reduction

Some Graph-Colouring Theorems with Applications to Generalized Connection Networks

With the aid of a new graph-colouring theorem, we give a simple explicit construction for generalized n-connectors with 2k - 1 stages and O( n1 + 1 / k (log n )( k - 1)/ 2 ) edges. This is asymptotically the best explicit construction known for generalized connectors

On Monotone Formulae with Restricted Depth

We prove a hierarchy theorem for the representation of monotone Boolean functions by monotone Boolean functions by monotone formulae with restricted depth. Specifically, we show that there are functions with Πk-formulae of size n for which every Σk-formula has size exp Ω(n1/(k-1)). A similar lower bound applies to concrete functions such as transitive closure and clique. We also show that any function with a formula of size n (and any depth) has a Σk-formula of size exp O(n1/(k-1)). Thus our hierarchy theorem is the best possible

Generalized ramsey theory for graphs, x: double stars

The double star S(n, m), where n [ges] m [ges] 0, is the graph consisting of the union of two stars K1,n and K1,m together with a line joining their centers. Its ramsey number r(S(n, m)) is the least number p such that there is a monochromatic copy of S(n, m) in any 2-coloring of the edges of Kp. It is shown that r(S(n, m)) = max (2n + 1, n + 2m + 2) if n is odd and m[les]2 and r(S(n, m)) = max (2n + 2, n + 2m + 2) otherwise, for n [les] [radical sign]2m or n [ges] 3m.Peer Reviewedhttp://deepblue.lib.umich.edu/bitstream/2027.42/23705/1/0000677.pd

Getting More Women into Technology Careers and Why It Matters

Presented on February 24, 2015 at 4:00 p.m. in the Clary Theater, Bill Moore Student Success Center on the Georgia Tech campus.Dr. Maria Klawe began her tenure as Harvey Mudd College's (HMC) fifth President in 2006. A renowned computer scientist and scholar, President Klawe is the first woman to lead the College since its founding in 1955. Prior to joining HMC, she served as Dean of Engineering and Professor of Computer Science at Princeton University. She received her Ph.D. (1977) and B.Sc. (1973) in mathematics from the University of Alberta. Klawe has made significant research contributions in numerous areas of mathematics and computer science. Dr. Klawe is one of the ten members of the board of Microsoft Corporation, a board member of Broadcom Corporation, and of the nonprofit Math for America. She is also a fellow of the American Academy of Arts & Sciences and a trustee for the Mathematical Sceinces Research Institute in Berkeley. In addition she is a member of the Stanford Engineering Advisory Council, the Advisory Council for the Computer Science Teachers Association, and the Canada Excellence Research Chairs Selection Board. She is the recipient of the 2014 Women of Vision, Anita Borg Institute of Excellence Award for Leadership, and appears on Fortune's 2014 list of the World's 50 Greatest Leaders.Runtime: 81:36 minutesOver the past decade the participation of females in the tech industry has declined rather than advanced. This is unfortunate for young women because of the incredible career opportunities, for the tech industry because of the loss of incoming talent, and for society because of the loss of diversity of perspective among tech teams. I will talk about the reasons why women tend not to major in computer technology fields and how Harvey Mudd College dramatically increased the number of females majoring in computer science, from 10% of the majors to 40% over a three year period.Georgia Institute of Technology. College of Computin

Is "edutainment" an oxymoron?

Item consists of a digitized copy of an audio recording of a Vancouver Institute lecture given by Maria Klawe on November 4, 1995. Original audio recording available in the University Archives (UBC AT 1964).Other UBCUnreviewedOthe

Computer Games, Education And Interfaces: The E-GEMS Project

For the past six years the E-GEMS project has studied the design and use of computer games and activities for mathematics education in grades 4 to 8. Our research has involved researchers in education and computer science, professional game developers, teachers and thousands of children. The outcomes of this collaboration include a wide range of research studies as well as innovative prototype games and a successful commercial product. Our results demonstrate that games can be very effective in increasing both motivation and achievement in mathematics learning. They also pinpoint the critical importance of detailed elements of game design, the role of the teacher, and the integration of computer games with other forms of mathematics education. Finally our work has identified important differences, as well as similarities, in girls' and boys' interactions with games and computers. In this paper we highlight some of the recent E-GEMS work with particular attention to the aspects related to interfaces and HCI