The Mind Grid
The Mind Grid
  • 97
  • 124 120
Star Trek Time Travel Paradoxes - The Guardian of Forever
In this episode we review the City on Edge of Forever, Yesteryear, and Terra Firma and walk through the role the Guardian of Forever has played in time travel across Star Trek Franchise. We will also show time travel is shrouded in paradoxes that can lead to solutions as well as deadly consequences. Now sit back and watch the episode...
มุมมอง: 128

วีดีโอ

Star Trek Subspace Communication
มุมมอง 65221 ชั่วโมงที่ผ่านมา
This episode dwells on subspace and its use in communications by Star Trek . The subspace is a complex concept requiring feasibility of higher dimensional concepts besides 4 dimensional space time. We highlight various ideas available in contemporary sci-fi and physics and stitch them into this presentation. Enjoy...
Star Trek Transporter - In One Minute
มุมมอง 4814 วันที่ผ่านมา
This quick video will breeze through a transporter cycle showing you full action of the process from its primary coils, to molecular scanners, to the legendary tokamak pattern buffer, and finally the emitter array. Enjoy...
Space Race - Part II (Return of NASA)
มุมมอง 15114 วันที่ผ่านมา
A program that stretches over 10 years to establish a base on moon, and prepare astronauts for mars. This is a look at the main components of this ambitious program that brings us closer to a goal of being a multi planetary species. Join me in this journey.
Star Trek Technology - Drives and Torpedoes
มุมมอง 2.2K21 วันที่ผ่านมา
In this sci-fi episode, we review star trek technology - its engines and photon torpedoes. A space faring human race in future has discovered how to manipulate space time using these plasma-based systems that can harness the very fabric of space to travel fast. This mind-bending technology is the root of all of the adventures of star trek. Now let's go 0.25 Impulse power aboard NCC1701.
Sci Fi and Dystopian AI
มุมมอง 27321 วันที่ผ่านมา
This series explores the AI and its characteristics as seen through eyes of Sci Fi writers and how these projections appear in our world today. are these looking realistic possibility or improbable. Regardless, watch this thought-provoking return to 1967 and relive the world of Beta III with Kirk, Spock and the crew of enterprise.
How to Design DRAM Controller
มุมมอง 14621 วันที่ผ่านมา
This video is close up view to design the DRAM Controller and deal with timing parameters inside each bank. It highlights the complexity of managing the timing models and state machines that are run serially on each bank and yet achieve parallelism by means of this controller and memory.
DPDK - Simple forwarding app
มุมมอง 99หลายเดือนก่อน
A very simple application development in DPDK and using it to test dataflow across your system. This barebones app can be used to understand a very simple system and then build your own advanced applications. It is meant to kick start your adventured into this DPDK world.
Buildroot - QEMU-x86-64 tinkering with packages
มุมมอง 68หลายเดือนก่อน
We tinker with various packages and linux kernel and try it out in our sandbox easily and build our custom linux quickly. Buildroot compiler makes this fun and easy.
CRC Parallel Computation, High Speed CRC
มุมมอง 69หลายเดือนก่อน
This method can run CRC in parallel and improve computation of CRC over larger chunks say 32 bytes where tables for lookup are only for 8 bits etc. This shows how 8 bit tables can be built in parallel form the main CRC computation. If message can be handled in parallel, then each byte of message can be processed in parallel and thus improve and optimize the overall algorithm and speed. This may...
RESET Design in Digital Systems
มุมมอง 253 หลายเดือนก่อน
This video discusses the problems with RESETs in systems. It shows problems in TIMED and UNTIMED resets and approach to solve these problems.
PTP Accuracy - Asymmetry in Networks
มุมมอง 353 หลายเดือนก่อน
This video covers how asymmetric delays in network cause PTP target devices to be inaccurate by several micro seconds. This can be better understood by measurements and awareness of topology.
AI/ML Emerging FP8 specification and Chips
มุมมอง 1228 หลายเดือนก่อน
A new standard is taking hold of ML industry and is carving its name in the industry. Its the Floating Point 8 format that is making chips in ML more efficient at various tasks. This video takes a wide angle view of this FP8 standard to get you thinking. Errata - IEEE 754 Exponent is power of 2 not 10.
Lockless Queues
มุมมอง 398ปีที่แล้ว
This episode shows how lockless queues work internally. What atomic operations and data structures like HEAD/TAIL pointers come into play for this elegant construct. References doc.dpdk.org/guides/prog_guide/ring_lib.html
HBM Memory Advances
มุมมอง 500ปีที่แล้ว
A comparative study of how HBM technology is outperforming other memory technologies. References www.utmel.com/blog/categories/memory chip/will-hbm-replace-ddr-and-become-computer-memory www.techdesignforums.com/practice/technique/choosing-between-ddr4-and-hbm-in-memory-intensive-applications/ ADVIL 55mm reference - developer.download.nvidia.com/video/gputechconf/gtc/2019/presentation/s9978-an-...
Python2 to Python3 String Incompatibility Guide, ASCII to UNICODE
มุมมอง 135ปีที่แล้ว
Python2 to Python3 String Incompatibility Guide, ASCII to UNICODE
Fixed Point Math - Part 3
มุมมอง 60ปีที่แล้ว
Fixed Point Math - Part 3
Fixed Point Math - Part 2
มุมมอง 31ปีที่แล้ว
Fixed Point Math - Part 2
Fixed Point Math - Part 1
มุมมอง 83ปีที่แล้ว
Fixed Point Math - Part 1
Relevance of FPGA in Machine Learning
มุมมอง 273ปีที่แล้ว
Relevance of FPGA in Machine Learning
Meson - introduction and Tutorial
มุมมอง 2.2Kปีที่แล้ว
Meson - introduction and Tutorial
Create Diagram tool in KONVA with Flask
มุมมอง 5402 ปีที่แล้ว
Create Diagram tool in KONVA with Flask
Dynamic Programming Solutions DPV 6.4 Corrupted Doument - (Edited)
มุมมอง 1.8K2 ปีที่แล้ว
Dynamic Programming Solutions DPV 6.4 Corrupted Doument - (Edited)
Build Complete Linux from Docker container
มุมมอง 1.1K2 ปีที่แล้ว
Build Complete Linux from Docker container
Intro to Hyperscan.io - how to get started with regex matching
มุมมอง 1.1K2 ปีที่แล้ว
Intro to Hyperscan.io - how to get started with regex matching
Quick Introduction to "The Mind Grid"
มุมมอง 9812 ปีที่แล้ว
Quick Introduction to "The Mind Grid"
Linux - Build a embedded linux using buildroot
มุมมอง 16K2 ปีที่แล้ว
Linux - Build a embedded linux using buildroot
Neural Net - Deriving Back Propagation in python and creating our library
มุมมอง 1782 ปีที่แล้ว
Neural Net - Deriving Back Propagation in python and creating our library
Learn Verilog By examples - struct
มุมมอง 1892 ปีที่แล้ว
Learn Verilog By examples - struct
Training Worlds simplest neural Net - Back tracking through python
มุมมอง 722 ปีที่แล้ว
Training Worlds simplest neural Net - Back tracking through python

