### Special Lecture Archives for Academic Year 2015

#### See information below.

When: Mon, July 20, 2015 - 9:00am

Where: (CSIC Building) Horwitz lecture room CSI 1115

Speaker: July 20 - August 7, 2015: Summer Graduate Program on "Modern Harmonic Analysis and Applications" () - http://www.norbertwiener.umd.edu/Education/IMA2015/

Abstract: July 20 - August 7, 2015: Summer Graduate Program on “Modern Harmonic Analysis and Applications” at the University of Maryland organized by the Norbert Wiener Center with support from IMA and NSF.

Full announcement and schedule at:

http://www.norbertwiener.umd.edu/Education/IMA2015/

Lectures will take place in the CSIC building, Room 1115.

WEEK 1 - Lecturers: Anna Gilbert (UM), Chris Heil (Georgia Tech), Nate Strawn (Georgetown University), Radu Balan, John Benedetto, Wojtek Czaja, Kasso Okoudjou (UMD).

#### Focused Research Group on Hodge Theory, Moduli and Representation Theory: Workshop 4

When: Sat, August 22, 2015 - 10:00am

Where: Physics 1303

Speaker: Various Speakers () - http://www2.math.umd.edu/~pbrosnan/frg/frg4.html

Abstract: Conference continuation from 8/21 - see link for details.

http://www2.math.umd.edu/~pbrosnan/frg/frg4.html

#### Graph Theory for Network Communication

When: Fri, October 2, 2015 - 4:00pm

Where: MTH 1310

Speaker: Amanda Streib (Institute for Defense Analyses - Center for Computing Sciences (IDA/CCS)) -

Abstract: In high performance computing, large computations are performed in parallel on a network of computer processors. Periodically, these processors must communicate via network links that can only send one message at a time. We assume that every node wants to send a message to every other node, and try to schedule this communication as efficiently as possible. It turns out that many common HPC architectures can be represented as Cayley graphs, and we can take advantage of the algebraic structure of these graphs to simplify the problem. In the case of diameter 2 networks, we reduce the problem to a job-shop scheduling problem and we find efficient schedules using a standard algorithm for finding perfect matchings in a bipartite graph.

#### TBA

When: Fri, April 8, 2016 - 1:00pm

Where: TBA

Speaker: Eric Horvitz (Microsoft) and DJ Patil (White House) () -

Abstract: TBA

Please note that the time is incorrect as posted here.

When the time is decided, it will be updated.

#### Positive Solutions for Boundary Value Problems with Fractional Order

When: Fri, April 22, 2016 - 1:00pm

Where: Math 3206

Speaker: Professor Hedia Benaouda from the University of Tiaret, Algeria

#### The science and the engineering of intelligence

When: Thu, April 28, 2016 - 4:00pm

Where: Physics 1412

Speaker: Tomaso Poggio (MIT) - https://mcgovern.mit.edu/principal-investigators/tomaso-poggio

Abstract: http://www-math.umd.edu/research/kirwan-undergraduate-lectures.html