1. Clicking ▼&► to (un)fold the tree menu may facilitate locating what you want to find. 2. Videos embedded here do not necessarily represent my viewpoints or preferences. 3. This is just one of my several websites. Please click the category-tags below these two lines to go to each independent website.
# playlist (click the upper-left icon of the video)
source: JCCCvideo
The Great Books Mini-Lecture Series is designed to introduce you to watershed texts that have changed their readers’ views of the world. It’s a series of short talks on great books.
The Great Books series is sponsored by the JCCC English/Journalism Common Read program.
For more information on this and other happenings at the college, visit http://www.jccc.edu
source: European Graduate School Video Lectures 2017年4月15日 http://www.egs.edu Elissa Marder, Professor of Philosophy at The European Graduate School / EGS. Saas Fee, Switzerland. August 17 2016. Elissa Marder, in addition to being a professor of philosophy at The European Graduate School / EGS, is Chair of the French and Italian Departments, a professor of French and comparative literature, and formally affiliated with the Departments of Philosophy and Women Studies at Emory University in Atlanta, Georgia. Between 2001 and 2006, she was Director of the Emory Psychoanalytic Studies Program, of which she was also a founding member. She is a member of the executive committee of SIPP&ISSP (International Society of Psychoanalysis and Philosophy) and has been an International Fellow of the London Graduate School since its inception in 2010.
Elissa Marder received her BA from Cornell University and completed her PhD at Yale University in 1989 where she studied with Paul de Man, Shoshana Felman, Barbara Johnson, Fredric Jameson, and Jacques Derrida, among others. Her primary areas of interest include nineteenth and twentieth century French, British, and American literature; literary theory; psychoanalysis; film; photography; and feminist theory. She is currently working on a book on early nineteenth century French literature, as well as a major project on Walter Benjamin. Her book Dead Time: Temporal Disorders in the Wake of Modernity (Baudelaire and Flaubert) was published in 2001 by Stanford University Press. Her most recent book, The Mother in the Age of Mechanical Reproduction: Psychoanalysis, Photography, and Deconstruction, was published in 2012 by Fordham University Press. She is also the author of numerous articles in journals such as Yale French Studies, La Revue des sciences humaines, Camera Obscura, Diacritics, L'Esprit créateur, and Autrement. Professor Marder's work draws from the frameworks of both psychoanalysis and deconstruction but runs her own unique theoretical thread through the ideas, associations, and images touched upon in her writings. In her first book, Dead Time: Temporal Disorders in the Wake of Modernity (Baudelaire and Flaubert), she argues that by explicitly placing time and temporal structures at the core of their nineteenth century literary works, Baudelaire and Flaubert implicitly provided twentieth and twenty-first century readers with a vocabulary for describing some of the "temporal disorders" that continue to haunt contemporary culture. Inspired by Walter Benjamin's derivation of the shock experience from his readings of Baudelaire's poems, Dead Time undertakes literary readings of Les Fleurs du mal and Madame Bovary to find new ways of thinking about the changing experience of lived time in modern and postmodern culture.
In The Mother in the Age of Mechanical Reproduction: Psychoanalysis, Photography, Deconstruction, Elissa Marder explores her long-standing fascination with the uncanny status of the mother in literature, philosophy, psychoanalysis, film, and photography. Inspired in large part by Avital Ronell's The Telephone Book, she argues that the maternal body often serves as an unacknowledged reference point for modern media technologies such as photography and the telephone, which attempt to mimic its reproductive properties. As the incarnation of our first relation to the strange exile of language, this book suggests that the mother is an inherently literary figure, whose primal presence in literary texts opens us up to the unspeakable relation to our own birth and, in so doing, helps us give birth to new and fantasmatic images of futures that might otherwise have remained unimaginable. Most recently, Elissa Marder has begun work on a short book tentatively titled The Dream and the Guillotine: On Psycho-Photography and Other Fixations. Both dreams and the guillotine are related to photography. As Jacques Derrida and others have pointed out, Freud describes the dream work by comparing it to photographic processes. Furthermore, as has been well documented, the machinery and functioning of the guillotine was from the outset persistently identified with photography. The rapidity of the falling blade was likened to the action of the shutter in a camera, the necessary immobilization of the body was similar in both cases, and the guillotine and photography alike seemed to capture the moment at which a living body became fixed into a dead image. Another project, tentatively entitled Poetry By Other Means: Baudelaire's Afterlife and the late Writings of Walter Benjamin, picks up on some of the questions about poetry and temporality that Marder began to explore in Dead Time and takes them in new directions.
# click the upper-left icon to select videos from the playlist
source: Simons Institute 2015年12月8日 Computational Complexity of Low-Polynomial Time Problems https://simons.berkeley.edu/talks/set...
Nov. 30 – Dec. 3, 2015
Despite the widely demonstrated usefulness of the notion of NP-hardness, there are many situations in which it is not applicable. This is the case, for example, when the goal is to show hardness of problems that are known to have polynomial time solutions. For instance, in the context of massive data computation even a quadratic-time algorithm is considered inefficient, but for many interesting problems no sub-quadratic algorithms are known. It would be of great interest to give complexity-theoretic evidence that no such algorithms exist at all. Mimicking NP-hardness, one would want to say that a problem is hard because if it had a sub-quadratic time algorithm, then many other important problems would have such algorithms as well.
To this end, one needs more refined notions of reducibility between problems that preserve a designated running time. Such reductions (for sub-quadratic, sub-cubic and near-linear runtimes) have been found in a number of isolated contexts: between problems in computational geometry, combinatorial pattern matching and problems related to shortest paths in graphs. However, the overarching framework is still mostly missing. The purpose of the workshop is to bring together researchers interested in these questions, in order to share their insights and develop a future research agenda. One of the outcomes of the workshop will be a list of key open problems in the field.
For more information, please visit https://simons.berkeley.edu/workshops/complexity2015-3.
These presentations were supported in part by an award from the Simons Foundation.
# click the upper-left icon to select videos from the playlist
source: Simons Institute 2017年1月17日 Pseudorandomness Boot Camp
Organizers:
Jacob Fox (Stanford University), Ben Green (University of Oxford), Russell Impagliazzo (UC San Diego), Luca Trevisan (Simons Institute, UC Berkeley), Julia Wolf (University of Bristol), David Zuckerman (University of Texas, Austin).
The Boot Camp is intended to acquaint program participants with the key themes of the program. It will consist of five mini-courses spread over four days, as follows:
Luca Trevisan (UC Berkeley): Fundamental Techniques in Pseudorandomness
David Zuckerman (University of Texas at Austin): Extractors and Expanders
Raghu Meka (UCLA): Pseudorandom Generators
David Conlon (University of Oxford), Jacob Fox (Stanford University), and Yufei Zhao (University of Oxford): Pseudorandomness and Regularity in Graphs
Fernando Shao (University of Oxford) and Julia Wolf (University of Bristol): Arithmetic Applications of Pseudorandomness
For more information, please visit https://simons.berkeley.edu/workshops/pseudorandomness201...
These presentations were supported in part by an award from the Simons Foundation.
# click the upper-left icon to select videos from the playlist
source: Simons Institute 2017年1月23日 Foundations of Machine Learning Boot Camp
Organizers: Sanjoy Dasgupta (UC San Diego), Sanjeev Arora (Princeton University), Nina Balcan (Carnegie Mellon University), Peter Bartlett (UC Berkeley), Sham Kakade (University of Washington), Santosh Vempala (Georgia Institute of Technology).
The Boot Camp is intended to acquaint program participants with the key themes of the program. It will consist of five days of tutorial presentations, each with ample time for questions and discussion, as follows:
Elad Hazan (Princeton University): Optimization of Machine Learning
Andreas Krause (ETH Zürich) and Stefanie Jegelka (MIT): Submodularity: Theory and Applications
Emma Brunskill (Carnegie Mellon University): A Tutorial on Reinforcement Learning
Sanjoy Dasgupta (UC San Diego) and Rob Nowak (University of Wisconsin-Madison): Interactive Learning of Classifiers and Other Structures
Sergey Levine (UC Berkeley): Deep Robotic Learning
Tamara Broderick (MIT) and Michael Jordan (UC Berkeley): Nonparametric Bayesian Methods: Models, Algorithms, and Applications
Ruslan Salakhutdinov (Carnegie Mellon University): Tutorial on Deep Learning
Daniel Hsu (Columbia University): Tensor Decompositions for Learning Latent Variable Models
Percy Liang (Stanford University): Natural Language Understanding: Foundations and State-of-the-Art
For more information, please visit https://simons.berkeley.edu/workshops/machinelearning2017...
These presentations were supported in part by an award from the Simons Foundation.
# click the upper-left icon to select videos from the playlist
source: Simons Institute 2016年12月5日 Compositionality
The compositional description of complex objects is a fundamental feature of the logical structure of computation. The use of logical languages in database theory and in algorithmic and finite model theory provides a basic level of compositionality, but establishing systematic relationships between compositional descriptions and complexity remains elusive. Compositional models of probabilistic systems and languages have been developed, but inferring probabilistic properties of systems in a compositional fashion is an important challenge. In quantum computation, the phenomenon of entanglement poses a challenge at a fundamental level to the scope of compositional descriptions. At the same time, compositionally has been proposed as a fundamental principle for the development of physical theories. This workshop will focus on the common structures and methods centered on compositionality that run through all these areas.
For more information, please visit https://simons.berkeley.edu/workshops/logic2016-3
These presentations were supported in part by an award from the Simons Foundation.
# click the upper-left icon to select videos from the playlist
source: Simons Institute 2017年1月30日
These presentations were supported in part by an award from the Simons Foundation.
This workshop will focus on explicit constructions of graphs and functions with pseudorandom properties. There will be two main themes related to each object in the title. For expanders, these will be proofs of existence of expander graphs using lifts, a la Bilu-Linial and Marcus-Spielman-Srivastava, and the possibility of using the method to obtain explicit constructions of Ramanujan expanders of all degrees; and constructions of Cayley expanders and the group-theoretic results motivated by such results. For randomness extractors, these will be constructions of extractors for independent sources and their applications to the construction of Ramsey graphs and other objects; and constructions of extractors in other settings and their applications to pseudorandom generators, coding theory, cryptography and other areas of computer science.
For more information, please visit ttps://simons.berkeley.edu/workshops/pseudorandomness2017-1