ความคิดเห็น

  • @eprohoda
    @eprohoda 5 วันที่ผ่านมา

    excellent travel-;)

  • @jaketheripper7385
    @jaketheripper7385 6 วันที่ผ่านมา

    I always interpreted impulse engines to be more along the lines of an advanced ion drive, but plasma fusion thrusters make a bit more sense honestly (from both in-universe and "real world" perspectives). Interesting that you chose to discuss impulse drive and photon torpedoes of all things in the same video lol. Cool video though and very informative 👌 👍. Alao one little bit of info I'd like to add to help offer some more context is that phasers are more intended for executing precision strikes on enemy vessels in order to disable specific systems such as damaging/destroying communications arrays or taking out one or more individual weapons banks. Phaser power output can also be attenuated to reduce collateral damage as well as heavily tuned/modified to serve a variety of functions beyond that of just being a weapon. Phasers just seem very "Starfleet" by nature in the sense that the technology is so versatile and seemingly often used as a "tool" just as much as it is a weapon. Ship based phaser platforms can even be tuned to a "stun" setting much like Type I, II, and III handheld phasers which can then be used to deliver a non-lethal discharge to a planetary surface. The beam can then be adjusted to encompass a varying dispersal range depending on the size of the targeted area of effect. This tactic can be very effective in urban pacification scenarios such as when a large group of aggressors needs to be harmlessly disabled or a certain area affected all at once. Photon torpedoes on the other hand are somewhat more of a blunt instrument designed for one thing: blowing sh*t up lol. While a Starfleet torpedo does possess an adjustable detonation yield, they are rather exclusively intended for destruction. The only question really is how large the resulting "boom" needs to be... Essentially phasers will be used to hammer through enemy shields, while photon torpedoes are then used to destroy or disable the vessel itself once defenses are bypassed. Interestingly photon torpedoes do have their own shielding systems which can be remodulated to pass right through an enemy ship's shields. However this isn't usually possible because I believe this would require knowing or otherwise determining an enemy's shield frequencies/harmonics and programming the torpedoes to generate the appropriate countermeasures.

    • @TheMindGrid
      @TheMindGrid 6 วันที่ผ่านมา

      @jaketheripper7385 - Thanks you for your support and tactical brief on weapons. I agree, I should have steered clear of weapons and just stuck with the drives. The weapons easily belong in a episode on their own. I assure you my skills in video making will eventually catch up with my passion for sci-fi. Love your comments and will hopefully get to use them another day. Cheers.

  • @brookestephen
    @brookestephen 7 วันที่ผ่านมา

    the idea is called "ansible" which allows 2-way real time communication at any distance. It is a sci-fi writer's crutch, coined by Ursula Le Guin. Otherwise, there is no communication with starfleet command. en.wikipedia.org/wiki/Ansible

    • @TheMindGrid
      @TheMindGrid 7 วันที่ผ่านมา

      This is a concept that likely predates trek subspace communication, and seems like was borrowed by Orson Scott Card in Enders Game - The Philotic Parallax Instantaneous Communicator or ansible. Thank you for the reference.

    • @brookestephen
      @brookestephen 7 วันที่ผ่านมา

      @@TheMindGrid yup Card did use it! It has been the dream of physicists since they discovered entanglement. Unfortunately, entanglement doesn't allow information to be passed.

  • @protonspeed
    @protonspeed 12 วันที่ผ่านมา

    Hey, hope you are doing well. I was trying to build a buildroot to simply stream a USB camera on HDMI. I have one error that I'm stuck to. /dev/video0 no such file or directory. Either I use vlc to capture, gstreamer , ffmpeg everywhere. I'm making this on my windows using wsl. Can you help me with this? Please

  • @kahlrhoam6769
    @kahlrhoam6769 16 วันที่ผ่านมา

    New Sub because of this video. Opinion; that’s how UFOs are ‘propelled’. The CIA’s hoarding UFO technology, so we already have it. A necessary State Secret? Well, nobody should want my neighbors here spreading across the Galaxy, what a recipe for disaster. 🛸👏

  • @williammay5300
    @williammay5300 18 วันที่ผ่านมา

    The USS ENTERPRISE NCC 1701 could separate before and after refit.... They needed a space dock to help them reconnect, unlike the USS ENTERPRISE NCC 1701-D......

    • @TheMindGrid
      @TheMindGrid 18 วันที่ผ่านมา

      Interesting - could you provide some canon references, to prove this claim.

    • @TheMindGrid
      @TheMindGrid 18 วันที่ผ่านมา

      memory-alpha.fandom.com/wiki/Saucer_separation On the Galaxy-class, saucer separation was primarily designed as a way for the civilian and nonessential crew complement to escape in the saucer section, while the senior staff and essential personnel engaged a threat or entered a potentially dangerous situation in the stardrive section Mentions this - During the 23rd century, hull segment separations were dangerous, last-resort maneuvers, used in the event of a catastrophic emergency. (TOS: "The Apple"). This episode's original script called for an emergency saucer separation. However, due to budgeting, the effect was only mentioned but not seen. It was seen for the first time in TNG's pilot episode, "Encounter at Farpoint".

  • @Allosaurus87
    @Allosaurus87 20 วันที่ผ่านมา

    impulse engine cames in 22nd century so after warp reactors, before human starships uses rocket then normal nuclear/fusion rockets

  • @DeadHeadAnimation
    @DeadHeadAnimation 21 วันที่ผ่านมา

    Awesome video!

  • @davedsilva
    @davedsilva 22 วันที่ผ่านมา

    Great topic! But disappointing opening shot with the USS Cry Baby powered STD ship scene. They cry a lot and that's how the series is powered.

    • @TheMindGrid
      @TheMindGrid 22 วันที่ผ่านมา

      Indeed. Discovery does use the strange Spore Drive, but it still has the traditional drives M/AM powered and impulse powered. It is loved and hated all for various reasons by sci fi fans.

  • @linz8291
    @linz8291 22 วันที่ผ่านมา

    If we assume rocket and saucer type starship are two main systems has developed since last century, then impulse engine and photonic quasi-crystalized torpedo can both applied for starship as propulsion advancement, however, should be carefully chosen to different series by ship classification. Battleship is suggested to improve warp speed above 9.9, like some warp speed ships comparison. Usually, photonic quasi-crystalized torpedo and fusion plasma torpedo can reaching high standard FTL space travel, and gravitonic impulse engine is more efficient than previous types. By speedy space projects has launched, you'll get sliptime control system beside the traditional gravitonic impulse engine as next generation ship series. Thank you, looking forward to more amazing starship technology discussion.

  • @tomusmc1993
    @tomusmc1993 24 วันที่ผ่านมา

    The basic question is tyranny versus freedom. Is "comfort" acceptable if you abdicate total control, or is suffering but free to develop as you choose, even if that means living less comfortably? What the masses will choose has been clear over human history. There is no reason to think human psychology has changed.

    • @TheMindGrid
      @TheMindGrid 24 วันที่ผ่านมา

      Yes, a parallel is cypher in the matrix. He decides to go back and enjoy his life in matrix even though he knows its not real. Its comfort and he goes with that, at the cost of struggling for human race.

    • @tomusmc1993
      @tomusmc1993 24 วันที่ผ่านมา

      @@TheMindGrid Truth.

  • @SingularityZ3ro1
    @SingularityZ3ro1 25 วันที่ผ่านมา

    Somehow, I have assumed the modern reinterpretation of Battlestar Galactica would be first. "All has happened before and will happen again :-D " (The final scene perfectly aligns which the current leap of development in my view). Matrix is next, when it comes to 2030 I think regarding a very deep integration of spatial computing, or VR, once games start to utilize NVIDIAs training simulations. ;-)

  • @kartike61
    @kartike61 หลายเดือนก่อน

    Hi, have you ever tried pcapscan example?

  • @amritaghiloria306
    @amritaghiloria306 หลายเดือนก่อน

    If you want to cut a 20-character string at positions 3 then making the first cut at position 3 incurs a total cost of 20 + 17 = 37 Shouldn't it be treated like L(0,3)+ L (3,20) = 3+17?

    • @TheMindGrid
      @TheMindGrid หลายเดือนก่อน

      This is the problem statement itself - and is because you have to copy the original sentence. Suppose, now, that you want to break a string into many pieces. The order in which the breaks are made can affect the total running time. For example, if you want to cut a 20-character string at positions 3 and 10, then making the first cut at position 3 incurs a total cost of 20 + 17 = 37, while doing position 10 first has a better cost of 20 + 10 = 30

    • @amritaghiloria306
      @amritaghiloria306 หลายเดือนก่อน

      @@TheMindGrid Thanks , I rereading the problem helped.

  • @deepapatteri3883
    @deepapatteri3883 2 หลายเดือนก่อน

    Thank you, it was very informative

  • @cheahanqi964
    @cheahanqi964 2 หลายเดือนก่อน

    Awesome expl😢

  • @mfernandez1191
    @mfernandez1191 2 หลายเดือนก่อน

    How do you know when you need to start implementing this with your resets? Is there a certain level of fan out that starts becoming unacceptable? Is it part dependent? I've been going through all your videos. Thank you for all this great information. Your videos are always clear and to the point!

    • @TheMindGrid
      @TheMindGrid 2 หลายเดือนก่อน

      Its a difficult question. It can vary from chip to chip and even design to design. However, in general people tend to defer the reset tree design to last moment and it becomes daunting if the tool stops helping you when you have a multi million gate FPGA that has 80% fill level and does not meet timing on resets. One philosophy i see used as a rule of thumb from start is to have each block sync its reset using the mechanism. That helps placer as well as each block is not getting pulled towards other blocks to meet reset timing. This is a great help in design from the start. This is what i recommend.

  • @dominiorrr6510
    @dominiorrr6510 3 หลายเดือนก่อน

    How do we know that if when there's True under the result index, then the sets are indeed disjoint? To me it looks like the algorithm would return True even if there was no solution, but just one set of total sum N//3.

    • @TheMindGrid
      @TheMindGrid 3 หลายเดือนก่อน

      Try to build the second row. You will see that any co-ordinate P(x,y,i) satisfies both backpacks of size x and y simultaneously. So to get a TRUE, you must be able to fill the backpacks to the required level using the previous level. When you write a TRUE in a box, you are guaranteeing that the added number ai is only used up in one of the backpacks but not both. As long as any of the 3 terms is satified, there is atleast one way to fill backpacks.

    • @dominiorrr6510
      @dominiorrr6510 3 หลายเดือนก่อน

      @@TheMindGrid Ok I see it now, thanks.

  • @gileneusz
    @gileneusz 5 หลายเดือนก่อน

    great explanatory video!

  • @user-md3gf3nx4h
    @user-md3gf3nx4h 6 หลายเดือนก่อน

    Awesome explanation. Thank you!

  • @user-md3gf3nx4h
    @user-md3gf3nx4h 6 หลายเดือนก่อน

    Thank you for this video! Helped me understand this for my algorithms class.

  • @drfreak01
    @drfreak01 6 หลายเดือนก่อน

    Clock synchronisation.......can't be done. That is why we cannot measure the one way speed of light.

    • @TheMindGrid
      @TheMindGrid 6 หลายเดือนก่อน

      I guess absolute clock synchronization is a physics problem, but if you do not care about pico second accuracy, you should be able to account for time error in travel and by computing time lags in travel path, correct the time at destination. My feeling is - The aspects of physics and relativity may not hold at such small distances as for our purposes.

  • @randomgamingstuff1
    @randomgamingstuff1 6 หลายเดือนก่อน

    I am confused about the max, I thought we wanted to minimize the cost of alignment?

    • @randomgamingstuff1
      @randomgamingstuff1 6 หลายเดือนก่อน

      I think it's just because the delta cost function in 6.26 is given as a score where higher is better. It tripped me up as a better alignment is one that's makes the least "edits" as in the min edit distance but here is a maximization problem

    • @TheMindGrid
      @TheMindGrid 6 หลายเดือนก่อน

      Its been 2 years since i made this, but what i can see is that penalties are negative, so if you maximize you get the least penalty - example max(-5, -3) = -3. So thats how this is organized. It seems totally a choice.

    • @randomgamingstuff1
      @randomgamingstuff1 6 หลายเดือนก่อน

      @@TheMindGrid thank you for responding even after so long! That makes sense, thanks for all your videos, they've helped me a lot

  • @vimalalwaysrocks
    @vimalalwaysrocks 7 หลายเดือนก่อน

    this is definitely helped me understand the intuition behind this logic but the video was hard to follow due to 1) the choice of font on the slides which makes it extremely hard to differentiate between j and i. And 2) usage of function names like Prev(j) was confusing. Should have named it as a straight fwd variable like prev_j. These choices made this video a bit cryptic and hard to follow.

    • @TheMindGrid
      @TheMindGrid 7 หลายเดือนก่อน

      Please look at this document - bitbucket.org/spandeygit/learn_dp/src/master/DPV_6.4.CorruptedDoc.pdf The use of Prev(i) is not required. Prev(i) will remember where the previous word was encountered for a word ending at any location i. Chatgpt generated this code in this link - bitbucket.org/spandeygit/learn_dp/src/master/dpv6.4.py

  • @VuDucBi
    @VuDucBi 7 หลายเดือนก่อน

    Hey, maybe I'm quite late for this. I'm 100% sure that I strictly follow your instruction. Currently my version of buildroot is the latest, 2023.02.8, my question is 'Is it O.K to not having the bzImage that have been auto-generated in your ../output/image/ dir? In my case the only thing has been automatically generated in that dir is the rootfs.tar I have been looking for answer, but sadly it didn't end-up well, maybe because I'm an SE Asian and this quite tricky to understand how the command make have did this in my case? Have you setup anything in the (make menuconfig) Kernel ---> Linux Kernel to have that bzImage? I'm such confused for being a beginner on this Kernel thing.

    • @TheMindGrid
      @TheMindGrid 7 หลายเดือนก่อน

      I think there is a new Kernel option on main page that lets you chose kernel to be included. I am building it now and will check later if it added bzImage.

    • @VuDucBi
      @VuDucBi 7 หลายเดือนก่อน

      @@TheMindGrid I'm really not sure. According to 01:42 time-marked, I still see the Kernel option right below System Configuration option, which is very odd that the make command still work but bzImage seem like don't generate or going elsewhere. I even try to search for it, bzImage/zImage but nothing could be found, sadly. I'm new to Linux and i'm practice building the OS, currently on Ubuntu 20.04 LTS just to clarify things better.

    • @TheMindGrid
      @TheMindGrid 7 หลายเดือนก่อน

      @VuDucBi - I just built image for default config = pc_x86_64_bios_defconfig. Under kernel section make sure the [*] Linux kernel is checked (default is off). My output folder has bzImage included. bitbucket.org/spandeygit/learn_linux/src/master/Kernel-options.JPG

  • @lelenny3302
    @lelenny3302 8 หลายเดือนก่อน

    Hey man. When is there going to be a part 2 for network buffers? I'm getting into what buffers are and in all honesty I think I hit gold with this video. You explained it very clearly and simply. It gave me an inside view of how engineers see things and how they work accordingly to it as well. I love this!

  • @jayasimhaedara2866
    @jayasimhaedara2866 8 หลายเดือนก่อน

    In this build root version, i am not able use dpkg command to install deb packages and cannot use apt either. Do you know how can i resolve this problem ?

    • @TheMindGrid
      @TheMindGrid 8 หลายเดือนก่อน

      buildroot will not support upstream repo AFAIK. Debian distributions have support for upstream repos that are pre built for upgradability. In this system, we are adding exactly what we need by pre-compiling it from source. To get apt you have a use a debian based linux.

  • @JS-wh2ob
    @JS-wh2ob 9 หลายเดือนก่อน

    Can this code be use for data inputs of only 32 bits instead of 256 bits? Would the tables stay the same and you only need 4 tables?

  • @JS-wh2ob
    @JS-wh2ob 9 หลายเดือนก่อน

    Can this code be use for data inputs of only 32 bits instead of 256 bits? Would the tables stay the same and you only need 4 tables?

    • @TheMindGrid
      @TheMindGrid 9 หลายเดือนก่อน

      For 32 bits, i would recommend to directly compute using combinatorial logic as it should fit within the current ASIC/FPGA technology.

    • @TheMindGrid
      @TheMindGrid 9 หลายเดือนก่อน

      Look at sites like - outputlogic.com/?page_id=321

  • @JS-wh2ob
    @JS-wh2ob 9 หลายเดือนก่อน

    Can this code be use for data inputs of only 32 bits instead of 256 bits? Would the tables stay the same and you only need 4 tables?

  • @JS-wh2ob
    @JS-wh2ob 9 หลายเดือนก่อน

    Can this code be use for data inputs of only 32 bits instead of 256 bits? Would the tables stay the same and you only need 4 tables?

  • @deeber35
    @deeber35 9 หลายเดือนก่อน

    Great video, soup to nuts!

  • @yogeshedekar6078
    @yogeshedekar6078 ปีที่แล้ว

    I think width should start from 0 to handle the base case of i == j.

    • @TheMindGrid
      @TheMindGrid ปีที่แล้ว

      The initial starting point is to fill the diagonal where W = 0 which is trivial.

  • @emergent-complexity
    @emergent-complexity ปีที่แล้ว

    I think the line "S2 = CheckerBoardSum(col-1,Prev)" should instead be "S2 = S[Prev,col-1]". You need to refer back to the table which tracks the best value of columns 1..i for pattern j that ends with pattern j. Otherwise you're just calculating the best value of the previous two columns.

    • @TheMindGrid
      @TheMindGrid ปีที่แล้ว

      Yes, thats correct. Thank you for pointing this out. I will add this to errata.

  • @THEMATT222
    @THEMATT222 ปีที่แล้ว

    Interesting 🤔

  • @omnnnooy3267
    @omnnnooy3267 ปีที่แล้ว

    why is not the cost O(m^3)?

    • @TheMindGrid
      @TheMindGrid ปีที่แล้ว

      As mentioned both in video @10:20 and in Description, order is O(m^3).

  • @niyatikhandelwal7017
    @niyatikhandelwal7017 ปีที่แล้ว

    Thank you!

  • @firezdog
    @firezdog ปีที่แล้ว

    why wouldn't a solution using DFS work?

    • @TheMindGrid
      @TheMindGrid ปีที่แล้ว

      DFS is great at finding a cycle in graph. however if you want a cycle of specific length, DFS will not be very helpful. it takes a random path and depending on this, you may not find a cycle of length 4 guaranteed, but may randomly find any cycle around it as well, which maybe a length > 4. constraining this search is a problem. For a connected undirected graph with n vertices, there can be up to n! different DFS traversals, since there are n choices for the first vertex visited, n-1 choices for the second vertex visited, and so on, down to 1 choice for the last vertex visited.

  • @MMGuy123
    @MMGuy123 ปีที่แล้ว

    At 7:53 I believe in P(x, EXC) that the min is unnecessary. Because if we exclude x, we include all the children and sum the include up, there is no min to check

    • @TheMindGrid
      @TheMindGrid ปีที่แล้ว

      Thanks for pointing this out. I will add to Errata in description.

  • @heinrichody7166
    @heinrichody7166 ปีที่แล้ว

    I have two questions: - Is there a reason why you use separate key inputs for find and for update? Even if update and find are allowed at the same time, both would be performed on the same key usually? - In software development the check whether `find` is true would probably encapsulate the loop. What is the difference in hardware of having the if-statement in the loop, instead of the other way around?

    • @TheMindGrid
      @TheMindGrid ปีที่แล้ว

      I think the key could be kept the same as well. The lookup side being independent, may help with pipeline. If you can lookup on each clock cycle, that improves your throughput. You may not need to update every clock and only update if key is not found. The find inside or outside will probably not cause much difference in hardware. It should all synthesize to same combo logic that derives found/value based on all columns of cache and the find signal. If find signal = 0, then match/value = 0. So i guess, go ahead and code it the other way if you like. Also note that the find logic will synthesize to MUX only if one of the matches is TRUE, if multiple matches becomes true, it will become priority encoder. This should happen, because we should use the find logic, to UPDATE.

  • @heinrichody7166
    @heinrichody7166 ปีที่แล้ว

    Currently learning (System)Verilog, and really liked your video and the code! Thanks!

  • @ramakrishnansubramanian6597
    @ramakrishnansubramanian6597 ปีที่แล้ว

    Thanks so much for providing these detailed solutions. It has been very helpful. At 3.30, shouldn't the recurrence for picking "j" be Vj - P(i, j-1) ? Looks like a typo in there.

    • @TheMindGrid
      @TheMindGrid ปีที่แล้ว

      You are correct, if you watch further then at 4:21, i have corrected this in the video.

  • @trellixfeedly
    @trellixfeedly ปีที่แล้ว

    Short and quick. Well explained.

  • @r.z.4007
    @r.z.4007 ปีที่แล้ว

    Thanks for your video! Is there a second episode planned? Hope so!

  • @agarwalamit081
    @agarwalamit081 ปีที่แล้ว

    I have a similar idea. Build a customized containerized Linux distro from scratch which runs on top of bare minimal Linux kernel and a container runtime. All addition applications should be launched as a container (it could include mounting resources: volumes, networks, graphics drivers, sound card drivers etc, user applications: shells, editors and more). This way we could have apps that would hardly crash as a new container would spin up to maintain the state of the cluster containing all the applications. Not sure if something like this is even feasible. In the next step, the Linux kernel modules themselves could be containerized which the container runtime should be able to handle.

  • @nagarajsunagar435
    @nagarajsunagar435 ปีที่แล้ว

    Sir can we get source code for this

    • @TheMindGrid
      @TheMindGrid ปีที่แล้ว

      I could provide the code but will take some time. Others have provided code that uses this principle. As an example look at this - github.com/fyanardi/algorithms-dpv-exercises/blob/master/Chapter6/6.6_multiplication.py

    • @nagarajsunagar435
      @nagarajsunagar435 ปีที่แล้ว

      @@TheMindGrid thank you sir

  • @kamka5056
    @kamka5056 ปีที่แล้ว

    to compute [0, 5] you would need [0,3] and [3,5] but you don't have [3,5] yet. How does looping order works?

    • @TheMindGrid
      @TheMindGrid ปีที่แล้ว

      Please watch video around 3:00 minute mark. The way these kinds of problems work is we fill diagonal which is trivial as length = 0 and i=j. Then you go above this diagonal, where length of string = 1. This uses the subproblems below again trivially. Then you start solving string of length = 3. And so on. So this way, the subproblems have already been solved before. Hope it helps.

  • @firezdog
    @firezdog ปีที่แล้ว

    Why are the subproblem C(i,r-1) and C(r+1,j)? How do you know that everything in the window the left of the root will be best in the left sub-tree and everything to the right in the right sub-tree, i.e. that you wouldn't be better off mixing and matching when you distribute the remaining nodes between sub-trees? Is there some kind of hidden symmetry principle in play here?

    • @TheMindGrid
      @TheMindGrid ปีที่แล้ว

      The binary search tree is built on idea that at any given point, left tree nodes are smaller than a given root node, and right side nodes are bigger than the given root node. Thus if you write down all numbers in sorted order, and pick one of numbers as your top level root, you know that left tree and right tree are distinct and can not be mixed. Hence if you could chose the right middle node, you have split the problem into two smaller problems. You can read more here - en.wikipedia.org/wiki/Optimal_binary_search_tree