Archives for posts with tag: University
UpSizeR: Synthetically Scaling Up a Given Database State
Google Tech Talk April 12, 2010 ABSTRACT Presented by YC Tay. E-commerce and social networking services must ensure that their systems are scalable. Engineering for rapid growth requires intensive testing with scaled-up datasets. Although such a larger dataset is synthetically generated, it must be similar to a real dataset if it is to be useful. This talk presents UpSizeR, a tool for scaling up relational databases. Given a database state D and a positive number s, UpSizeR generates a synthetic state D' that is s times the size of D, yet similar to D in terms of query results. UpSizeR does this by extracting inter-column and inter-row information from D. UpSizeR can also be used by an enterprise to make a synthetic copy (s=1) of its proprietary dataset for a vendor, or scale down a production dataset (s less than 1) for non-production testing. Experiments with Flickr data shows good agreement between crawled data and UpSizeR output for various sizes. However, UpSizeR currently cannot scale the social network topology in Flickr. This leads to the Attribute Value Correlation Problem: If D records data from a social network, how do the social interactions affect correlation among attribute values in D? Bio — YC Tay received his BSc from the University of Singapore and PhD from Harvard University. He is a professor in the Departments of Mathematics and Computer Science at the National University of Singapore (www.comp.nus.edu.sg His main research interest is performance <b>…</b>
Views:
1121
8
ratings

Time:
55:41
More in
Science & Technology

VB and C# together share about 50% of the “garbage-collected languages” market. I’ll talk about how we design these languages. Where do we get ideas? How do we incorporate new paradigms without breaking the existing languages? Where will we go in the future, and how will we get there? I’ll illustrate this talk with three main examples: how LINQ was introduced, how XML literals were introduced, and what we’re planning for concurrency.
 
Lucian is the Spec Lead for Microsoft Visual Basic in Redmond, USA. Before that he was a post-doc at the University of Bologna, working with Cosimo Laneve on implementing the pi calculus. And before that he did his PhD on the same topic, supervised Philippa Gardner in the Computer Laboratory of the University of Cambridge.

62fb4e66-1b96-43e8-b5ce-8642c96afdf8[1]

 

This session is presented by Lucian Wischik during Microsoft DevDays 2010 in The Hague in The Netherlands.

Pyongyang University of Science & Technology
Google Tech Talk February 11, 2010 Pyongyang University of Science & Technology: First International University in the Heart of North Korea ABSTRACT (Q&A starts at 35:55) Presented by Dr. David Kim, Vice President of Pyongyang University of Science & Technology in Pyongyang, DPRK, and the Vice President of Yanbian University of Science & Technology (YUST) in Yanji, Jilin Province, China. The opening of Pyongyang University of Science & Technology (PUST) was once thought to be an impossible dream. However, the first phase of the campus is now finished and ready to accept students in April 2010. Dr. David Kim, who serves as the Vice President of PUST, will be joining us to raise awareness about this first international university in North Korea (where the teaching language will be English), discuss recruitment of international faculty and explore fund-raising opportunities.
Views:
2044
15
ratings

Time:
01:11:32
More in
Science & Technology

The Query Complexity of Estimating Weighted Averages
Google Tech Talk February 4, 2010 ABSTRACT Presented by Tony Wirth. The query complexity of estimating the mean of some [0, 1] variables is well known to the theory community. Inspired by some work by Carterette et al. [SIGIR 2006, pp 26875] on evaluating retrieval systems, and by Moffat and Zobel's new proposal for such evaluation [under review], we decided to examine the query complexity of weighted average calculation. In general, the problem requires the same number of queries as estimating the mean, as the latter is a special case. In fact, there is a matching upper bound for the weighted mean. This result remains true for any set of weights that is the normalized prefix of a divergent series. However, if the weights follow a geometric sequence, a much smaller sample is sufficient. Finally, we investigate power-law sequences of weights and show matching lower and upper bounds. This is joint work with Amit Chakrabarti and Venkatesan Guruswami and Andrew Wirth. Tony Wirth joined the faculty of the University of Melbourne's Computer Science department in 2005. Prior to that, he completed a PhD, as a Gordon Wu Fellow, at Princeton University in 2004 on approximation algorithms for clustering problems. Tony completed his undergraduate degree at the University of Melbourne, majoring in statistics. His research interests also include sequence problems in bioinformatics and adaptive sampling.
Views:
1579
5
ratings

Time:
41:30
More in
Science & Technology

Welcome to the latest installment of C9 Conversations. For this episode, we were very fortunate to get a chance to converse openly with one of the world’s preeminent mathematical logicians, the great Yuri Gurevich.

Dr. Gurevich is Professor Emeritus of Electrical Engineering and Computer Science at the University of Michigan. He is currently a principle research scientist in Wolfram Schulte’s RiSE team (Research in Software Engineering group at Microsoft Research).

Originally, Dr. Gurevich started his career as an algebraist. Later he became a logician. Then he moved to computer science, where his main projects have been Abstract State Machines, Average Case Computational Complexity, and Finite Model Theory. Dr. Gurevich has been honored as a Dr. Honoris Causa of the University of Limburg, Belgium (1998), as a Fellow of the Association for Computing Machinery (1996), as well as a Fellow of the John Simon Guggenheim Memorial Foundation (1995).

Dr. Gurevich’s fundamental work on the theory of Abstract State Machines (ASMs) is of paramount importance for theoretical and applied computer science. The significance of the theoretical concepts developed by Gurevich is confirmed by the substantial impact they have on mathematical modeling of discrete dynamic systems.

*This is probably the only interview in C9’s history where a good case is made for imperative programming versus declarative and functional (this starts right off the bat at around 02:31).

Read Yuri’s Annotated Articles

Tune in. Meet Yuri Gurevich.

Practical Life Extension Results
Google Tech Talk October 9, 2009 ABSTRACT Presented by Gregory Benford. Genescient is the world's first computational biology company founded on the use of artificial biological selection to cure the diseases of aging. Our laboratory animals have been selected for longevity through 750 generations for the equivalent of 15000 human years. I will describe Genescient's multiple pathways toward accelerating human longevity, with parallel enhancements of vigor and function. Genescient applies 21st century genomic technology to identify, screen and develop benign therapeutic substances at precise doses, to defeat the diseases of aging. Our singular approach addresses the complex genomic networks that underlie aging and aging-associated diseases such as cardiovascular disease, Type II diabetes and neurodegenerative diseases. I shall display some results and our first product, due in 2009. Gregory Benford is a Professor Emeritus at the University of California, Irvine, where he was a Professor of Physics. He is a Woodrow Wilson Fellow, a Fellow of the American Physical Society and was Visiting Fellow at Cambridge University and the Universities of Turin and Bologna. In 1995 he received the Lord Prize for contributions to science. With more than 200 scientific publications, his research encompasses both theory and experiments in the fields of astrophysics and plasma physics. His research has been supported by NSF, NASA, AFOSR, DOE and other agencies. He is an ongoing advisor to <b>…</b>
Views:
3934
52
ratings

Time:
52:55
More in
Science & Technology

Google Faculty Summit 2009: Welcome, University Initiatiatives
Google Tech Talk July 30, 2009 ABSTRACT Google Faculty Summit 2009: Global Connection: Inform and Empower Welcome, Google Research, and University Initiatives Presented by Alfred Spector and Maggie Johnson. Each year Google hosts leading academics from universities across the globe though our Faculty Summit program. Faculty Summits are designed to provide researchers with a chance to learn more about what Google does in each region and how we support university programs, as well as provide …
Views:
574
5
ratings

Time:
46:12
More in
Science & Technology