VisIt is an open-source interactive parallel visualization and graphical analysis tool for viewing scientific data. It can be used to visualize scalar and vector fields defined on 2D and 3D structured and unstructured meshes. VisIt was designed to handle very large data set sizes in the terascale range and yet can also handle small data sets in the kilobyte range. (Wikipedia).
Quelques images de la visite de l'exposition lors de l'inauguration du 21 novembre 2018.
From playlist 250 ans Joseph Fourier
From playlist Fall Preview
take a peak at exploratorium exhibits!
Check out cool on-line exhibits at http://www.exploratorium.edu/explore
From playlist Hands-on Exploratorium
Visiting Exploratorium in San Francisco. - Hand and eye co-ordination. You are supposed to look into mirror and follow the path with pen
From playlist Exploratorium through your eyes
Open educational video for the day and a trip to get a UK visitor visa
Today's video is on the kernel of a group homomorphism https://www.youtube.com/watch?v=YViYmLyWW-Y I also visited the local cape Town office of TLScontact to apply for a UK visitor's visa. I paid a bit extra for the Premium Lounge. It was probably the best visa application experience I
From playlist Fun!!!
Some tourist destinations around Taipei, Taiwan
A summary of my trip 2014-12-18 ~ 2015-01-16. All locations labelled with English name so you can find it yourself if you go there!
From playlist Interesting videos
From playlist Exploratorium through your eyes
a visit to the san francisco exploratorium
From playlist Exploratorium through your eyes
Yale University Conference on Japanese Soft Power in East Asia, Session 2
What are the effects and limits of soft power in the modern era? The Yale University Conference on Japanese Soft Power in East Asia showcases new research considering these questions, with contributions from leading scholars in soft power, international relations, and East Asian politics.
From playlist Council on East Asian Studies (CEAS)
Lecture 14: Depth-First Search (DFS), Topological Sort
MIT 6.006 Introduction to Algorithms, Fall 2011 View the complete course: http://ocw.mit.edu/6-006F11 Instructor: Erik Demaine License: Creative Commons BY-NC-SA More information at http://ocw.mit.edu/terms More courses at http://ocw.mit.edu
From playlist MIT 6.006 Introduction to Algorithms, Fall 2011
Advent Of Code 2021 [Rust Language] - Day 12
Programming Puzzle Website for #AdventOfCode : https://adventofcode.com/2021 I will stream as many of these as I can on https://www.twitch.tv/unclescientist Meanwhile here is my solution for Day 12 of Advent of Code. Many thanks to Eric Wastl and his helpers for creating this annual trad
From playlist Advent of Code
Binary tree traversal - breadth-first and depth-first strategies
See complete series on data structures here: http://www.youtube.com/playlist?list=PL2_aWCzGMAwI3W_JlcBbtYTwiQSsOTa6P In this lesson, we have discussed algorithms for binary tree traversal. We have talked about breadth-first and depth-first strategies for tree traversal like level-order, p
From playlist Data structures
Thompson Sampling : Data Science Concepts
The coolest Multi-Armed Bandit solution! Multi-Armed Bandit Intro : https://www.youtube.com/watch?v=e3L4VocZnnQ Table of Conjugate Priors: https://en.m.wikipedia.org/wiki/Conjugate_prior My Patreon : https://www.patreon.com/user?u=49277905
From playlist Bayesian Statistics
CS105: Introduction to Computers | 2021 | Lecture 8.3 Linking Webpages: Formatting Links
Patrick Young Computer Science, PhD This course is a survey of Internet technology and the basics of computer hardware. You will learn what computers are and how they work and gain practical experience in the development of websites and an introduction to programming. To follow along wi
From playlist Stanford CS105 - Introduction to Computers Full Course
Inorder Successor in a binary search tree
See complete series on data structures here: http://www.youtube.com/playlist?list=PL2_aWCzGMAwI3W_JlcBbtYTwiQSsOTa6P In this lesson, we have discussed efficient algorithm to find Inorder successor of a Node in binary search tree. See source code here: https://gist.github.com/mycodeschoo
From playlist Data structures
Depth First Search (DFS) Explained: Algorithm, Examples, and Code
In this video, I explain the fundamental ideas behind the Depth First Search (DFS) graph algorithm. We first introduce the concept of a graph traversal. We then go through several examples of DFS to provide intuition. Afterwards, we then go through both a recursive and iterative implementa
From playlist Graph Theory
Breadth First Search (BFS): Visualized and Explained
In this video we break down the BFS algorithm in a visual manner with examples and key intuition. We then show the implementation of the algorithm with code and then finish off the video by demonstrating how you can use the BFS algorithm to solve the Flood Fill problem. 0:00 Introduction
From playlist Graph Theory
Can You Believe It? #5 Have We Been Visited by Aliens?
Visit http://ilectureonline.com for more math and science lectures! To donate: http://www.ilectureonline.com/donate https://www.patreon.com/user?u=3236071 We will mathematically calculate if we could have been visited by aliens. Previous video in this series can be seen at: https://yout
From playlist CAN YOU BELIEVE IT?
I'm tired, hot and sun-burnt, holidays are never that relaxing. Anyway, here I introduce one of my favorite algorithms - the Recursive Back-tracker, to generate a maze. I love how perfectly complete this algorithm is, it can be used in all situations where you need to guarantee your networ
From playlist Interesting Programming