1. Sara Marcus (part 2 of 2): "Girls to the Front: A Call to Arms," October 11, 2011 at UMD

    28:53

    from WMST MultimediaStudio / Added

    13 Plays / / 0 Comments

    Sara Marcus: "Girls to the Front: A Call to Arms," Women's Studies Multimedia Studio, University of Maryland, College Park, October 11, 2011, part 2 of 2.

    + More details
    • Obesity Summit Announcement - CNS-TV

      01:36

      from UMB News / Added

      7 Plays / / 0 Comments

      + More details
      • Childhood Obesity - Fox 45 Cover Story

        04:16

        from UMB News / Added

        33 Plays / / 0 Comments

        The segment aired Monday, Nov. 14, at 10pm on the eve of the Maryland Childhood Obesity Summit.

        + More details
        • Popularity versus Similarity in Growing Networks

          01:20:33

          from ISR at UMD / Added

          150 Plays / / 0 Comments

          Dmitri Krioukov University of California, San Diego Abstract Preferential attachment is a powerful mechanism explaining the emergence of scaling in growing networks. If new connections are established preferentially to more popular nodes in a network, then the network is scale-free. Here we show that not only popularity but also similarity is a strong force shaping the network structure and dynamics. We develop a framework where new connections, instead of preferring popular nodes, optimize certain trade-offs between popularity and similarity. The framework admits a geometric interpretation, in which preferential attachment emerges from local optimization processes. As opposed to preferential attachment, the optimization framework accurately describes large-scale Internet evolution, predicting new links in the Internet with a remarkable precision. The developed framework can thus be used for predicting new links in evolving networks, and provides a different perspective on preferential attachment as an emergent phenomenon. Biography Dmitri Krioukov graduated from St. Petersburg State University with Diploma in Physics in 1993. In 1998 he received his Ph.D. in Physics from Old Dominion University, and joined the networking industry at Dimension Enterprises. After their acquisition, he accepted a research scientist position with Nortel Networks. He has been with Cooperative Association for Internet Data Analysis (CAIDA) at the University of California, San Diego (UCSD), as a senior research scientist since 2004. His interests include complex network topology, geometry, and evolution. His recent application of geometric network mapping methods to the Internet resolved the longstanding problem of designing optimal Internet routing, and was featured in the news world-wide.

          + More details
          • UM Carey Law - Anti-bullying conference

            02:56

            from UMB News / Added

            6 Plays / / 0 Comments

            Held Friday, Nov. 11, 2011 at the University of Maryland School of Law. This story aired several times on WBAL-TV Friday and Saturday.

            + More details
            • Childhood Obesity Summit - Ch 11 Nutrition segment

              03:31

              from UMB News / Added

              44 Plays / / 0 Comments

              Aired Nov. 12, 2011 featuring Shanti Lewis from the University of Maryland School of Medicine.

              + More details
              • ONE NATION

                03:52

                from dc gladden / Added

                16 Plays / / 0 Comments

                United States of America Bill of Rights Cut-Up (Dedicated to Bill Burroughs) UMES (University of Maryland Eastern Shore) Video Art Class Fall 2011 Instructor: David Gladden

                + More details
                • Dom Kennedy Interview *spoiledBROKE! Exclusive*

                  01:54

                  from spoiledBROKE! / Added

                  155 Plays / / 0 Comments

                  A quick interview with Dom Kennedy @ The University of Maryland, College Park http://dopeitsdom.com http://twitter.com/​dopeitsdom http://spoiledbroke.com/2011/10/19/event-umds-first-homecoming-concert-dom-kennedy/

                  + More details
                  • Building Algebraic Structures with Combinators

                    01:07:01

                    from ISR at UMD / Added

                    68 Plays / / 0 Comments

                    Timothy Griffin University of Cambridge Host John Baras Abstract I'll describe ongoing work with my student Vilius Naudziunas on a domain-specific language for implementing various algebraic structures (semirings, ordered semigroups, etc). Expressions in the language are made up of constants (representing simple algebras such as min-plus) and combinators that construct new structures from components (such as direct and lexicographic products). The key feature of the language is that it has been designed so that a fixed class of important properties (such as distributivity, idempotence, commutativity, and so on) are automatically proved or refuted by the type system of the language. This allows a user to specify complex algebraic structures and obtain these proofs (or refutations) automatically. It is hoped that the language and its implementation will facilitate the rapid exploration of the algebraic design space. We have implemented a prototype using the Coq theorem prover. All of the essential theorem proving --- for the "typing rules" --- is performed at "language design time." Users writing algebraic expressions at "specification time" do not run Coq directly. Rather, they run code that has been extracted automatically from the (constructive) proofs of our library of Coq theorems. Biography Timothy G. Griffin has a BS in Mathematics from the University of Wisconsin, Madison, and a PhD in Computer Science from Cornell University. Tim was on the faculty of UNICAMP in Brazil and then a researcher at Bell Laboratories. Since 2005 Tim has been on the faculty of the Computer Laboratory at the University of Cambridge. Tim's recent research has focused on algebraic modeling of Internet routing protocols.

                    + More details
                    • Kalman and Kalman Bucy @ 50: Distributed and Intermittency

                      01:12:32

                      from ISR at UMD / Added

                      79 Plays / / 0 Comments

                      José M. F. Moura Carnegie Mellon University Abstract We acknowledge that 2011 marks fifty years since the publication of the seminal papers by Kalman (Tr. ASME, Journal Basic Eng., March 1960) and Kalman-Bucy (Tr. ASME, Journal Basic Eng., March 1961). We consider estimation of a random field by cooperating agents and address two main issues: distributed processing and intermittency. We present a class of mixed time scale distributed estimators that interleave consensus (information flow among neighbors) with innovations (information flow from sensing.) We study conditions under which distributed estimation is asymptotically unbiased, consistent, and normal, being asymptotically equivalent to centralized estimation. With large numbers of agents, communication and sensors fail intermittently and the Riccati equation becomes a random dynamical system (RDS); we show that its sample paths converge in distribution to an invariant measure on the cone of positive definite matrices. This is the random equivalent of the Riccati equation converging to a fixed point as in standard Kalman and Kalman-Bucy filtering. Biography José M. F. Moura is a University Professor at CMU where he founded the Center for Sensed Critical Infrastructure Research and the Information and Communication Technologies Institute, a major educational and research initiative between CMU and nine Universities in Portugal. He holds a D.Sc. in Electrical Engineering and Computer Science from the Massachusetts Institute of Technology (MIT). His interests are in algebraic and statistical signal/ image processing, with projects on distributed algorithms, large scale critical physical infrastructures, bioimaging, and intelligent compilers for signal processing algorithms. He is a Director Elect for the IEEE and was President of the IEEE Signal Processing Society, Editor in Chief for the IEEE Transactions on Signal Processing, and a member of the Boards of the IEEE Proceedings and the ACM Sensors Journal. He received several awards, including Fellow of the IEEE, Fellow of the AAAS, corresponding member of the Academia das Ciências of Portugal, and the IEEE Signal Processing Society 2010 Technical Achievement Award. In 2010, he was elected University Professor at CMU.

                      + More details

                      What are Tags?

                      Tags

                      Tags are keywords that describe videos. For example, a video of your Hawaiian vacation might be tagged with "Hawaii," "beach," "surfing," and "sunburn."