Dear group,
As you can tell, if I get stranded in Las Vegas due to snow, I end up
writing a lot of e-mail! Sorry for the day-spam.
I think our website has to be even better, especially with more content. So
if you have any graphics for the posters, please also think of making
graphics for the website (for updating our research interests page). Also,
some of you have absent or small personal pages. Remember this is your
window to the world, so you might want to spend some time making your own
wiki page nice (of course, this is not a requirement, but it is for your
benefit).
In any case, I updated the group news section, please feel free to add any
news that you want! and let's think of new designs, for example look at the
brain on a chip guys, their site is a notch above ours, do you guys like it?
http://bioengineering.stanford.edu/faculty/boahen.html
Alan
--
Alan Aspuru-Guzik
Assistant Professor
Department of Chemistry and Chemical Biology
12 Oxford Street
Harvard University
Cambridge, MA 02138
Tel: (617)384-8188
Group URL: http://aspuru.chem.harvard.edu
Dear group,
I need two student volunteers to do the posters for this year!
I propose to create them in Open Office Draw, Powerpoint or similar, and
then re-cycle them over the years adding new stuff.
Who wants to volunteer? People would have to send them pictures and slides
of what we are doing and I think we can put together something really fast.
Cheers,
Alan
---------- Forwarded message ----------
From: Kathy Weldon <weldon(a)chemistry.harvard.edu>
Date: Feb 14, 2007 7:03 PM
Subject: G-0 Visits: 4:30-5:30pm Poster Session
To: faculty(a)chemistry.harvard.edu
Cc: faculty_staff(a)chemistry.haravrd.edu
Dear Faculty,
In preparation for the March G-0 visit weekends, a poster session is being
planned to showcase the research being done in our department. Each research
group may include up to two posters (and two official student reps).
Please plan on the:
G-0 Poster Session
two Fridays: March 16 and March 23
4:30-5:30 pm, Department Center
for: G-0s and current graduate student representatives, selected by P.I.s
Please select two students in your group whom you would like to present the
posters. I will then coordinate the logistics with the graduate student
representatives directly when we get a bit closer to the visit. I wanted to
give you and your students a heads-up now, as I know it takes time to put a
poster together.
Sincerely,
Kathy
Kathy Weldon
Graduate Program Administrator
Admissions & Industrial Recruiting
Harvard University
Department of Chemistry & Chemical Biology
12 Oxford Street
Cambridge, MA 02138
(617) 496-3208 (voice)
(617) 496-5618 (fax)
weldon(a)chemistry.harvard.edu
--
Alan Aspuru-Guzik
Assistant Professor
Department of Chemistry and Chemical Biology
12 Oxford Street
Harvard University
Cambridge, MA 02138
Tel: (617)384-8188
Group URL: http://aspuru.chem.harvard.edu
Dear Sergio,
I am available for the whole day except 12.00-1.30 when I give a talk about
Wikis in education. So what we could if you want to arrive before noon, is
to meet (let's say 11?) then you guys can go to lunch while I go talk about
Wikis, and then I meet you after and we have a group meeting/presentation
with the people involved in the project (Sule, Laura, interested students,
etc.)
Alan
On 2/13/07, Sergio Granados <granados.sergio(a)mail.pse.umass.edu> wrote:
>
>
> Alan:
>
> Please find attached a report summarizing the latest results of our work
> with nanocomposite alumina-proton conductive polymer membranes. We can
> discuss the data in more detail on Friday.
>
> Chris and I were wondering about the schedule for Friday, what time would
> you like us to get to Harvard?
>
> Cheers,
>
> Sergio.
>
>
--
Alan Aspuru-Guzik
Assistant Professor
Department of Chemistry and Chemical Biology
12 Oxford Street
Harvard University
Cambridge, MA 02138
Tel: (617)384-8188
Group URL: http://aspuru.chem.harvard.edu
Harvard University
Computer Science Colloquium Series
33 Oxford St., Cambridge, MA 02138
Colloquium
Automatic termination proofs for software
Byron Cook
Microsoft
http://research.microsoft.com/~bycook
Thursday, March 1, 2007
4:00PM
Maxwell Dworkin G125
(Ice Cream at 3:30PM - Maxwell Dworkin 2nd Floor Lounge Area)
Abstract
I will describe recent advances in the area of automatic program
termination analysis. I will also discuss TERMINATOR, the Microsoft
tool which implements these recent advances. We've recently used
TERMINATOR to prove that Windows device driver dispatch routines always
return control back to their caller. TERMINATOR has also found a number
of critical termination bugs in device drivers.
Host: Professor Norman Ramsey
_______________________________________________
Colloquium mailing list
Colloquium(a)deas.harvard.edu
https://lists.deas.harvard.edu/mailman/listinfo/colloquium
_______________________________________________
iic-seminars mailing list
iic-seminars(a)calists.harvard.edu
http://calists.harvard.edu/mailman/listinfo/iic-seminars
Initiative in Innovative Computing @ Harvard
Seminar Series
Wednesday, February 14, 2007; 4:00pm
60 Oxford Street, Room 330
Eamonn Keogh, Associate Professor, Computer Science & Engineering
Department, University of California - Riverside
Seminar Title: Algorithms and Representations for Mining Massive
Collections of Time Series and Shapes
Abstract
To date, the vast majority of research on time series and shape data
mining has focused on similarity search and clustering. I believe
that these problems should now be regarded as essentially solved. In
particular, there are now fast exact techniques for searching and
clustering patterns under both the Euclidean distance and Dynamic
Time Warping, the two most useful distance measures. However, from a
knowledge discovery viewpoint, there are much more interesting
problems, the detection of previously /unknown/ patterns and
relationships in time series and shape databases. Two concrete
examples are finding the most unusual objects (discord discovery) and
finding repeated objects (motif discovery).
While there are many representations that can be used to solve these
problems (i.e. wavelets, Fourier methods etc), in this talk I argue
that solutions which are scalable to massive datasets will require /
symbolic/ representations. The talk will be illustrated with examples
from anthropology, law enforcement, biology and mining of historical
texts.
Upcoming IIC seminars
Continue to stay up to date with our IIC Seminar Schedule.
Parking is available in the 52 Oxford Street Garage. Please tell the
attendant that you are attending the IIC Seminar.
_______________________________________________
iic-seminars mailing list
iic-seminars(a)calists.harvard.edu
http://calists.harvard.edu/mailman/listinfo/iic-seminars
my.harvard calendar reminder:
Event Information:
Date : 2/14/2007
Start Time : 02:30 PM
End Time : 04:00 PM
Title : Modeling Neocortical Networks with Short-term Synaptic Plasticity (Misha Tsodyks)
Description : COMPUTATIONAL NEUROSCIENCE COLLOQUIUM
Modeling Neocortical Networks with Short-term Synaptic Plasticity
Misha Tsodyks
Weizmann Institute
Wednesday, February 14, 2.30pm
Maxwell Dworkin 115
ABSTRACT
Recurrent connections in neocortical circuits exhibit pronounced activity-dependent short-term plasticity--synaptic depression/facilitation--but the role it plays in information processing is still not clear. Recent experiments indicate that synaptic properties may systematically change when moving along the information stream from the sensory areas towards the prefrontal cortex. In particular, it was found that connections between pyramidal neurons in the prefrontal cortex are more diverse, with substantial fraction of them exhibiting strong facilitation, as opposed to corresponding connections in the sensory areas that are predominantly depressing. To uncover the potential functional implications of these diverse properties, we analyzed two different recurrent networks. In the first study, we describe the information processing via temporal neuronal synchronization (which we call 'Population Spikes') in network with synaptic depression. In particular, we constructed a neura
l network model of primary auditory cortex that responds to complex sounds with specific spatio-temporal pattern of population spikes at different iso-frequency columns. In the second study, we analyzed the attractor neural network model of persistent activity with synaptic facilitation. Depending on the strength of synaptic facilitation, the network exhibits qualitatively different regimes of convergence to persistent activity sate, from fast irreversible transition with population spike, to slow reversible transition. We then considered the attractor neural network of interacting sub-populations with different synaptic properties, and observed an emerging new selectivity of the resulting persistent state to the temporal profile of the triggering input.
Host: Leslie Valiant
Location : Maxwell Dworkin G115
URL :
Phone :
Calendar : Computer Science Colloquium Series
_______________________________________________
Colloquium mailing list
Colloquium(a)deas.harvard.edu
https://lists.deas.harvard.edu/mailman/listinfo/colloquium
_______________________________________________
iic-seminars mailing list
iic-seminars(a)calists.harvard.edu
http://calists.harvard.edu/mailman/listinfo/iic-seminars
COMPUTATIONAL NEUROSCIENCE COLLOQUIUM
Modeling Neocortical Networks with Short-term Synaptic Plasticity
Misha Tsodyks
Weizmann Institute
Wednesday, February 14, 2.30pm
Maxwell Dworkin 115
ABSTRACT
Recurrent connections in neocortical circuits exhibit pronounced
activity-dependent short-term plasticity--synaptic
depression/facilitation--but the role it plays in information processing
is still not clear. Recent experiments indicate that synaptic properties
may systematically change when moving along the information stream from
the sensory areas towards the prefrontal cortex. In particular, it was
found that connections between pyramidal neurons in the prefrontal
cortex are more diverse, with substantial fraction of them exhibiting
strong facilitation, as opposed to corresponding connections in the
sensory areas that are predominantly depressing. To uncover the
potential functional implications of these diverse properties, we
analyzed two different recurrent networks. In the first study, we
describe the information processing via temporal neuronal
synchronization (which we call 'Population Spikes') in network with
synaptic depression. In particular, we constructed a neural network
model of primary auditory cortex that responds to complex sounds with
specific spatio-temporal pattern of population spikes at different
iso-frequency columns. In the second study, we analyzed the attractor
neural network model of persistent activity with synaptic facilitation.
Depending on the strength of synaptic facilitation, the network exhibits
qualitatively different regimes of convergence to persistent activity
sate, from fast irreversible transition with population spike, to slow
reversible transition. We then considered the attractor neural network
of interacting sub-populations with different synaptic properties, and
observed an emerging new selectivity of the resulting persistent state
to the temporal profile of the triggering input.
Host: Leslie Valiant
_______________________________________________
Colloquium mailing list
Colloquium(a)deas.harvard.edu
https://lists.deas.harvard.edu/mailman/listinfo/colloquium
_______________________________________________
iic-seminars mailing list
iic-seminars(a)calists.harvard.edu
http://calists.harvard.edu/mailman/listinfo/iic-seminars
Initiative in Innovative Computing @ Harvard
Seminar Series
Wednesday, February 14, 2007; 4:00pm
60 Oxford Street, Room 330
Eamonn Keogh, Associate Professor, Computer Science & Engineering
Department, University of California – Riverside
Seminar Title: Algorithms and Representations for Mining Massive
Collections of Time Series and Shapes
Abstract
To date, the vast majority of research on time series and shape data
mining has focused on similarity search and clustering. I believe
that these problems should now be regarded as essentially solved. In
particular, there are now fast exact techniques for searching and
clustering patterns under both the Euclidean distance and Dynamic
Time Warping, the two most useful distance measures. However, from a
knowledge discovery viewpoint, there are much more interesting
problems, the detection of previously unknown patterns and
relationships in time series and shape databases. Two concrete
examples are finding the most unusual objects (discord discovery) and
finding repeated objects (motif discovery).
While there are many representations that can be used to solve these
problems (i.e. wavelets, Fourier methods etc), in this talk I argue
that solutions which are scalable to massive datasets will require
symbolic representations. The talk will be illustrated with examples
from anthropology, law enforcement, biology and mining of historical
texts.
Upcoming IIC seminars
Continue to stay up to date with our IIC Seminar Schedule.
Please Note: The February 13, 2007 National Virtual Observatory Panel
has been postponed.
_______________________________________________
iic-seminars mailing list
iic-seminars(a)calists.harvard.edu
http://calists.harvard.edu/mailman/listinfo/iic-seminars