http://www.bestechvideos.com/category/computer-science?parent_name=computer-science Thu, 03 Jul 2008 23:22:12 GMT BestTechVideos: Category Computer Science Videos with short descriptions http://www.bestechvideos.com/2008/05/17/supporting-scalable-online-statistical-processing <p>Google Tech Talks<br /> April, 28 2008<br /> <br /> ABSTRACT<br /> <br /> Christopher Jermaine - RESEARCH SCIENTIST<br /> <br /> Query processing for analytic, statistical, and exploratory database queries has been an active area of database research and development for nearly two decades. Many experts now consider this problem to be &quot;solved&quot;, especially with regard to performance. However, an argument can be made that users and databases have simply reached an uneasy truce with regard to analytic processing. If users avoid ad-hoc, exploratory queries that might take days to execute, then of course the database performs just fine.<br /> <br /> In this talk, I will describe query processing in a database system called DBO that is designed from the ground up to support interactive analytic processing. DBO can run database queries from start to finish and produce exact answers in a scalable fashion. However, unlike any existing research or production system, DBO is able to produce statistically meaningful approximate answers at all times throughout query execution. These answers are continuously updated from start to finish, even for &quot;huge&quot; queries requiring arbitrary quantities of temporary secondary storage. Thus, a user can stop execution whenever satisfied with the query accuracy, which may translate to dramatic time savings during exploratory processing.<br /> <br /> Speaker: Christopher M. Jermaine - Research Scientist<br /> Chris Jermaine is an assistant professor in the CISE Department at the University of Florida, where he studies databases and data management. He is the recipient of a 2008 Alfred P. Sloan Foundation Research Fellowship, a National Science Foundation CAREER award, and a 2007 ACM SIGMOD Best Paper Award. He received a BA from the Mathematics Department at UCSD, and a PhD from the College of Computing at Georgia Tech.</p><p><a href="http://www.bestechvideos.com/2008/05/17/supporting-scalable-online-statistical-processing">Read more about this video…</a></p><p><b>Want to control this feed contents?</b>&nbsp;<a href="http://www.bestechvideos.com/user/all/signup">Sign up here</a> and create your own feed!</p><hr/>Want more on these topics?<br/>Browse the archive of posts filed under <a href="http://www.bestechvideos.com/category/conferences">Conferences</a>, <a href="http://www.bestechvideos.com/category/companies">Companies</a>, <a href="http://www.bestechvideos.com/category/broadcasting">Broadcasting</a>, <a href="http://www.bestechvideos.com/category/science">Science</a>, <a href="http://www.bestechvideos.com/category/conferences/techtalks">Techtalks</a>, <a href="http://www.bestechvideos.com/category/companies/google">Google</a>, <a href="http://www.bestechvideos.com/category/broadcasting/lectures">Lectures</a>, <a href="http://www.bestechvideos.com/category/science/computer-science">Computer Science</a> Thu, 03 Jul 2008 23:22:12 GMT http://www.bestechvideos.com/2008/05/17/supporting-scalable-online-statistical-processing scoundrel http://www.bestechvideos.com/2008/04/02/teaching-kids-to-code <p>Google Tech Talks<br /> March, 7 2008<br /> <br /> ABSTRACT<br /> <br /> Learning to code has become both more important and more complicated in the last decade. We need to make it attractive and easy again.<br /> <br /> Most western countries currently experience a shortage of skilled computing professionals in the employment market. We have seen a similar problem in the 1990s, but this time the situation is<br /> different: While the problem in the 90s was university capacity (we just couldn't educate enough people quickly enough), this time around it is enrolment: Universities have the capacity, but not enough students sign up to study technical, computing related subjects, such as computer science or software engineering.<br /> <br /> The real problem lies before university: at school age, students decide against computing as a subject, because it is perceived as geeky, tedious, intellectually not challenging, and most of all<br /> boring. At the same time, programming in schools is on a sharp decline.</p> <p>We need to counter this trend by bringing programming back into schools, and make it an engaging, challenging, relevant and enjoyable activity. To be successful, the public sector, academia and business should work together to make this happen.<br /> <br /> At the University of Kent, we have developed two successful development environments, named BlueJ and Greenfoot, and educational material to address these challenges. In this presentation, we will discuss both, with the main focus on Greenfoot, a system for beginners to learn Java programming through development of interactive graphical applications.<br /> <br /> Greenfoot and its associated materials can be used to teach programming in schools, computer clubs, or to your own children. Kids develop computer games, and -- almost as an aside -- learn object-oriented programming in Java.<br /> <br /> In this talk, I will present the software, strategies for learning of programming, and the benefits and drawback of Java as a first language.<br /> <br /> Speaker: Michael K&ouml;lling, Computing Laboratory, University&nbsp; Michael K&ouml;lling is the lead designer of the BlueJ and Greenfoot programming environments. Both environments are designed for beginners to learn the basics of Java, and are widely used by schools and universities all over the world. Michael is also the founder of the Sun Center of Excellence in Object-Oriented Education at the University of Kent. He works as a Senior Lecturer in the Computing Laboratory at the University of Kent, where he teaches Java to undergraduate and postgraduate students, and is co-author of a successful Java textbook, &quot;Objects First With Java.&quot;</p><p><a href="http://www.bestechvideos.com/2008/04/02/teaching-kids-to-code">Read more about this video…</a></p><p><b>Want to control this feed contents?</b>&nbsp;<a href="http://www.bestechvideos.com/user/all/signup">Sign up here</a> and create your own feed!</p><hr/>Want more on these topics?<br/>Browse the archive of posts filed under <a href="http://www.bestechvideos.com/category/development">Development</a>, <a href="http://www.bestechvideos.com/category/science">Science</a>, <a href="http://www.bestechvideos.com/category/conferences/techtalks">Techtalks</a>, <a href="http://www.bestechvideos.com/category/companies/google">Google</a>, <a href="http://www.bestechvideos.com/category/development/java">Java</a>, <a href="http://www.bestechvideos.com/category/broadcasting/lectures">Lectures</a>, <a href="http://www.bestechvideos.com/category/science/computer-science">Computer Science</a> Fri, 30 May 2008 01:55:33 GMT http://www.bestechvideos.com/2008/04/02/teaching-kids-to-code scoundrel http://www.bestechvideos.com/2008/05/17/turing-s-cathedral <p>Google Tech Talks<br /> April, 9 2008<br /> <br /> ABSTRACT<br /> <br /> New Light on the Dawn of Digital Computing, 1945-1958<br /> <br /> The digital universe consists of two kinds of bits: differences in space and differences in time. Digital computers translate between these two forms of information--structure and sequence--according to definite rules. Sixty-three years ago, at the Institute for Advanced Study in Princeton, NJ, John von Neumann and a small group of nonconformists launched a project to do this at electronic speed. The resulting architecture and coding has descended directly to almost all computers now in use.<br /> <br /> Von Neumann succeeded in jump-starting the computer revolution by bringing engineers into the den of the mathematicians, rather than by bringing mathematicians into a den of engineers. The stored-program computer, as conceived by Alan Turing and delivered by John von Neumann, broke the distinction between numbers that *mean* things and numbers that *do* things. Our universe would never be the same.<br /> <br /> With a mere 5 kilobytes of random access memory, von Neumann and colleagues tackled previously intractable problems ranging from thermonuclear explosions, stellar evolution, and long-range weather forecasting to cellular automata, genetic coding, and the origins of life. Programs were small enough to be completely debugged, but hardware could not be counted on to perform consistently from one kilocycle to the next. This situation is now reversed.<br /> <br /> Speaker: George Dyson</p><p><a href="http://www.bestechvideos.com/2008/05/17/turing-s-cathedral">Read more about this video…</a></p><p><b>Want to control this feed contents?</b>&nbsp;<a href="http://www.bestechvideos.com/user/all/signup">Sign up here</a> and create your own feed!</p><hr/>Want more on these topics?<br/>Browse the archive of posts filed under <a href="http://www.bestechvideos.com/category/science">Science</a>, <a href="http://www.bestechvideos.com/category/conferences/techtalks">Techtalks</a>, <a href="http://www.bestechvideos.com/category/companies/google">Google</a>, <a href="http://www.bestechvideos.com/category/broadcasting/lectures">Lectures</a>, <a href="http://www.bestechvideos.com/category/science/computer-science">Computer Science</a> Sat, 17 May 2008 05:24:27 GMT http://www.bestechvideos.com/2008/05/17/turing-s-cathedral scoundrel http://www.bestechvideos.com/2008/02/21/an-overview-of-high-performance-computing-and-challenges-for-the-future <p>Google Tech Talks<br /> January, 25 2008<br /> <br /> ABSTRACT<br /> <br /> In this talk we examine how high performance computing has changed over the last 10-year and look toward the future in terms of trends. These changes have had and will continue to have a major impact on our software. A new generation of software libraries and algorithms are needed for the effective and reliable use of (wide area) dynamic, distributed and parallel environments. Some of the software and algorithm challenges have already been encountered, such as management of communication and memory hierarchies through a combination of compile--time and run--time techniques, but the increased scale of computation, depth of memory hierarchies, range of latencies, and increased run--time environment variability will make these problems much harder.<br /> <br /> We will focus on the redesign of software to fit multicore architectures.<br /> <br /> Speaker: Jack Dongarra<br /> University of Tennessee<br /> Oak Ridge National Laboratory<br /> University of Manchester<br /> Jack Dongarra received a Bachelor of Science in Mathematics from Chicago State University in 1972 and a Master of Science in Computer Science from the Illinois Institute of Technology in 1973. He received his Ph.D. in Applied Mathematics from the University of New Mexico in 1980. He worked at the Argonne National Laboratory until 1989, becoming a senior scientist. He now holds an appointment as University Distinguished Professor of Computer Science in the Electrical Engineering and Computer Science Department at the University of Tennessee, has the position of a Distinguished Research Staff member in the Computer Science and Mathematics Division at Oak Ridge National Laboratory (ORNL), Turing Fellow in the Computer Science and Mathematics Schools at the University of Manchester, and an Adjunct Professor in the Computer Science Department at Rice University.<br /> <br /> He specializes in numerical algorithms in linear algebra, parallel computing, the use of advanced-computer architectures, programming methodology, and tools for parallel computers. His research includes the development, testing and documentation of high quality mathematical software. He has contributed to the design and implementation of the following open source software packages and systems: EISPACK, LINPACK, the BLAS, LAPACK, ScaLAPACK, Netlib, PVM, MPI, NetSolve, Top500, ATLAS, and PAPI. He has published approximately 200 articles, papers, reports and technical memoranda and he is coauthor of several books. He was awarded the IEEE Sid Fernbach Award in 2004 for his contributions in the application of high performance computers using innovative approaches. He is a Fellow of the AAAS, ACM, and the IEEE and a member of the National Academy of Engineering.</p><p><a href="http://www.bestechvideos.com/2008/02/21/an-overview-of-high-performance-computing-and-challenges-for-the-future">Read more about this video…</a></p><p><b>Want to control this feed contents?</b>&nbsp;<a href="http://www.bestechvideos.com/user/all/signup">Sign up here</a> and create your own feed!</p><hr/>Want more on these topics?<br/>Browse the archive of posts filed under <a href="http://www.bestechvideos.com/category/companies">Companies</a>, <a href="http://www.bestechvideos.com/category/science">Science</a>, <a href="http://www.bestechvideos.com/category/conferences/techtalks">Techtalks</a>, <a href="http://www.bestechvideos.com/category/companies/google">Google</a>, <a href="http://www.bestechvideos.com/category/broadcasting/lectures">Lectures</a>, <a href="http://www.bestechvideos.com/category/science/math">Math</a>, <a href="http://www.bestechvideos.com/category/science/computer-science">Computer Science</a> Fri, 25 Apr 2008 01:40:50 GMT http://www.bestechvideos.com/2008/02/21/an-overview-of-high-performance-computing-and-challenges-for-the-future scoundrel http://www.bestechvideos.com/2008/04/02/what-do-those-images-have-in-common <p>Google Tech Talks<br /> March, 25 2008<br /> <br /> ABSTRACT<br /> <br /> This talk is about discovering and modeling previously unspecified, recurring themes in a given set of arbitrary images. Given a set of images, each containing frequent occurrences of objects from multiple categories, the goal is to learn a compact model of the categories as well as their relationships, for the purposes of later recognizing/segmenting any occurrences in new images. Categories are not defined by the user. Also, whether and where instances of any categories appear in a specific image is not known. This problem is challenging, since it involves the following unanswered questions. What is an object category? What image properties should be used and how to combine them to discover category occurrences? What is an efficient multicategory representation?<br /> <br /> We will examine a methodology, developed during my postdoctoral work at UIUC. Each image is represented by a segmentation tree whose nodes correspond to image regions, segmented at all natural scales present, and edges between tree nodes capture the region embedding. The presence of any categories in the image set is then reflected in the frequent occurrence of similar subtrees within the segmentation trees. Our methodology is designed to: (1) match image trees to find similar subtrees; (2) discover categories by clustering similar subtrees, and use the properties of each cluster to learn the model of the associated category; and (3) learn the grammar of the discovered categories that compactly captures their recursive definitions in terms of other simpler (sub)categories and their relationships (e.g., containment, co- occurrence, and sharing of simple categories by more complex ones). When a new image is encountered, its segmentation tree is matched against the learned grammar to simultaneously recognize and segment all occurrences of the learned categories. This matching also provides a semantic explanation of object recognition in terms of the identified parts along with their spatial relationships.<br /> <br /> The aforementioned methodology can also be used for identifying recurring image themes of more general kind. An example is that of extracting the stochastically repeating, elementary parts of image texture (e.g., waterlilies on the water surface, people in a crowd).<br /> <br /> This talk will be taped by the engEDU Tech Talks Team. <br /> <br /> Speaker: Sinisa Todorovic<br /> Sinisa Todorovic received the joint B.S./M.S. degree with honors in electrical engineering from the University of Belgrade, Serbia, in 1994. From 1994 until 2001, he worked in the communications industry. He received the M.S. and Ph.D. degrees in electrical and computer engineering at the University of Florida, Gainesville, in 2002, and 2005, respectively. Since 2005, he holds the position of Postdoctoral Research Associate in the Beckman Institute at the University of Illinois Urbana-Champaign, where he collaborates with Prof. Narendra Ahuja. Sinisa's main research interests concern computer vision and machine learning, with current focus on unsupervised extraction and representation of visual themes recurring in images. He is the recipient of Jack Neubauer Best Paper Award 2004 for a publication in IEEE Trans. Vehicular Technology, and Outstanding Reviewer Award at the Int. Conf. on Computer Vision (ICCV) 2007. He serves as Associate Editor of Advances in Multimedia.</p><p><a href="http://www.bestechvideos.com/2008/04/02/what-do-those-images-have-in-common">Read more about this video…</a></p><p><b>Want to control this feed contents?</b>&nbsp;<a href="http://www.bestechvideos.com/user/all/signup">Sign up here</a> and create your own feed!</p><hr/>Want more on these topics?<br/>Browse the archive of posts filed under <a href="http://www.bestechvideos.com/category/companies">Companies</a>, <a href="http://www.bestechvideos.com/category/science">Science</a>, <a href="http://www.bestechvideos.com/category/conferences/techtalks">Techtalks</a>, <a href="http://www.bestechvideos.com/category/companies/google">Google</a>, <a href="http://www.bestechvideos.com/category/broadcasting/lectures">Lectures</a>, <a href="http://www.bestechvideos.com/category/science/dsp">DSP</a>, <a href="http://www.bestechvideos.com/category/science/computer-science">Computer Science</a> Fri, 25 Apr 2008 01:39:50 GMT http://www.bestechvideos.com/2008/04/02/what-do-those-images-have-in-common scoundrel http://www.bestechvideos.com/2008/04/17/how-to-be-normal-a-guide-for-developers <div class="en_session_description description"> <p>At some point in every software project involving a database it becomes necessary for the developers who created (or inherited) the project to step back and take a look at their database. Many projects have a database schema that has evolved over time, with columns added here and tables added there, increasing complexity and often adding redundancy. Super-tables grow with more and more columns making ALTERs slow and backups difficult.</p> <p>In this session MySQL author and speaker Mike Hillyer will guide the audience through the principles of database normalization and review some common normalization scenarios encountered by many application developers.</p> <p>Topics include:</p> <ul> <li>What is normalization and what are its benefits?</li> <li>What are the normal forms? <ul> <li>First Normal Form</li> <li>Second Normal Form</li> <li>Third Normal Form</li> <li>And so on&hellip;</li> </ul> </li> <li>Normalization Scenarios</li> <li>Relationships and Joins</li> <li>How Much is Too Much?</li> </ul> <p>This session is intended for a beginner to intermediate audience and is applicable to developers and administrators who deal with database design.</p> </div><p><a href="http://www.bestechvideos.com/2008/04/17/how-to-be-normal-a-guide-for-developers">Read more about this video…</a></p><p><b>Want to control this feed contents?</b>&nbsp;<a href="http://www.bestechvideos.com/user/all/signup">Sign up here</a> and create your own feed!</p><hr/>Want more on these topics?<br/>Browse the archive of posts filed under <a href="http://www.bestechvideos.com/category/conferences">Conferences</a>, <a href="http://www.bestechvideos.com/category/databases">Databases</a>, <a href="http://www.bestechvideos.com/category/development">Development</a>, <a href="http://www.bestechvideos.com/category/design">Design</a>, <a href="http://www.bestechvideos.com/category/databases/mysql">MySQL</a>, <a href="http://www.bestechvideos.com/category/broadcasting/lectures">Lectures</a>, <a href="http://www.bestechvideos.com/category/science/computer-science">Computer Science</a> Thu, 17 Apr 2008 19:10:04 GMT http://www.bestechvideos.com/2008/04/17/how-to-be-normal-a-guide-for-developers scoundrel http://www.bestechvideos.com/2008/04/02/decayed-mcmc-for-probabilistic-filtering <p>Google Tech Talks<br /> March, 28 2008<br /> <br /> ABSTRACT<br /> <br /> Bhaskara M. Marthi - Research Scientist <br /> <br /> I will describe an algorithm for probabilistic filtering, the problem of maintaining a probability distribution over the hidden state of a dynamical system given periodic noisy observations. This problem appears in various guises in practice, such as activity monitoring, state estimation, visual tracking, and fault diagnosis. Our algorithm, known as decayed MCMC, scales better than exact methods on many problems, and is less susceptible to losing track of the mode than the popular sequential Monte Carlo or particle filtering methods. Standard Markov chain Monte-Carlo mixing time analyses are insufficient to bound the complexity of our algorithm, and so we extend them to the setting of convergence of a marginal distribution. <br /> <br /> Speaker: Dr. Bhaskara M. Marthi - Research Scientist<br /> Dr. Bhaskara Marthi is currently a postdoctoral research associate at MIT, working with Leslie Kaelbling and Tomas Lozano Perez on hierarchical planning and robotic manipulation. He received his PhD in 2006 from the University of California, Berkeley, working with Stuart Russell on reinforcement learning with partial programs, and its application to AI design for large real-time strategy video games. His other interests include probabilistic reasoning, relational and first-order models, and Monte Carlo algorithms.</p><p><a href="http://www.bestechvideos.com/2008/04/02/decayed-mcmc-for-probabilistic-filtering">Read more about this video…</a></p><p><b>Want to control this feed contents?</b>&nbsp;<a href="http://www.bestechvideos.com/user/all/signup">Sign up here</a> and create your own feed!</p><hr/>Want more on these topics?<br/>Browse the archive of posts filed under <a href="http://www.bestechvideos.com/category/science">Science</a>, <a href="http://www.bestechvideos.com/category/conferences/techtalks">Techtalks</a>, <a href="http://www.bestechvideos.com/category/companies/google">Google</a>, <a href="http://www.bestechvideos.com/category/broadcasting/lectures">Lectures</a>, <a href="http://www.bestechvideos.com/category/science/math">Math</a>, <a href="http://www.bestechvideos.com/category/science/statistics">Statistics</a>, <a href="http://www.bestechvideos.com/category/science/computer-science">Computer Science</a> Tue, 15 Apr 2008 20:46:08 GMT http://www.bestechvideos.com/2008/04/02/decayed-mcmc-for-probabilistic-filtering scoundrel http://www.bestechvideos.com/2008/04/02/scene-discovery-by-matrix-factorization <p>Google Tech Talks<br /> March, 24 2008<br /> <br /> ABSTRACT<br /> <br /> What constitutes a scene? Defining a meaningful vocabulary for scene discovery is a challenging problem that has important consequences for object recognition. We consider scenes to depict correlated objects and present visual similarity. We introduce a max-margin factorization model that finds a low dimensional subspace with high discriminative power for correlated annotations. We postulate this space should allow us to discover a large number of scenes in unsupervised data; we show scene discrimination results on par with supervised approaches. This model also produces state of the art word prediction results including good<br /> annotation completion.<br /> <br /> Speaker: Ali Farhadi<br /> Ali Farhadi is a PhD student in the UIUC Computer Science Department working on computer vision and machine learning under David Forsyth. His interests include image segmentation, transfer learning, scene understanding and human activity recognition.</p><p><a href="http://www.bestechvideos.com/2008/04/02/scene-discovery-by-matrix-factorization">Read more about this video…</a></p><p><b>Want to control this feed contents?</b>&nbsp;<a href="http://www.bestechvideos.com/user/all/signup">Sign up here</a> and create your own feed!</p><hr/>Want more on these topics?<br/>Browse the archive of posts filed under <a href="http://www.bestechvideos.com/category/conferences">Conferences</a>, <a href="http://www.bestechvideos.com/category/companies">Companies</a>, <a href="http://www.bestechvideos.com/category/broadcasting">Broadcasting</a>, <a href="http://www.bestechvideos.com/category/science">Science</a>, <a href="http://www.bestechvideos.com/category/conferences/techtalks">Techtalks</a>, <a href="http://www.bestechvideos.com/category/companies/google">Google</a>, <a href="http://www.bestechvideos.com/category/broadcasting/lectures">Lectures</a>, <a href="http://www.bestechvideos.com/category/science/math">Math</a>, <a href="http://www.bestechvideos.com/category/science/computer-science">Computer Science</a> Mon, 07 Apr 2008 22:51:58 GMT http://www.bestechvideos.com/2008/04/02/scene-discovery-by-matrix-factorization scoundrel http://www.bestechvideos.com/2008/04/02/movie-script-alignment-and-parsing-of-video-and-text-transcription <p>Google Tech Talks<br /> March, 26 2008<br /> <br /> ABSTRACT<br /> <br /> Timothee Cour - Research Scientist <br /> <br /> Movies and TV are a rich source of highly diverse and complex video of people, objects, actions and locales &quot;in the wild&quot;. Harvesting automatically labeled sequences of actions from video would enable creation of large-scale and highly-varied datasets. To enable such collection, we focus on the task of recovering scene structure in movies and TV series for object/person tracking and action retrieval. We present a weakly supervised algorithm that uses the screenplay and closed captions to parse a movie into a hierarchy of shots and scenes. Scene boundaries in the movie are aligned with screenplay scene labels and shots are reordered into a sequence of long continuous tracks or threads which allow for more accurate tracking of people and actions across shot boundaries. Scene segmentation, alignment, and shot threading are formulated as inference in a unified generative model and a novel hierarchical dynamic programming algorithm that can handle alignment and jump-limited reorderings in linear time is introduced. We present quantitative and qualitative results on movie alignment and parsing, and use the recovered structure for tracking and naming of characters as well as retrieval of common actions in several episodes of popular TV series. <br /> <br /> If time permits we will also present our recent results on approximate inference with eigenvalue optimization.<br /> <br /> Speaker: Timothee Cour - Research Scientist <br /> Timothee Cour is a fifth year PhD student at the University of Pennsylvania, Philadelphia, in Computer Science. He completed his undergraduate education at the Ecole Polytechnique in France, majoring in Computer Science and Applied Mathematics. His research advisor is Prof. Ben Taskar and he also worked closely with Prof. Jianbo Shi.</p><p><a href="http://www.bestechvideos.com/2008/04/02/movie-script-alignment-and-parsing-of-video-and-text-transcription">Read more about this video…</a></p><p><b>Want to control this feed contents?</b>&nbsp;<a href="http://www.bestechvideos.com/user/all/signup">Sign up here</a> and create your own feed!</p><hr/>Want more on these topics?<br/>Browse the archive of posts filed under <a href="http://www.bestechvideos.com/category/conferences">Conferences</a>, <a href="http://www.bestechvideos.com/category/companies">Companies</a>, <a href="http://www.bestechvideos.com/category/science">Science</a>, <a href="http://www.bestechvideos.com/category/conferences/techtalks">Techtalks</a>, <a href="http://www.bestechvideos.com/category/companies/google">Google</a>, <a href="http://www.bestechvideos.com/category/broadcasting/lectures">Lectures</a>, <a href="http://www.bestechvideos.com/category/science/dsp">DSP</a>, <a href="http://www.bestechvideos.com/category/science/computer-science">Computer Science</a> Mon, 07 Apr 2008 22:51:25 GMT http://www.bestechvideos.com/2008/04/02/movie-script-alignment-and-parsing-of-video-and-text-transcription scoundrel http://www.bestechvideos.com/2008/04/02/optimization-for-machine-learning <p>Google Tech Talks<br /> March, 25 2008<br /> <br /> ABSTRACT<br /> <br /> S.V.N. Vishwanathan - Research Scientist<br /> <br /> Regularized risk minimization is at the heart of many machine learning algorithms. The underlying objective function to be minimized is convex, and often non-smooth. Classical optimization algorithms cannot handle this efficiently. In this talk we present two algorithms for dealing with convex non-smooth objective functions. First, we extend the well known BFGS quasi-Newton algorithm to handle non-smooth<br /> <br /> functions. Second, we show how bundle methods can be applied in a machine learning context. We present both theoretical and experimental justification of our algorithms.<br /> <br /> Speaker: S.V.N. Vishwanathan - Research Scientist - Zurich<br /> S.V.N Vishwanathan is a principal researcher in the Statistical Machine Learning program, National ICT Australia with an adjunct appointment at the College of Engineering and Computer Science(CECS), Australian National University. I got my Ph.D in 2002 from the Department of Computer Science and Automation (CSA) at the Indian Institute of Science.</p><p><a href="http://www.bestechvideos.com/2008/04/02/optimization-for-machine-learning">Read more about this video…</a></p><p><b>Want to control this feed contents?</b>&nbsp;<a href="http://www.bestechvideos.com/user/all/signup">Sign up here</a> and create your own feed!</p><hr/>Want more on these topics?<br/>Browse the archive of posts filed under <a href="http://www.bestechvideos.com/category/conferences">Conferences</a>, <a href="http://www.bestechvideos.com/category/companies">Companies</a>, <a href="http://www.bestechvideos.com/category/science">Science</a>, <a href="http://www.bestechvideos.com/category/conferences/techtalks">Techtalks</a>, <a href="http://www.bestechvideos.com/category/companies/google">Google</a>, <a href="http://www.bestechvideos.com/category/broadcasting/lectures">Lectures</a>, <a href="http://www.bestechvideos.com/category/science/computer-science">Computer Science</a> Mon, 07 Apr 2008 22:50:57 GMT http://www.bestechvideos.com/2008/04/02/optimization-for-machine-learning scoundrel http://www.bestechvideos.com/2008/04/02/c-stylistics <p>Google Tech Talks<br /> March, 5 2008<br /> <br /> ABSTRACT<br /> <br /> Both by accident and by design, C++ supports a number of different styles and approaches to programming. Its evolution from C gives it obvious support for a procedural systems programming style based on C idioms, but past, present and future language support opens up a wealth of other approaches and idioms, including object-oriented programming, generic programming and some elements of functional programming.<br /> <br /> This diversity is both a strength and a weakness. It can lead to code that is crisp and well matched to its problem. But it can also lead to code that is at best considered an exercise in groundless post-modernism or, less favorably, an unmaintainable and incoherent mess.<br /> <br /> This talk examines some of the styles and approaches, including their key strengths and accidental complexities, as well as consequences of and techniques for combining them.<br /> <br /> Speaker: Kevlin Henney<br /> Kevlin Henney is an independent consultant and trainer based in Bristol, UK. Kevlin's work focuses on software architecture, programming languages and development process. He has been a columnist for various magazines and online publications, including SearchSoftwareQuality.com, The Register, C/C++ Users Journal, C++ Report, JavaSpektrum and Java Report. With Frank Buschmann and Doug Schmidt, he is coauthor of two volumes in the Pattern-Oriented Software Architecture series: A Pattern Language for Distributed Computing and On Patterns and Pattern Languages.</p><p><a href="http://www.bestechvideos.com/2008/04/02/c-stylistics">Read more about this video…</a></p><p><b>Want to control this feed contents?</b>&nbsp;<a href="http://www.bestechvideos.com/user/all/signup">Sign up here</a> and create your own feed!</p><hr/>Want more on these topics?<br/>Browse the archive of posts filed under <a href="http://www.bestechvideos.com/category/development">Development</a>, <a href="http://www.bestechvideos.com/category/science">Science</a>, <a href="http://www.bestechvideos.com/category/conferences/techtalks">Techtalks</a>, <a href="http://www.bestechvideos.com/category/companies/google">Google</a>, <a href="http://www.bestechvideos.com/category/development/cc">C and C++</a>, <a href="http://www.bestechvideos.com/category/broadcasting/lectures">Lectures</a>, <a href="http://www.bestechvideos.com/category/science/computer-science">Computer Science</a> Wed, 02 Apr 2008 18:02:40 GMT http://www.bestechvideos.com/2008/04/02/c-stylistics scoundrel http://www.bestechvideos.com/2008/02/21/algorithms-for-data-management-and-migration <p>Google Tech Talks<br /> January, 23 2008<br /> <br /> ABSTRACT<br /> <br /> I will describe some algorithms for addressing some fundamental optimization problems that arise in the context of data storage and management. In the first part of the talk we will address the following question: How should we store data in order to effectively cope with non-uniform demand for data? How many copies of popular data objects do we need? Where should we store them for effective load balancing?<br /> <br /> In the second part of the talk we will address the issue of moving data objects quickly, to react to changing demand patterns. We will develop approximation algorithms for these problems.</p> <p>The first part of the talk is joint work with Golubchik, Khanna,Thurimella and Zhu. The second part is joint work with Kim and Wan.<br /> <br /> Speaker: Samir Khuller<br /> Samir Khuller received his M.S and Ph.D from Cornell University in 1989 and 1990, respectively. He spent 2 years as a Research Associate at the Institute for Advanced Computer Studies at the University of Maryland, before joining the Computer Science Department in 1992, where he is a Professor and Associate Chair in the Department of Computer Science.<br /> <br /> His research interests are in graph algorithms, discrete optimization, and computational geometry. He has published about 130 journal and conference papers, and several book chapters on these topics. He received the National Science Foundation's Career Development Award, the Dean's Teaching Excellence Award and also a CTE-Lilly Teaching Fellowship. In 2003, he and his students were awarded the &quot;Best newcomer paper&quot; award for the ACM PODS Conference. He received the University of Maryland's Distinguished Scholar Teacher Award in 2007.</p><p><a href="http://www.bestechvideos.com/2008/02/21/algorithms-for-data-management-and-migration">Read more about this video…</a></p><p><b>Want to control this feed contents?</b>&nbsp;<a href="http://www.bestechvideos.com/user/all/signup">Sign up here</a> and create your own feed!</p><hr/>Want more on these topics?<br/>Browse the archive of posts filed under <a href="http://www.bestechvideos.com/category/conferences">Conferences</a>, <a href="http://www.bestechvideos.com/category/companies">Companies</a>, <a href="http://www.bestechvideos.com/category/development">Development</a>, <a href="http://www.bestechvideos.com/category/science">Science</a>, <a href="http://www.bestechvideos.com/category/conferences/techtalks">Techtalks</a>, <a href="http://www.bestechvideos.com/category/companies/google">Google</a>, <a href="http://www.bestechvideos.com/category/broadcasting/lectures">Lectures</a>, <a href="http://www.bestechvideos.com/category/science/computer-science">Computer Science</a> Mon, 24 Mar 2008 16:11:11 GMT http://www.bestechvideos.com/2008/02/21/algorithms-for-data-management-and-migration scoundrel http://www.bestechvideos.com/2008/03/17/thoughtworks-india-day-in-the-life-of-an-iteration-manager <p>What's it like to be a ThoughtWorker in India? Here, a ThoughtWorks Iteration Manager shares his experiences being part of the ThoughtWorks team.</p><p><a href="http://www.bestechvideos.com/2008/03/17/thoughtworks-india-day-in-the-life-of-an-iteration-manager">Read more about this video…</a></p><p><b>Want to control this feed contents?</b>&nbsp;<a href="http://www.bestechvideos.com/user/all/signup">Sign up here</a> and create your own feed!</p><hr/>Want more on these topics?<br/>Browse the archive of posts filed under <a href="http://www.bestechvideos.com/category/companies">Companies</a>, <a href="http://www.bestechvideos.com/category/databases">Databases</a>, <a href="http://www.bestechvideos.com/category/broadcasting/lectures">Lectures</a>, <a href="http://www.bestechvideos.com/category/science/computer-science">Computer Science</a> Sat, 22 Mar 2008 05:02:13 GMT http://www.bestechvideos.com/2008/03/17/thoughtworks-india-day-in-the-life-of-an-iteration-manager rajivmathew http://www.bestechvideos.com/2008/02/21/practical-quantum-cryptography-and-possible-attacks <p>Google Tech Talks<br /> January, 24 2008<br /> <br /> ABSTRACT<br /> <br /> Quantum cryptography is actually about secure distribution of an encryption key between two parties. In this talk I give an introduction to practical quantum cryptography. I will describe the technical details of a few implementations, how the security of the distributed key might be compromised, and what steps can be taken to prevent this. <br /> <br /> Speaker: Alexander Ling<br /> Alexander Ling is a graduate student with the Experimental Quantum Optics group in the Center for Quantum Technologies in Singapore. He has spent the last four years building sources of high-quality polarization-entangled photon-pairs. The entangled light is then used for various things like testing the validity of quantum mechanics and quantum key distribution.<br /> He hopes to complete his Ph.D. in 4 months.</p><p><a href="http://www.bestechvideos.com/2008/02/21/practical-quantum-cryptography-and-possible-attacks">Read more about this video…</a></p><p><b>Want to control this feed contents?</b>&nbsp;<a href="http://www.bestechvideos.com/user/all/signup">Sign up here</a> and create your own feed!</p><hr/>Want more on these topics?<br/>Browse the archive of posts filed under <a href="http://www.bestechvideos.com/category/web-tech">Technologies</a>, <a href="http://www.bestechvideos.com/category/science">Science</a>, <a href="http://www.bestechvideos.com/category/conferences/techtalks">Techtalks</a>, <a href="http://www.bestechvideos.com/category/companies/google">Google</a>, <a href="http://www.bestechvideos.com/category/broadcasting/lectures">Lectures</a>, <a href="http://www.bestechvideos.com/category/science/computer-science">Computer Science</a> Thu, 13 Mar 2008 16:20:05 GMT http://www.bestechvideos.com/2008/02/21/practical-quantum-cryptography-and-possible-attacks scoundrel http://www.bestechvideos.com/2008/02/21/speech-recognition-and-retrieval-using-unsupervised-sub-word-language-models <p>Google Tech Talks<br /> February, 8 2008<br /> <br /> ABSTRACT<br /> <br /> Unsupervised morpheme analysis and language models developed at Helsinki University of Technology (TKK) open interesting new views on large vocabulary speech recognition, information retrieval and machine translation.</p> <p>This approach learns suitable sub-word units directly from relevant text corpora in a completely data-driven manner and can, thus, be easily ported to various morphologically complex languages. Our system includes several public domain software packages: Morfessor for determining the modeling units, VariKN to train effectively smoothed long-span LMs, a near-realtime single-pass decoder for LMs and LVCSR, and demos at: <br /> http://www.cis.hut.fi/projects/morpho/<br /> http://www.cis.hut.fi/projects/speech/<br /> <br /> I will also summarize the results from the recent Morpho Challenge machine learning competitions in morpheme analysis for language modeling and information retrieval:<br /> http://www.cis.hut.fi/morphochallenge2007/<br /> <br /> Speaker: Mikko Kurimo<br /> Mikko Kurimo is currently Academy Research Fellow at Helsinki University of Technology (TKK), where he was an acting professor of Computer and Information Science (2001-2003). In 1998-2000 he worked as a postdoc at IDIAP and his Doctor of Science (PhD) degree is from TKK 1997. He has a long research record and a number of publications in large vocabulary speech recognition (since 1990) and has been involved in several international and national research projects and is TKK's site manager in the FP6 Network of Excellence PASCAL.</p> <p>At TKK's Adaptive Informatics Research Centre (which is one of the Centres of Excellence nominated by the Academy of Finland) he leads the Speech Recognition and Multimodal Interfaces research groups. The current research focus of his speech group is in language independent and unsupervised models for continuous speech with morpheme-based language models for very large vocabulary. The relevant pilot applications in the group range from unlimited vocabulary dictation systems for different languages to audio indexing and speech-to-speech translation. At the moment Mikko Kurimo is an International Fellow at SRI until February 2008.</p><p><a href="http://www.bestechvideos.com/2008/02/21/speech-recognition-and-retrieval-using-unsupervised-sub-word-language-models">Read more about this video…</a></p><p><b>Want to control this feed contents?</b>&nbsp;<a href="http://www.bestechvideos.com/user/all/signup">Sign up here</a> and create your own feed!</p><hr/>Want more on these topics?<br/>Browse the archive of posts filed under <a href="http://www.bestechvideos.com/category/science">Science</a>, <a href="http://www.bestechvideos.com/category/conferences/techtalks">Techtalks</a>, <a href="http://www.bestechvideos.com/category/companies/google">Google</a>, <a href="http://www.bestechvideos.com/category/broadcasting/lectures">Lectures</a>, <a href="http://www.bestechvideos.com/category/science/computer-science">Computer Science</a> Mon, 10 Mar 2008 17:00:08 GMT http://www.bestechvideos.com/2008/02/21/speech-recognition-and-retrieval-using-unsupervised-sub-word-language-models scoundrel http://www.bestechvideos.com/2008/02/21/the-openonload-user-level-network-stack <p>Google Tech Talks<br /> February, 7 2008<br /> <br /> ABSTRACT<br /> <br /> The architecture of conventional networked systems has remained largely constant for many years now. However, some specialised application domains have adopted alternative architectures. For example, the HPC community uses message passing libraries which perform network processing in user-space in conjunction with the features of user-accessible network interfaces. Such user-level networking reduces networking overheads considerably without sacrificing the security and resource management functionality that the operating system normally provides.<br /> <br /> Supporting user-level TCP/UDP/IP networking for a more general set of applications poses considerable challenges, including: intercepting system calls, binary compatability with existing applications, maintaining security, supporting fork() and exec(), passing sockets through Unix domain sockets and advancing the protocol when the application is not scheduled.</p> <p>This talk presents the OpenOnload architecture for user-level networking. We describe our solutions to the challenges outlined above, and novel techniques to reduce CPU overhead, avoid lock contention, minimise interrupt overheads and improve cache efficiency. Finally we present performance results of the OpenOnload stack including protocol compliance, and plans for further work within the open source community.<br /> <br /> Speaker: Steven Pope<br /> Steven Pope is a CTO at Solarflare Communications. Previously he co-founded Level 5 Networks and prior to that was a post-doctorate researcher in the field of high-speed networks and operating systems at Olivetti Research Labs, which later became AT&amp;T Laboratories Cambridge. He holds a PhD in Computer Science from the University of<br /> Cambridge.<br /> <br /> Speaker: David Riddoch<br /> David Riddoch is Chief Software Architect at Solarflare Communications. David joined Solarflare with the merger of Solarflare with Level 5 Networks in April 2006. David co-founded Level 5 Networks in July 2002. Previously, David was the architect and lead developer of the software for the CLAN high performance network project at AT&amp;T Laboratories Cambridge. David holds a first class degree in computer science and a Ph.D. in high performance networking from the University of Cambridge.</p><p><a href="http://www.bestechvideos.com/2008/02/21/the-openonload-user-level-network-stack">Read more about this video…</a></p><p><b>Want to control this feed contents?</b>&nbsp;<a href="http://www.bestechvideos.com/user/all/signup">Sign up here</a> and create your own feed!</p><hr/>Want more on these topics?<br/>Browse the archive of posts filed under <a href="http://www.bestechvideos.com/category/networking">Networking</a>, <a href="http://www.bestechvideos.com/category/science">Science</a>, <a href="http://www.bestechvideos.com/category/conferences/techtalks">Techtalks</a>, <a href="http://www.bestechvideos.com/category/companies/google">Google</a>, <a href="http://www.bestechvideos.com/category/broadcasting/lectures">Lectures</a>, <a href="http://www.bestechvideos.com/category/science/computer-science">Computer Science</a> Sun, 09 Mar 2008 20:08:17 GMT http://www.bestechvideos.com/2008/02/21/the-openonload-user-level-network-stack scoundrel http://www.bestechvideos.com/2008/03/09/what-do-we-do-with-10-12-transistors-the-case-for-precision-timing <p>Google Tech Talks<br /> February, 21 2008<br /> <br /> ABSTRACT<br /> <br /> It is will be too costly to design many of these chips at the polygon or even gate level, so they must be highly programmable. Furthermore, they should not just be FPGAs as we now know them because with that many transistors, we should specialize more for power efficiency. I envision FPGA-like chips where the computational elements combine CPUs with more traditional FPGA-like fabrics.<br /> <br /> For embedded real-time applications, which I argue will dominate, I argue that the temporal behavior of these processors should be as easy to analyze and control as their functional behavior.<br /> <br /> I present a vision such a precision-timed (PRET) processor, which incorporates a variety of techniques. At the ISA level, it provides cycle-accurate timers, a predictable memory hierarchy based on scratchpad memories, and an interleaved pipeline that provides predictable, hardware-efficient concurrency. It will be programmed in a C-like language that includes user-specified timing constraints and<br /> concurrency, perhaps with synchronous semantics. Both compile- and run-time checks will ensure the program meets timing constraints, similar to array bounds checking.<br /> <br /> Speaker: Stephen A. Edwards<br /> Stephen A. Edwards received the B.S. degree in Electrical Engineering from the California Institute of Technology in 1992, and the M.S. and Ph.D degrees, also in Electrical Engineering, from the University of California, Berkeley in 1994 and 1997 respectively. He is currently an associate professor in the Computer Science Department of Columbia University in New York, which he joined in 2001 after a three-year stint with Synopsys, Inc., in Mountain View, California. His research<br /> interests include embedded system design, domain-specific languages, and compilers.</p><p><a href="http://www.bestechvideos.com/2008/03/09/what-do-we-do-with-10-12-transistors-the-case-for-precision-timing">Read more about this video…</a></p><p><b>Want to control this feed contents?</b>&nbsp;<a href="http://www.bestechvideos.com/user/all/signup">Sign up here</a> and create your own feed!</p><hr/>Want more on these topics?<br/>Browse the archive of posts filed under <a href="http://www.bestechvideos.com/category/science">Science</a>, <a href="http://www.bestechvideos.com/category/conferences/techtalks">Techtalks</a>, <a href="http://www.bestechvideos.com/category/companies/google">Google</a>, <a href="http://www.bestechvideos.com/category/broadcasting/lectures">Lectures</a>, <a href="http://www.bestechvideos.com/category/science/computer-science">Computer Science</a> Sun, 09 Mar 2008 20:02:17 GMT http://www.bestechvideos.com/2008/03/09/what-do-we-do-with-10-12-transistors-the-case-for-precision-timing scoundrel http://www.bestechvideos.com/2007/12/20/syntax-augmented-machine-translation <p>Google Tech Talks<br /> December, 17 2007<br /> <br /> ABSTRACT<br /> <br /> Ashish Venugopal - RESEARCH SCIENTIST<br /> <br /> Probabilistic Synchronous Context Free Grammars hold significant promise for machine translation, modeling context sensitive translation and re-odering effects with simple hierarchical operations learned directly from parallel data. Source language sentences are transformed into target language sentences via intermediate nonterminal symbols, typically via bottom up chart parsing with these grammars.<br /> <br /> Introducing an N-Gram language model into this search space introduces dependencies between consecutive chart items, making exact search computationally difficult. We present a two pass approach that is motivated by grammars which include a large number of nonterminal symbols. We evaluate this method against a state of the art single pass approach.<br /> <br /> The motivation for this two pass approach comes from a desire to include a large number of nonterminal labels in the translation grammar. Initial results using labels from associated phrase structure parse trees are promising, but this data is often noisy and requires human data generation. We propose a novel method to discriminatively learn nonterminal labels towards directly improving translation quality.<br /> <br /> Speaker: Ashish Venugopal</p><p><a href="http://www.bestechvideos.com/2007/12/20/syntax-augmented-machine-translation">Read more about this video…</a></p><p><b>Want to control this feed contents?</b>&nbsp;<a href="http://www.bestechvideos.com/user/all/signup">Sign up here</a> and create your own feed!</p><hr/>Want more on these topics?<br/>Browse the archive of posts filed under <a href="http://www.bestechvideos.com/category/conferences">Conferences</a>, <a href="http://www.bestechvideos.com/category/web-tech">Technologies</a>, <a href="http://www.bestechvideos.com/category/companies">Companies</a>, <a href="http://www.bestechvideos.com/category/development">Development</a>, <a href="http://www.bestechvideos.com/category/broadcasting">Broadcasting</a>, <a href="http://www.bestechvideos.com/category/science">Science</a>, <a href="http://www.bestechvideos.com/category/conferences/techtalks">Techtalks</a>, <a href="http://www.bestechvideos.com/category/companies/google">Google</a>, <a href="http://www.bestechvideos.com/category/broadcasting/lectures">Lectures</a>, <a href="http://www.bestechvideos.com/category/science/computer-science">Computer Science</a> Thu, 20 Dec 2007 05:20:04 GMT http://www.bestechvideos.com/2007/12/20/syntax-augmented-machine-translation scoundrel http://www.bestechvideos.com/2007/12/08/theory-and-practice-of-cryptography-2 <p>Google Tech Talks<br /> <br /> <br /> Topics include: Introduction to Modern Cryptography, Using Cryptography in Practice and at Google, Proofs of Security and Security Definitions and A Special Topic in Cryptography <br /> <br /> This talk is one in a series hosted by Google University: Wednesdays, 11/28/07 - 12/19/07 from 1-2pm<br /> <br /> Speaker: Steve Weis<br /> Steve Weis received his PhD from the Cryptography and Information Security group at MIT, where he was advised by Ron Rivest. He is a member of Google's Applied Security (AppSec) team and is the technical lead for Google's internal cryptographic library, KeyMaster.</p><p><a href="http://www.bestechvideos.com/2007/12/08/theory-and-practice-of-cryptography-2">Read more about this video…</a></p><p><b>Want to control this feed contents?</b>&nbsp;<a href="http://www.bestechvideos.com/user/all/signup">Sign up here</a> and create your own feed!</p><hr/>Want more on these topics?<br/>Browse the archive of posts filed under <a href="http://www.bestechvideos.com/category/conferences">Conferences</a>, <a href="http://www.bestechvideos.com/category/companies">Companies</a>, <a href="http://www.bestechvideos.com/category/broadcasting">Broadcasting</a>, <a href="http://www.bestechvideos.com/category/science">Science</a>, <a href="http://www.bestechvideos.com/category/conferences/techtalks">Techtalks</a>, <a href="http://www.bestechvideos.com/category/companies/google">Google</a>, <a href="http://www.bestechvideos.com/category/broadcasting/lectures">Lectures</a>, <a href="http://www.bestechvideos.com/category/science/computer-science">Computer Science</a> Thu, 20 Dec 2007 04:36:34 GMT http://www.bestechvideos.com/2007/12/08/theory-and-practice-of-cryptography-2 scoundrel http://www.bestechvideos.com/2007/12/08/a-formal-approach-for-developing-reliable-service-based-systems <p>Google Tech Talks<br /> November, 29 2007<br /> <br /> ABSTRACT<br /> <br /> Service-based systems are increasingly being used for deploying large-scale applications in mission-critical environments. In such a system, applications are built by combining services, which are platform independent components running on different hosts of a wireless network. Prime concerns in such systems include, among others, adaptability to unforeseen situations (e.g., behaviors of services can be modified due to unforeseen events such as node failures or distributed denial of service attacks), situation-awareness (in order to detect changes in the environment and adapt accordingly) and security.<br /> <br /> In this talk, we present a formal approach to developing adaptable, situation-aware, secure service-based distributed systems. To this end, we first present a process calculus-based programming model for such systems. The operational semantics of the model combines external behaviors with internal computation for accessing current situation and dynamically adapting and reacting to it. Continuation passing is used for handling asynchronous service invocations. In order to declaratively specify properties of such systems, we introduce an intuitionistic hybrid modal logic. The logic not only has modalities for expressing both temporal and spatial behavior but also constructs for describing communication and knowledge and atomic formulas for describing relations between variables. We show how intelligent agents can be automatically synthesized from declarative specifications in the logic and deployed wirelessly. In order to deploy the synthesized agents, we have developed, jointly with the Naval Research Laboratory, the Secure Infrastructure for Networked Systems (SINS), a middleware platform built on the top of JHU's Spread group communication toolkit. In the last part of the talk, we provide a demo of a mission-critical application for intelligent management of a power system developed using the approach mentioned above and deployed on the SINS platform.<br /> <br /> Speaker: Dr. Supratik Mukhopadhyay<br /> Dr. Supratik Mukhopadhyay is an Assistant Professor at the Utah State University where he heads the Distributed Software Laboratory. His research interests lie in the areas of distributed systems, software engineering, programming languages, and sensor networks.</p><p><a href="http://www.bestechvideos.com/2007/12/08/a-formal-approach-for-developing-reliable-service-based-systems">Read more about this video…</a></p><p><b>Want to control this feed contents?</b>&nbsp;<a href="http://www.bestechvideos.com/user/all/signup">Sign up here</a> and create your own feed!</p><hr/>Want more on these topics?<br/>Browse the archive of posts filed under <a href="http://www.bestechvideos.com/category/conferences">Conferences</a>, <a href="http://www.bestechvideos.com/category/companies">Companies</a>, <a href="http://www.bestechvideos.com/category/broadcasting">Broadcasting</a>, <a href="http://www.bestechvideos.com/category/science">Science</a>, <a href="http://www.bestechvideos.com/category/conferences/techtalks">Techtalks</a>, <a href="http://www.bestechvideos.com/category/companies/google">Google</a>, <a href="http://www.bestechvideos.com/category/broadcasting/lectures">Lectures</a>, <a href="http://www.bestechvideos.com/category/science/computer-science">Computer Science</a> Thu, 20 Dec 2007 04:35:55 GMT http://www.bestechvideos.com/2007/12/08/a-formal-approach-for-developing-reliable-service-based-systems scoundrel http://www.bestechvideos.com/2007/12/16/getting-c-threads-right <p>Google Tech Talks<br /> December, 12 2007<br /> <br /> ABSTRACT<br /> <br /> The advent of multicore processors has generated profound debate on the merits of writing parallel programs with threads and locks. Nonetheless, for many application domains, this remains the standard paradigm for writing parallel programs, and at the moment, there is no apparent universal replacement. And it is the focus of this talk.<br /> <br /> Somewhat surprisingly, there are a number of often subtle, but generally fixable, industry-wide problems with current approaches to threads programming. We'll focus on probably the most widely used environments, consisting of C or C++ with a standard threads library. Problems span the spectrum from system libraries through language implementations through supporting hardware. They get in the way both in that they often make it difficult to write 100% reliable multi-threaded software, and in that they confuse even the basics of the programming model, thus making it hard to teach. A surprising number of &quot;experts&quot; do not understand the basic rules. Arguably, these problems really need to be addressed to even allow a meaningful comparison to other parallel programming approaches.<br /> <br /> Since solutions to these problems generally require a coordinated industry effort, we helped to persuade the C++ standards committee to address them by pursuing a coherent approach to threads in the next C++ standard. The talk will outline some of the proposed solutions, and give an update on this effort.<br /> <br /> Speaker: Hans Boehm<br /> Hans Boehm is a member of the advanced architecture group at HP Labs. He has worked on many aspects of programming language design and implementation, including garbage collection and concurrency, and he was HP's representative to the effort to redesign Java's memory model. He is a past Chair of ACM SIGPLAN, and is an ACM Distinguished Scientist.</p><p><a href="http://www.bestechvideos.com/2007/12/16/getting-c-threads-right">Read more about this video…</a></p><p><b>Want to control this feed contents?</b>&nbsp;<a href="http://www.bestechvideos.com/user/all/signup">Sign up here</a> and create your own feed!</p><hr/>Want more on these topics?<br/>Browse the archive of posts filed under <a href="http://www.bestechvideos.com/category/conferences">Conferences</a>, <a href="http://www.bestechvideos.com/category/companies">Companies</a>, <a href="http://www.bestechvideos.com/category/development">Development</a>, <a href="http://www.bestechvideos.com/category/broadcasting">Broadcasting</a>, <a href="http://www.bestechvideos.com/category/science">Science</a>, <a href="http://www.bestechvideos.com/category/conferences/techtalks">Techtalks</a>, <a href="http://www.bestechvideos.com/category/companies/google">Google</a>, <a href="http://www.bestechvideos.com/category/development/cc">C and C++</a>, <a href="http://www.bestechvideos.com/category/broadcasting/lectures">Lectures</a>, <a href="http://www.bestechvideos.com/category/science/computer-science">Computer Science</a> Sun, 16 Dec 2007 18:35:37 GMT http://www.bestechvideos.com/2007/12/16/getting-c-threads-right scoundrel http://www.bestechvideos.com/2007/12/16/quantum-computing-day-1-introduction-to-quantum-computing <p>Google Tech Talks<br /> December, 6 2007<br /> <br /> ABSTRACT<br /> <br /> This tech talk series explores the enormous opportunities afforded by the emerging field of quantum computing. The exploitation of quantum phenomena not only offers tremendous speed-ups for important algorithms but may also prove key to achieving genuine synthetic intelligence. We argue that understanding higher brain function requires references to quantum mechanics as well. These talks look at the topic of quantum computing from mathematical, engineering and neurobiological perspectives, and we attempt to present the material so that the base concepts can be understood by listeners with no background in quantum physics.<br /> <br /> This first talk of the series introduces the basic concepts of quantum computing. We start by looking at the difference in describing a classical and a quantum mechanical system. The talk discusses the Turing machine in quantum mechanical terms and introduces the notion of a qubit. We study the gate model of quantum computing and look at the famous quantum algorithms of Deutsch, Grover and Shor. Finally we talk about decoherence and how it destroys superposition states which is the main obstacle to building large scale quantum computers. We clarify widely held misconceptions about decoherence and explain that environmental interaction tends to choose a basis in state space in which the system decoheres while leaving coherences in other coordinate systems intact.<br /> <br /> Speaker: Hartmut Neven</p><p><a href="http://www.bestechvideos.com/2007/12/16/quantum-computing-day-1-introduction-to-quantum-computing">Read more about this video…</a></p><p><b>Want to control this feed contents?</b>&nbsp;<a href="http://www.bestechvideos.com/user/all/signup">Sign up here</a> and create your own feed!</p><hr/>Want more on these topics?<br/>Browse the archive of posts filed under <a href="http://www.bestechvideos.com/category/conferences">Conferences</a>, <a href="http://www.bestechvideos.com/category/companies">Companies</a>, <a href="http://www.bestechvideos.com/category/broadcasting">Broadcasting</a>, <a href="http://www.bestechvideos.com/category/science">Science</a>, <a href="http://www.bestechvideos.com/category/conferences/techtalks">Techtalks</a>, <a href="http://www.bestechvideos.com/category/companies/google">Google</a>, <a href="http://www.bestechvideos.com/category/broadcasting/lectures">Lectures</a>, <a href="http://www.bestechvideos.com/category/science/computer-science">Computer Science</a> Sun, 16 Dec 2007 18:31:11 GMT http://www.bestechvideos.com/2007/12/16/quantum-computing-day-1-introduction-to-quantum-computing scoundrel http://www.bestechvideos.com/2007/12/08/the-next-generation-of-neural-networks <p>Google Tech Talks<br /> November, 29 2007<br /> <br /> In the 1980's, new learning algorithms for neural networks promised to solve difficult classification tasks, like speech or object recognition, by learning many layers of non-linear features. The results were disappointing for two reasons: There was never enough labeled data to learn millions of complicated features and the learning was much too slow in deep neural networks with many layers of features. These problems can now be overcome by learning one layer of features at a time and by changing the goal of learning. Instead of trying to predict the labels, the learning algorithm tries to create a generative model that produces data which looks just like the unlabeled training data. These new neural networks outperform other machine learning methods when labeled data is scarce but unlabeled data is plentiful. An application to very fast<br /> document retrieval will be described.<br /> <br /> Speaker: Geoffrey Hinton<br /> Geoffrey Hinton received his BA in experimental psychology from Cambridge in 1970 and his PhD in Artificial Intelligence from Edinburgh in 1978. He did postdoctoral work at Sussex University and the University of California San Diego and spent five years as a faculty member in the Computer Science department at Carnegie-Mellon University. He then became a fellow of the Canadian Institute for Advanced Research and moved to the Department of Computer Science at the University of Toronto. He spent three years from 1998 until 2001 setting up the Gatsby Computational Neuroscience Unit at University College London and then returned to the University of Toronto where he is a<br /> University Professor. He holds a Canada Research Chair in Machine Learning. He is the director of the program on &quot;Neural Computation and Adaptive Perception&quot; which is funded by the Canadian Institute for Advanced Research.<br /> <br /> Geoffrey Hinton is a fellow of the Royal Society, the Royal Society of Canada, and the Association for the Advancement of Artificial Intelligence. He is an honorary foreign member of the American Academy of Arts and Sciences, and a former president of the Cognitive Science Society. He received an honorary doctorate from the University of Edinburgh in 2001. He was awarded the first David E. Rumelhart prize (2001), the IJCAI award for research excellence (2005), the IEEE Neural Network Pioneer award (1998) and the ITAC/NSERC award for contributions to information technology (1992).<br /> <br /> A simple introduction to Geoffrey Hinton's research can be found in his articles in Scientific American in September 1992 and October 1993. He investigates ways of using neural networks for learning, memory, perception and symbol processing and has over 200 publications in these areas. He was one of the researchers who introduced the back-propagation algorithm that has been widely used for practical applications. His other contributions to neural network research include Boltzmann machines, distributed representations, time-delay neural nets, mixtures of experts, Helmholtz machines and products of experts. His current main interest is in unsupervised learning procedures for neural networks with rich sensory input.</p> <p>&nbsp;</p><p><a href="http://www.bestechvideos.com/2007/12/08/the-next-generation-of-neural-networks">Read more about this video…</a></p><p><b>Want to control this feed contents?</b>&nbsp;<a href="http://www.bestechvideos.com/user/all/signup">Sign up here</a> and create your own feed!</p><hr/>Want more on these topics?<br/>Browse the archive of posts filed under <a href="http://www.bestechvideos.com/category/conferences">Conferences</a>, <a href="http://www.bestechvideos.com/category/web-tech">Technologies</a>, <a href="http://www.bestechvideos.com/category/companies">Companies</a>, <a href="http://www.bestechvideos.com/category/broadcasting">Broadcasting</a>, <a href="http://www.bestechvideos.com/category/science">Science</a>, <a href="http://www.bestechvideos.com/category/conferences/techtalks">Techtalks</a>, <a href="http://www.bestechvideos.com/category/companies/google">Google</a>, <a href="http://www.bestechvideos.com/category/broadcasting/lectures">Lectures</a>, <a href="http://www.bestechvideos.com/category/science/computer-science">Computer Science</a> Wed, 12 Dec 2007 17:57:56 GMT http://www.bestechvideos.com/2007/12/08/the-next-generation-of-neural-networks scoundrel http://www.bestechvideos.com/2007/11/05/domain-adaptation-with-structural-correspondence-learning <p>Google Tech Talks<br /> September, 5 2007<br /> <br /> ABSTRACT<br /> <br /> Statistical language processing tools are being applied to an<br /> ever-wider and more varied range of linguistic data. Researchers and<br /> engineers are using statistical models to organize and understand<br /> financial news, legal documents, biomedical abstracts, and weblog<br /> entries, among many other domains. Because language varies so widely,<br /> collecting and curating training sets for each different domain is<br /> prohibitively expensive. At the same time, differences in vocabulary<br /> and writing style across domains can cause state-of-the-art supervised<br /> models to dramatically increase in error.<br /> <br /> This talk describes structural correspondence learning (SCL), a method<br /> for adapting models from resource-rich source domains to resource-poor<br /> target domains. SCL uses unlabeled data from both domains to induce a<br /> common feature representation for domain adaptation. We demonstrate<br /> SCL for two NLP tasks: sentiment classification and part of speech<br /> tagging. For each of these tasks, SCL significantly reduces the error<br /> of a state-of-the-art discriminative model.<br /> <br /> Speaker: John Blitzer</p><p><a href="http://www.bestechvideos.com/2007/11/05/domain-adaptation-with-structural-correspondence-learning">Read more about this video…</a></p><p><b>Want to control this feed contents?</b>&nbsp;<a href="http://www.bestechvideos.com/user/all/signup">Sign up here</a> and create your own feed!</p><hr/>Want more on these topics?<br/>Browse the archive of posts filed under <a href="http://www.bestechvideos.com/category/conferences">Conferences</a>, <a href="http://www.bestechvideos.com/category/companies">Companies</a>, <a href="http://www.bestechvideos.com/category/broadcasting">Broadcasting</a>, <a href="http://www.bestechvideos.com/category/science">Science</a>, <a href="http://www.bestechvideos.com/category/conferences/techtalks">Techtalks</a>, <a href="http://www.bestechvideos.com/category/companies/google">Google</a>, <a href="http://www.bestechvideos.com/category/broadcasting/lectures">Lectures</a>, <a href="http://www.bestechvideos.com/category/science/computer-science">Computer Science</a> Wed, 12 Dec 2007 17:57:22 GMT http://www.bestechvideos.com/2007/11/05/domain-adaptation-with-structural-correspondence-learning scoundrel http://www.bestechvideos.com/2007/12/12/devel-sdb-smart-debugger <p>Devel::sdb (Smart Debugger for Perl)</p><p><a href="http://www.bestechvideos.com/2007/12/12/devel-sdb-smart-debugger">Read more about this video…</a></p><p><b>Want to control this feed contents?</b>&nbsp;<a href="http://www.bestechvideos.com/user/all/signup">Sign up here</a> and create your own feed!</p><hr/>Want more on these topics?<br/>Browse the archive of posts filed under <a href="http://www.bestechvideos.com/category/development">Development</a>, <a href="http://www.bestechvideos.com/category/os/linux">Linux</a>, <a href="http://www.bestechvideos.com/category/development/perl">Perl</a>, <a href="http://www.bestechvideos.com/category/development/python">Python</a>, <a href="http://www.bestechvideos.com/category/development/ruby">Ruby</a>, <a href="http://www.bestechvideos.com/category/broadcasting/screencasts">Screencasts</a>, <a href="http://www.bestechvideos.com/category/science/computer-science">Computer Science</a> Wed, 12 Dec 2007 17:56:39 GMT http://www.bestechvideos.com/2007/12/12/devel-sdb-smart-debugger kraman http://www.bestechvideos.com/2007/12/01/recommenders-everywhere-the-wikilens-community-maintained-recommender-system <p>Google Tech Talks<br /> November, 13 2007<br /> <br /> Suppose you have a passion for items of a certain type, and you wish to start a recommender system around those items. You want a system like Amazon or Epinions, but for cookie recipes, local theater, or microbrew beer. How can you set up your recommender system without assembling complicated algorithms, large software infrastructure, a large community of contributors, or even a full catalog of items?<br /> <br /> WikiLens is open source software that enables anyone, anywhere to start a community-maintained recommender around any type of item. We introduce five principles for community-maintained recommenders that address the two<br /> key issues: (1) community contribution of items and associated information; and (2) finding items of interest. Since all recommender communities start small, we look at feasibility and utility in the small world, one with few users, few items, few ratings. We describe the features of WikiLens, which are based on our principles, and give lessons learned from two years of experience running<br /> wikilens.org.<br /> <br /> Speaker: Dan Frankowski<br /> Dan Frankowski is both computer science researcher and practitioner in software and algorithms development. He got his master's degree in computer science from the University of Minnesota in 1993, then spent a year in Budapest on a Fulbright grant studying mathematics. From 1997 to 2003 he was an algorithms guy at Net Perceptions. From 2003 to 2006 he was a research fellow with the GroupLens research group at the Unviersity of Minnesota, which is most well-known for recommenders, but now studies online community more broadly. He now works as a software engineer for Google Groups.</p><p><a href="http://www.bestechvideos.com/2007/12/01/recommenders-everywhere-the-wikilens-community-maintained-recommender-system">Read more about this video…</a></p><p><b>Want to control this feed contents?</b>&nbsp;<a href="http://www.bestechvideos.com/user/all/signup">Sign up here</a> and create your own feed!</p><hr/>Want more on these topics?<br/>Browse the archive of posts filed under <a href="http://www.bestechvideos.com/category/web-tech">Technologies</a>, <a href="http://www.bestechvideos.com/category/broadcasting">Broadcasting</a>, <a href="http://www.bestechvideos.com/category/business">Business</a>, <a href="http://www.bestechvideos.com/category/science">Science</a>, <a href="http://www.bestechvideos.com/category/broadcasting/lectures">Lectures</a>, <a href="http://www.bestechvideos.com/category/science/computer-science">Computer Science</a> Sat, 08 Dec 2007 21:18:48 GMT http://www.bestechvideos.com/2007/12/01/recommenders-everywhere-the-wikilens-community-maintained-recommender-system scoundrel http://www.bestechvideos.com/2007/11/17/the-web-as-an-implicit-training-set <p>Google Tech Talks<br /> November, 5 2007<br /> <br /> ABSTRACT<br /> <br /> Speaker: Preslav Nakov<br /> <br /> I will present Web-based approaches to the syntax and semantics of noun compounds (NCs), which can be used in query parsing, technical term understanding, etc. I will also describe an application to machine translation. First, I will present a highly accurate lightly supervised method based on surface features and paraphrases for making bracketing decisions for three-word noun compounds, e.g. &quot;[[liver cell] antibody]&quot; is left-bracketed, while &quot;[liver [cell line]]&quot; is right-bracketed. The enormous size of the Web makes such features frequent enough to be useful. Second, I will introduce an unsupervised method for discovering the implicit predicates characterizing the semantic relations that hold in noun-noun compounds. For example, &quot;malaria mosquito&quot; is a &quot;mosquito that carries/spreads/causes/transmits/brings/infects with/... malaria&quot;. Finally, I will present a method for improving Machine Translation (SMT). Most modern SMT systems rely on aligned sentences of bilingual corpora for training. I will describe a method for expanding the training set with conceptually similar but syntactically differing paraphrases at the NP-level which involve NCs. The English to Spanish evaluation on the Europarl corpus shows an improvement equivalent to 33%-50% of that of doubling the amount of training data.</p><p><a href="http://www.bestechvideos.com/2007/11/17/the-web-as-an-implicit-training-set">Read more about this video…</a></p><p><b>Want to control this feed contents?</b>&nbsp;<a href="http://www.bestechvideos.com/user/all/signup">Sign up here</a> and create your own feed!</p><hr/>Want more on these topics?<br/>Browse the archive of posts filed under <a href="http://www.bestechvideos.com/category/conferences">Conferences</a>, <a href="http://www.bestechvideos.com/category/companies">Companies</a>, <a href="http://www.bestechvideos.com/category/broadcasting">Broadcasting</a>, <a href="http://www.bestechvideos.com/category/science">Science</a>, <a href="http://www.bestechvideos.com/category/conferences/techtalks">Techtalks</a>, <a href="http://www.bestechvideos.com/category/companies/google">Google</a>, <a href="http://www.bestechvideos.com/category/broadcasting/lectures">Lectures</a>, <a href="http://www.bestechvideos.com/category/science/computer-science">Computer Science</a> Sat, 08 Dec 2007 21:17:12 GMT http://www.bestechvideos.com/2007/11/17/the-web-as-an-implicit-training-set scoundrel http://www.bestechvideos.com/2007/12/01/symbolic-execution-and-model-checking-for-testing <p>Google Tech Talks<br /> November, 16 2007<br /> <br /> This talk describes techniques that use model checking and symbolic<br /> execution for test input generation. Abstract state matching is used<br /> to avoid generation of redundant inputs. The techniques handle complex<br /> data structures, arrays, as well as multithreading, and generate<br /> optimized test suites that satisfy user-specified testing coverage<br /> criteria. The techniques are applicable to both (executable) models<br /> and to code, and can be used in black box or white box fashion. We<br /> have applied the techniques to generate test sequences for<br /> object-oriented code and to generate test vectors for NASA software.<br /> <br /> Speaker: Corina Pasareanu<br /> Corina is a Research Scientist at NASA Ames Research Center, in the Robust Software Engineering Group, employed by Perot Systems Government Services. She received her Ph.D. in Computer Science from Kansas State University. She is currently investigating the use of abstraction and symbolic execution in the context of the Java PathFinder model checker, with applications in test input generation and error detection. She is also working on using learning techniques for automating assume-guarantee compositional verification. Her other research interests involve the design of a command execution language and the verification of the associated execution system (PLEXIL).</p><p><a href="http://www.bestechvideos.com/2007/12/01/symbolic-execution-and-model-checking-for-testing">Read more about this video…</a></p><p><b>Want to control this feed contents?</b>&nbsp;<a href="http://www.bestechvideos.com/user/all/signup">Sign up here</a> and create your own feed!</p><hr/>Want more on these topics?<br/>Browse the archive of posts filed under <a href="http://www.bestechvideos.com/category/conferences">Conferences</a>, <a href="http://www.bestechvideos.com/category/companies">Companies</a>, <a href="http://www.bestechvideos.com/category/broadcasting">Broadcasting</a>, <a href="http://www.bestechvideos.com/category/science">Science</a>, <a href="http://www.bestechvideos.com/category/conferences/techtalks">Techtalks</a>, <a href="http://www.bestechvideos.com/category/companies/google">Google</a>, <a href="http://www.bestechvideos.com/category/broadcasting/lectures">Lectures</a>, <a href="http://www.bestechvideos.com/category/science/computer-science">Computer Science</a> Thu, 06 Dec 2007 00:45:15 GMT http://www.bestechvideos.com/2007/12/01/symbolic-execution-and-model-checking-for-testing scoundrel http://www.bestechvideos.com/2007/11/11/the-evolution-of-expertise <p>Google Tech Talks<br /> November, 2 2007<br /> <br /> ABSTRACT<br /> <br /> Does Web 2.0 represent a triumph of the wisdom of crowds, or the tyranny of mediocrity? The truth--as truths often do--may fall somewhere in the middle. New tools have indeed allowed access to new ideas, voices, and expertise. But at the same time, it has become increasingly difficult to sort the wheat from the chaff. In education, the shift from &quot;the sage on the stage&quot; to the &quot;guide on the side&quot; has been underway for quite some time. The same shift is happening on the web. Experts aren't disappearing, but their roles are changing. How can tools and infrastructure best support this shift in the role of expertise and authority?<br /> <br /> Speaker: Elizabeth Lane Lawley<br /> Elizabeth Lane Lawley is the director of the Lab for Social Computing at the Rochester Institute of Technology, where she is also an associate professor of Information Technology. Her current teaching and research interests focus on social computing technologies such as weblogs, wikis, online games, lightweight online presence, and collaborative information retrieval. <br /> <br /> Before she became a technology professor, Liz was a librarian--with an MLS from the University of Michigan, and a PhD in Library and Information Science from the University of Alabama. She has worked for publishing companies, software companies, and even the Library of Congre...</p><p><a href="http://www.bestechvideos.com/2007/11/11/the-evolution-of-expertise">Read more about this video…</a></p><p><b>Want to control this feed contents?</b>&nbsp;<a href="http://www.bestechvideos.com/user/all/signup">Sign up here</a> and create your own feed!</p><hr/>Want more on these topics?<br/>Browse the archive of posts filed under <a href="http://www.bestechvideos.com/category/web-20">Web 2.0</a>, <a href="http://www.bestechvideos.com/category/conferences">Conferences</a>, <a href="http://www.bestechvideos.com/category/companies">Companies</a>, <a href="http://www.bestechvideos.com/category/broadcasting">Broadcasting</a>, <a href="http://www.bestechvideos.com/category/science">Science</a>, <a href="http://www.bestechvideos.com/category/conferences/techtalks">Techtalks</a>, <a href="http://www.bestechvideos.com/category/companies/google">Google</a>, <a href="http://www.bestechvideos.com/category/broadcasting/lectures">Lectures</a>, <a href="http://www.bestechvideos.com/category/science/computer-science">Computer Science</a> Wed, 05 Dec 2007 18:37:46 GMT http://www.bestechvideos.com/2007/11/11/the-evolution-of-expertise scoundrel http://www.bestechvideos.com/2007/11/17/polyworld-using-evolution-to-design-artificial-intelligence <p>Google Tech Talks<br /> November, 8 2007<br /> <br /> ABSTRACT<br /> <br /> This presentation is about a potential shortcut to artificial intelligence by trading mind-design for world-design using artificial evolution. Evolutionary algorithms are a pump for turning CPU cycles into brain designs. With exponentially increasing CPU cycles while our understanding of intelligence is almost a flat-line, the evolutionary route to AI is a centerpiece of most Kurzweilian singularity scenarios. This talk introduces the Polyworld artificial life simulator as well as results from our ongoing attempt to evolve artificial intelligence and further the Singularity.<br /> <br /> Polyworld is the brain child of Apple Computer Distinguished Scientist Larry Yaeger, who remains the primary developer of Polyworld:<br /> <br /> http://www.beanblossom.in.us/larryy/Polyworld.html<br /> <br /> Speaker: Virgil Griffith<br /> Virgil Griffith is a first year graduate student in Computation and Neural Systems at the California Institute of Technology. On weekdays he studies evolution, computational neuroscience, and artificial life. He did computer security work until his first year of university when his work got him sued for sedition and espionage. He then decided that security was probably not safest field to be in and he turned his life to science.</p><p><a href="http://www.bestechvideos.com/2007/11/17/polyworld-using-evolution-to-design-artificial-intelligence">Read more about this video…</a></p><p><b>Want to control this feed contents?</b>&nbsp;<a href="http://www.bestechvideos.com/user/all/signup">Sign up here</a> and create your own feed!</p><hr/>Want more on these topics?<br/>Browse the archive of posts filed under <a href="http://www.bestechvideos.com/category/conferences">Conferences</a>, <a href="http://www.bestechvideos.com/category/companies">Companies</a>, <a href="http://www.bestechvideos.com/category/broadcasting">Broadcasting</a>, <a href="http://www.bestechvideos.com/category/science">Science</a>, <a href="http://www.bestechvideos.com/category/conferences/techtalks">Techtalks</a>, <a href="http://www.bestechvideos.com/category/companies/google">Google</a>, <a href="http://www.bestechvideos.com/category/broadcasting/lectures">Lectures</a>, <a href="http://www.bestechvideos.com/category/science/computer-science">Computer Science</a> Wed, 05 Dec 2007 18:30:16 GMT http://www.bestechvideos.com/2007/11/17/polyworld-using-evolution-to-design-artificial-intelligence scoundrel http://www.bestechvideos.com/2007/12/01/theory-and-practice-of-cryptography <p>Google Tech Talks<br /> November, 28 2007<br /> <br /> Topics include: Introduction to Modern Cryptography, Using Cryptography in Practice and at Google, Proofs of Security and Security Definitions and A Special Topic in Cryptography <br /> <br /> This talk is one in a series hosted by Google University: Wednesdays, 11/28/07 - 12/19/07 from 1-2pm<br /> <br /> Speaker: Steve Weis<br /> Steve Weis received his PhD from the Cryptography and Information Security group at MIT, where he was advised by Ron Rivest. He is a member of Google's Applied Security (AppSec) team and is the technical lead for Google's internal cryptographic library, KeyMaster.</p><p><a href="http://www.bestechvideos.com/2007/12/01/theory-and-practice-of-cryptography">Read more about this video…</a></p><p><b>Want to control this feed contents?</b>&nbsp;<a href="http://www.bestechvideos.com/user/all/signup">Sign up here</a> and create your own feed!</p><hr/>Want more on these topics?<br/>Browse the archive of posts filed under <a href="http://www.bestechvideos.com/category/conferences">Conferences</a>, <a href="http://www.bestechvideos.com/category/companies">Companies</a>, <a href="http://www.bestechvideos.com/category/broadcasting">Broadcasting</a>, <a href="http://www.bestechvideos.com/category/science">Science</a>, <a href="http://www.bestechvideos.com/category/conferences/techtalks">Techtalks</a>, <a href="http://www.bestechvideos.com/category/companies/google">Google</a>, <a href="http://www.bestechvideos.com/category/broadcasting/lectures">Lectures</a>, <a href="http://www.bestechvideos.com/category/science/computer-science">Computer Science</a> Wed, 05 Dec 2007 18:29:30 GMT http://www.bestechvideos.com/2007/12/01/theory-and-practice-of-cryptography scoundrel http://www.bestechvideos.com/2007/12/01/tangible-functional-programming-2 <p>Google Tech Talks<br /> November, 7 2007<br /> <br /> ABSTRACT<br /> <br /> We present a user-friendly approach to unifying program creation and execution, based on a notion of &quot;tangible values&quot; (TVs), which are visual and interactive manifestations of pure values, including functions. Programming happens by gestural composition of TVs. Our goal is to give end-users the ability to create parameterized, composable content without imposing the usual abstract and linguistic working style of programmers. We hope that such a system will put the essence of programming into the hands of many more people, and in particular people with artistic/visual creative style.<br /> <br /> In realizing this vision, we develop algebras for visual presentation and for &quot;deep&quot; function application, where function and argument may both be nested within a structure of tuples, functions, etc. Composition gestures are translated into chains of combinators that act simultaneously on statically typed values and their visualizations.<br /> <br /> <br /> Speaker: Conal Elliott<br /> Most of my research is aimed at supporting the creation of interactive synthetic media content, including computer animation, human-computer interaction, images, 2D and 3D geometry, and programmable shaders. In all cases, I aim to preserve or improve on the flexibility and performance of mainstream programming approaches, while greatly simplifying the creation process.<br /> <br /> Synthetic media programs are almost always implemented in sequential, imperative (often object-oriented) languages. My research explores use of declarative languages, resulting in much simpler and more reusable and composable programs. These languages are also more amenable to execution on parallel architectures such as modern graphics processors, because declarative languages abstract away from order of execution, removing the accidental sequentiality found in imperative programs. Even on sequential machines, declarative formulations have much simpler mathematical semantics, which facilitates automatic optimization. They also tend to be spatially and temporally continuous (resolution-independent), allowing them to adapt naturally to machines with different speeds and display resolutions.<br /> <br /> After exploring explicit programming of synthetic media content for several years, I'm now also keenly interested in supporting artists. The goal of my new new research agenda is to give artists access to the expressive power of computers and programming languages, while retaining an artist's working style. I mean &quot;artist&quot; in a broad sense, in contrast to the verbal and sequential style of an engineer. (I don't mean to suggest that people fit neatly into these two categories.) My ideal audience includes graphic designers, musicians, and children -- really, the playful and curious in all of us.<br /> <br /> This abstract has 2796<br /> <br /> This abstract has 2820</p><p><a href="http://www.bestechvideos.com/2007/12/01/tangible-functional-programming-2">Read more about this video…</a></p><p><b>Want to control this feed contents?</b>&nbsp;<a href="http://www.bestechvideos.com/user/all/signup">Sign up here</a> and create your own feed!</p><hr/>Want more on these topics?<br/>Browse the archive of posts filed under <a href="http://www.bestechvideos.com/category/conferences">Conferences</a>, <a href="http://www.bestechvideos.com/category/companies">Companies</a>, <a href="http://www.bestechvideos.com/category/development">Development</a>, <a href="http://www.bestechvideos.com/category/broadcasting">Broadcasting</a>, <a href="http://www.bestechvideos.com/category/science">Science</a>, <a href="http://www.bestechvideos.com/category/conferences/techtalks">Techtalks</a>, <a href="http://www.bestechvideos.com/category/companies/google">Google</a>, <a href="http://www.bestechvideos.com/category/broadcasting/lectures">Lectures</a>, <a href="http://www.bestechvideos.com/category/science/computer-science">Computer Science</a> Sun, 02 Dec 2007 20:31:22 GMT http://www.bestechvideos.com/2007/12/01/tangible-functional-programming-2 scoundrel http://www.bestechvideos.com/2007/11/21/powerset-natural-language-and-the-semantic-web <p><span class="lecture_descr"><span id="lec_desc_edit">The Semantic Web promises to revolutionize access to information by adding machine-readable semantic information to content which is normally interpretable only by people. In addition, it will also revolutionize access to services by adding semantic information to create machine-readable service descriptions. This ambitious vision has been slow to take off because of a chickenand egg problem. Markup is required before people will build applications, applications are required before it is worth the hard work of doing markup. Natural language processing (NLP) has advanced to the point where it can break the impasse and open up the possibilities of the Semantic Web. First, NLP systems can now automatically create annotations from unstructured text. This provides the data that semantic web applications require. Second, NLP systems are themselves consumers of semantic web information and thus provide economic motivation for people to create and maintain such information. For example, a new generation of natural language search systems, as illustrated by Powerset, can take advantage of semantic web markup and ontologies to augment their interpretation of underlying textual content. Theycan also expose semantic web services directly in response to natural language queries.</span></span></p><p><a href="http://www.bestechvideos.com/2007/11/21/powerset-natural-language-and-the-semantic-web">Read more about this video…</a></p><p><b>Want to control this feed contents?</b>&nbsp;<a href="http://www.bestechvideos.com/user/all/signup">Sign up here</a> and create your own feed!</p><hr/>Want more on these topics?<br/>Browse the archive of posts filed under <a href="http://www.bestechvideos.com/category/web-20">Web 2.0</a>, <a href="http://www.bestechvideos.com/category/broadcasting/lectures">Lectures</a>, <a href="http://www.bestechvideos.com/category/science/computer-science">Computer Science</a> Mon, 26 Nov 2007 08:09:50 GMT http://www.bestechvideos.com/2007/11/21/powerset-natural-language-and-the-semantic-web sebastjan http://www.bestechvideos.com/2007/11/05/dryad-a-general-purpose-distributed-execution-platform <p>Google Tech Talks<br /> November, 1 2007<br /> <br /> ABSTRACT<br /> <br /> Web search has generated the need and economic support for a new class of data-intensive supercomputing applications. Several computing platforms have been created to support this need: the first described in the literature is Google's MapReduce. I will describe the architecture of the Dryad system developed at Microsoft Research, and explain some of our design choices. Dryad allows more general computations than MapReduce, and has consequently been used as a middleware abstraction on which higher-level programming models can be implemented. I will also briefly discuss some of these.<br /> <br /> Speaker: Michael Isard<br /> Michael Isard started out as a computer vision researcher, but has gradually been lured into systems research by his colleagues, first at DEC/Compaq SRC and now at Microsoft Research Silicon Valley. He was closely involved in the design and implementation of the first version of Microsoft's in-house search engine, and his systems research subsequently has concentrated on programming models for parallel and distributed computing.</p><p><a href="http://www.bestechvideos.com/2007/11/05/dryad-a-general-purpose-distributed-execution-platform">Read more about this video…</a></p><p><b>Want to control this feed contents?</b>&nbsp;<a href="http://www.bestechvideos.com/user/all/signup">Sign up here</a> and create your own feed!</p><hr/>Want more on these topics?<br/>Browse the archive of posts filed under <a href="http://www.bestechvideos.com/category/conferences">Conferences</a>, <a href="http://www.bestechvideos.com/category/companies">Companies</a>, <a href="http://www.bestechvideos.com/category/databases">Databases</a>, <a href="http://www.bestechvideos.com/category/development">Development</a>, <a href="http://www.bestechvideos.com/category/broadcasting">Broadcasting</a>, <a href="http://www.bestechvideos.com/category/science">Science</a>, <a href="http://www.bestechvideos.com/category/conferences/techtalks">Techtalks</a>, <a href="http://www.bestechvideos.com/category/companies/microsoft">Microsoft</a>, <a href="http://www.bestechvideos.com/category/companies/google">Google</a>, <a href="http://www.bestechvideos.com/category/broadcasting/lectures">Lectures</a>, <a href="http://www.bestechvideos.com/category/science/computer-science">Computer Science</a> Sun, 18 Nov 2007 03:30:30 GMT http://www.bestechvideos.com/2007/11/05/dryad-a-general-purpose-distributed-execution-platform scoundrel http://www.bestechvideos.com/2007/11/17/tangible-functional-programming <p>Google Tech Talks<br /> November, 7 2007<br /> <br /> ABSTRACT<br /> <br /> We present a user-friendly approach to unifying program creation and execution, based on a notion of &quot;tangible values&quot; (TVs), which are visual and interactive manifestations of pure values, including functions. Programming happens by gestural composition of TVs. Our goal is to give end-users the ability to create parameterized, composable content without imposing the usual abstract and linguistic working style of programmers. We hope that such a system will put the essence of programming into the hands of many more people, and in particular people with artistic/visual creative style.<br /> <br /> In realizing this vision, we develop algebras for visual presentation and for &quot;deep&quot; function application, where function and argument may both be nested within a structure of tuples, functions, etc. Composition gestures are translated into chains of combinators that act simultaneously on statically typed values and their visualizations.<br /> <br /> <br /> Speaker: Conal Elliott<br /> Most of my research is aimed at supporting the creation of interactive synthetic media content, including computer animation, human-computer interaction, images, 2D and 3D geometry, and programmable shaders. In all cases, I aim to preserve or improve on the flexibility and performance of mainstream programming approaches, while greatly simplifying the creation process.<br /> <br /> Synthetic media programs are almost always implemented in sequential, imperative (often object-oriented) languages. My research explores use of declarative languages, resulting in much simpler and more reusable and composable programs. These languages are also more amenable to execution on parallel architectures such as modern graphics processors, because declarative languages abstract away from order of execution, removing the accidental sequentiality found in imperative programs. Even on sequential machines, declarative formulations have much simpler mathematical semantics, which facilitates automatic optimization. They also tend to be spatially and temporally continuous (resolution-independent), allowing them to adapt naturally to machines with different speeds and display resolutions.<br /> <br /> After exploring explicit programming of synthetic media content for several years, I'm now also keenly interested in supporting artists. The goal of my new new research agenda is to give artists access to the expressive power of computers and programming languages, while retaining an artist's working style. I mean &quot;artist&quot; in a broad sense, in contrast to the verbal and sequential style of an engineer. (I don't mean to suggest that people fit neatly into these two categories.) My ideal audience includes graphic designers, musicians, and children -- really, the playful and curious in all of us.</p><p><a href="http://www.bestechvideos.com/2007/11/17/tangible-functional-programming">Read more about this video…</a></p><p><b>Want to control this feed contents?</b>&nbsp;<a href="http://www.bestechvideos.com/user/all/signup">Sign up here</a> and create your own feed!</p><hr/>Want more on these topics?<br/>Browse the archive of posts filed under <a href="http://www.bestechvideos.com/category/conferences">Conferences</a>, <a href="http://www.bestechvideos.com/category/companies">Companies</a>, <a href="http://www.bestechvideos.com/category/development">Development</a>, <a href="http://www.bestechvideos.com/category/broadcasting">Broadcasting</a>, <a href="http://www.bestechvideos.com/category/practices">Practices</a>, <a href="http://www.bestechvideos.com/category/science">Science</a>, <a href="http://www.bestechvideos.com/category/conferences/techtalks">Techtalks</a>, <a href="http://www.bestechvideos.com/category/companies/google">Google</a>, <a href="http://www.bestechvideos.com/category/broadcasting/lectures">Lectures</a>, <a href="http://www.bestechvideos.com/category/science/computer-science">Computer Science</a> Sat, 17 Nov 2007 08:13:50 GMT http://www.bestechvideos.com/2007/11/17/tangible-functional-programming scoundrel http://www.bestechvideos.com/2007/11/05/similarity-search-a-web-perspective <p>Google Tech Talks<br /> October, 18 2007<br /> <br /> ABSTRACT<br /> <br /> Similarity search is the problem of preprocessing a database of N objects in such a way that given a query object, one can effectively determine its nearest neighbors in database. &quot;Geometric near-neighbor access tree&quot; data structure, an early work (1995) by Sergey Brin, is one of the most known solutions to this problem.<br /> <br /> Similarity search is closely connected to many algorithmic problems in the web. Similarity search is an abstraction of many algorithmic problems we face in data management. In this talk we will focus on:<br /> <br /> - Personalized news aggregation: Searching for news articles that are most similar to the user's profile of interests<br /> <br /> - Behavioral targeting: Searching for the most relevant advertisement for displaying to a given user.<br /> <br /> - Social network analysis: Suggesting new friends.<br /> <br /> - Computing co-occurrence similarities.<br /> <br /> - &quot;Best match search&quot;: Searching resumes, jobs, BF/GF, cars, apartments.<br /> <br /> We describe features that make web applications somewhat different from previously studied models. Thus we re-examine the formalization and the classical algorithms for similarity search. This leads us to new algorithms (we present two of them) and numerous open problems in the field.<br /> <br /> Speaker: Yury Lifshits<br /> Yury Lifshits obtained his PhD degree from Steklov Institute of Mathematics at S...</p><p><a href="http://www.bestechvideos.com/2007/11/05/similarity-search-a-web-perspective">Read more about this video…</a></p><p><b>Want to control this feed contents?</b>&nbsp;<a href="http://www.bestechvideos.com/user/all/signup">Sign up here</a> and create your own feed!</p><hr/>Want more on these topics?<br/>Browse the archive of posts filed under <a href="http://www.bestechvideos.com/category/conferences">Conferences</a>, <a href="http://www.bestechvideos.com/category/web-tech">Technologies</a>, <a href="http://www.bestechvideos.com/category/companies">Companies</a>, <a href="http://www.bestechvideos.com/category/broadcasting">Broadcasting</a>, <a href="http://www.bestechvideos.com/category/science">Science</a>, <a href="http://www.bestechvideos.com/category/conferences/techtalks">Techtalks</a>, <a href="http://www.bestechvideos.com/category/companies/google">Google</a>, <a href="http://www.bestechvideos.com/category/broadcasting/lectures">Lectures</a>, <a href="http://www.bestechvideos.com/category/science/computer-science">Computer Science</a> Sun, 11 Nov 2007 17:31:04 GMT http://www.bestechvideos.com/2007/11/05/similarity-search-a-web-perspective scoundrel http://www.bestechvideos.com/2007/11/05/unleashing-video-search <p>Google Tech Talks<br /> October, 25 2007<br /> <br /> ABSTRACT<br /> <br /> Video is rapidly becoming a regular part of our digital lives. However, its tremendous growth is increasing expectations that video will be as easy to search as text. Unfortunately, it is still difficult to find relevant video content. And today's solutions are not keeping pace on problems ranging from video search to content classification to automatic filtering. In this talk we describe recent techniques that leverage the computer's ability to effectively analyze visual features of video and apply statistical machine learning techniques to classify video scenes automatically. We examine related efforts on the modeling of large video semantic spaces and review public evaluations such as TRECVID, which are greatly facilitating research and development on video retrieval. Finally, we discuss the role of MPEG-7 as a way to store metadata generated for video in a fully standards-based searchable representation. Overall, we show how these approaches together go a long way to truly unleash video search.<br /> <br /> <br /> Speaker: John R Smith, IBM Research</p><p><a href="http://www.bestechvideos.com/2007/11/05/unleashing-video-search">Read more about this video…</a></p><p><b>Want to control this feed contents?</b>&nbsp;<a href="http://www.bestechvideos.com/user/all/signup">Sign up here</a> and create your own feed!</p><hr/>Want more on these topics?<br/>Browse the archive of posts filed under <a href="http://www.bestechvideos.com/category/conferences">Conferences</a>, <a href="http://www.bestechvideos.com/category/web-tech">Technologies</a>, <a href="http://www.bestechvideos.com/category/companies">Companies</a>, <a href="http://www.bestechvideos.com/category/broadcasting">Broadcasting</a>, <a href="http://www.bestechvideos.com/category/science">Science</a>, <a href="http://www.bestechvideos.com/category/conferences/techtalks">Techtalks</a>, <a href="http://www.bestechvideos.com/category/companies/google">Google</a>, <a href="http://www.bestechvideos.com/category/broadcasting/lectures">Lectures</a>, <a href="http://www.bestechvideos.com/category/science/computer-science">Computer Science</a> Sat, 10 Nov 2007 21:05:30 GMT http://www.bestechvideos.com/2007/11/05/unleashing-video-search scoundrel http://www.bestechvideos.com/2007/11/09/eclipse-and-java-using-the-debugger <p><font face="Arial">This&nbsp; free video tutorial will teach you how to use the Eclipse Java Debugger. It is based on <a target="_blank" href="http://www.eclipse.org/downloads">Eclipse version 3.3</a>. This is for programmers who have completed the &quot;Total Beginners&quot; tutorial or have some familiarity with Eclipse and Java. <strong>No prior experience with the Eclipse Debugger is needed. </strong></font></p> <p><font face="Arial">The 7 lessons are each about 15 minutes long and total about 1 3/4 hours. The lessons guide you through a step-by-step process of running debug sessions, setting breakpoints, stepping through a running program, and examining variables and expressions. Then we use this knowledge to fix some bugs in our code. </font></p> <p><font face="Arial">We use the &quot;personal lending library&quot; application developed in the <a href="file:///C:/Documents%20and%20Settings/Mark/My%20Documents/SourceForge/HTML_20071107/totalbeginner.html">&quot;Total Beginners&quot;</a> tutorial. Each lesson is fully narrated. Along the way, we learn some very cool Eclipse functionality. See the&nbsp; <a target="_blank" href="file:///C:/Documents%20and%20Settings/Mark/My%20Documents/SourceForge/HTML_20071107/Debugger-Tutorial-Companion-Document.pdf">Tutorial Companion Guide</a> for more information about the tutorial, or look at the <a href="file:///C:/Documents%20and%20Settings/Mark/My%20Documents/SourceForge/HTML_20071107/debuggerlessons.html">Lessons </a>link to see the lesson outlines.</font></p> <p><font face="Arial">We learn how to debug programs written using <a target="_blank" href="http://en.wikipedia.org/wiki/Test-driven_development">test-driven development</a>, running debug sessions using the JUnit testing facility in Eclipse. We also learn to debug standard Java programs. The lessons are designed for you to work side-by-side, pausing and rewinding the video as needed.</font></p> <p><font face="Arial"><a target="_blank" href="file:///C:/Documents%20and%20Settings/Mark/My%20Documents/SourceForge/HTML_20071107/debugger01/lesson01.html">Click here</a> to view Lesson 1. <a href="http://sourceforge.net/project/showfiles.php?group_id=200662&amp;package_id=251688">Click here to download any of the lessons</a>. Be sure to download the <a target="_blank" href="file:///C:/Documents%20and%20Settings/Mark/My%20Documents/SourceForge/HTML_20071107/Debugger-Tutorial-Companion-Document.pdf">Tutorial Companion Guide </a>(PDF format). </font></p> <p><font face="Arial">The tutorials use <a target="_blank" href="http://www.eclipse.org/downloads">Eclipse version 3.3 (Europa)</a>, released June 2007.</font></p><p><a href="http://www.bestechvideos.com/2007/11/09/eclipse-and-java-using-the-debugger">Read more about this video…</a></p><p><b>Want to control this feed contents?</b>&nbsp;<a href="http://www.bestechvideos.com/user/all/signup">Sign up here</a> and create your own feed!</p><hr/>Want more on these topics?<br/>Browse the archive of posts filed under <a href="http://www.bestechvideos.com/category/os">OS</a>, <a href="http://www.bestechvideos.com/category/development">Development</a>, <a href="http://www.bestechvideos.com/category/broadcasting">Broadcasting</a>, <a href="http://www.bestechvideos.com/category/science">Science</a>, <a href="http://www.bestechvideos.com/category/os/windows">Windows</a>, <a href="http://www.bestechvideos.com/category/os/macos">MacOS</a>, <a href="http://www.bestechvideos.com/category/os/linux">Linux</a>, <a href="http://www.bestechvideos.com/category/development/java">Java</a>, <a href="http://www.bestechvideos.com/category/broadcasting/screencasts">Screencasts</a>, <a href="http://www.bestechvideos.com/category/science/computer-science">Computer Science</a> Fri, 09 Nov 2007 08:51:03 GMT http://www.bestechvideos.com/2007/11/09/eclipse-and-java-using-the-debugger dextercowley http://www.bestechvideos.com/2007/11/05/new-generation-of-math-software-from-maplesoft-2 <p>Google Tech Talks<br /> September, 11 2007<br /> <br /> ABSTRACT<br /> <br /> The name Maple is synonymous with doing complex math on computers. Best known for its symbolic or algebraic computation abilities, Maple is one of the most important tools for the modern applied mathematician and scientist. Many of you are likely familiar with Maple from college but you've probably not kept up to date with latest developments. This presentation will present some of the latest product developments from Maplesoft. Topics include<br /> <br /> - developments in high performance numerical computation<br /> - recent advances in symbolic computing<br /> - new Maple libraries including graph theory, statistics, optimization, polynomial operations, and more<br /> - parallel and grid computing<br /> - knowledge capture for mathematical documents<br /> - the Maple programming language and application development<br /> - overview of new add-on products including global optimization, and modeling and simulation<br /> <br /> The presenter will be Mohamed Bendame, a senior engineer from Maplesoft. The presentations will include an open Q session.<br /> <br /> This talk will be taped by the engEDU Tech Talks Team. <br /> <br /> Speaker: Mohamed Bendame</p><p><a href="http://www.bestechvideos.com/2007/11/05/new-generation-of-math-software-from-maplesoft-2">Read more about this video…</a></p><p><b>Want to control this feed contents?</b>&nbsp;<a href="http://www.bestechvideos.com/user/all/signup">Sign up here</a> and create your own feed!</p><hr/>Want more on these topics?<br/>Browse the archive of posts filed under <a href="http://www.bestechvideos.com/category/conferences">Conferences</a>, <a href="http://www.bestechvideos.com/category/companies">Companies</a>, <a href="http://www.bestechvideos.com/category/science">Science</a>, <a href="http://www.bestechvideos.com/category/conferences/techtalks">Techtalks</a>, <a href="http://www.bestechvideos.com/category/companies/google">Google</a>, <a href="http://www.bestechvideos.com/category/broadcasting/screencasts">Screencasts</a>, <a href="http://www.bestechvideos.com/category/broadcasting/lectures">Lectures</a>, <a href="http://www.bestechvideos.com/category/science/computer-science">Computer Science</a> Tue, 06 Nov 2007 03:11:18 GMT http://www.bestechvideos.com/2007/11/05/new-generation-of-math-software-from-maplesoft-2 scound