This media is not supported in your browser
VIEW IN TELEGRAM
Now any doodles can be turned into architectural designs.
The genius created an interface with neurons that transforms ordinary drawings into architectural-themed designs.
https://github.com/s-du/ScribbleArchitect
The genius created an interface with neurons that transforms ordinary drawings into architectural-themed designs.
https://github.com/s-du/ScribbleArchitect
🔥1
Media is too big
VIEW IN TELEGRAM
Fighters controlled by artificial intelligence and a living person met for the first time in a training air battle in the skies over the United States. However, DARPA did not say which of them “won.”
The first battle between the AI and the pilot took place back in 2021, and then the car won almost all the battles, but that was on a simulator. Now the real VISTA X-62A fighter was under AI control. In the skies above Edwards Air Force Base, he engaged in close combat with an F-16 aircraft piloted by pilots.
There was also an instructor in the cockpit of the VISTA X-62A and the AI, but he did not touch the control levers - the artificial intelligence independently built the order of defensive and offensive maneuvers. During a training battle, the planes even performed a rendezvous maneuver of up to 600 m at a speed of about 2000 km/h.
#AI
The first battle between the AI and the pilot took place back in 2021, and then the car won almost all the battles, but that was on a simulator. Now the real VISTA X-62A fighter was under AI control. In the skies above Edwards Air Force Base, he engaged in close combat with an F-16 aircraft piloted by pilots.
There was also an instructor in the cockpit of the VISTA X-62A and the AI, but he did not touch the control levers - the artificial intelligence independently built the order of defensive and offensive maneuvers. During a training battle, the planes even performed a rendezvous maneuver of up to 600 m at a speed of about 2000 km/h.
#AI
Forwarded from Gopher Academy (bardia.go)
Forwarded from Gopher Academy (bardia.go)
Gopher Academy
Top 8 Cache Eviction Strategies. 👇👇👇👇👇 ➖➖➖➖➖➖➖➖ 🕊 @gopher_academy | @GolangEngineers
op 8 Cache Eviction Strategies.
.
.
🔹 LRU (Least Recently Used)
LRU eviction strategy removes the least recently accessed items first. This approach is based on the principle that items accessed recently are more likely to be accessed again in the near future.
🔹 MRU (Most Recently Used)
Contrary to LRU, the MRU algorithm removes the most recently used items first. This strategy can be useful in scenarios where the most recently accessed items are less likely to be accessed again soon.
🔹 SLRU (Segmented LRU)
SLRU divides the cache into two segments: a probationary segment and a protected segment. New items are initially placed into the probationary segment. If an item in the probationary segment is accessed again, it is promoted to the protected segment.
🔹 LFU (Least Frequently Used)
LFU algorithm evicts the items with the lowest access frequency.
🔹 FIFO (First In First Out)
FIFO is one of the simplest caching strategies, where the cache behaves in a queue-like manner, evicting the oldest items first, regardless of their access patterns or frequency.
🔹 TTL (Time-to-Live)
While not strictly an eviction algorithm, TTL is a strategy where each cache item is given a specific lifespan.
🔹 Two-Tiered Caching
In Two-Tiered Caching strategy, we use an in-memory cache for the first layer and a distributed cache for the second layer.
🔹 RR (Random Replacement)
Random Replacement algorithm randomly selects a cache item and evicts it to make space for new items. This method is also simple to implement and does not require tracking access patterns or frequencies.
➖➖➖➖➖➖➖➖
🕊 @gopher_academy | @GolangEngineers
.
.
🔹 LRU (Least Recently Used)
LRU eviction strategy removes the least recently accessed items first. This approach is based on the principle that items accessed recently are more likely to be accessed again in the near future.
🔹 MRU (Most Recently Used)
Contrary to LRU, the MRU algorithm removes the most recently used items first. This strategy can be useful in scenarios where the most recently accessed items are less likely to be accessed again soon.
🔹 SLRU (Segmented LRU)
SLRU divides the cache into two segments: a probationary segment and a protected segment. New items are initially placed into the probationary segment. If an item in the probationary segment is accessed again, it is promoted to the protected segment.
🔹 LFU (Least Frequently Used)
LFU algorithm evicts the items with the lowest access frequency.
🔹 FIFO (First In First Out)
FIFO is one of the simplest caching strategies, where the cache behaves in a queue-like manner, evicting the oldest items first, regardless of their access patterns or frequency.
🔹 TTL (Time-to-Live)
While not strictly an eviction algorithm, TTL is a strategy where each cache item is given a specific lifespan.
🔹 Two-Tiered Caching
In Two-Tiered Caching strategy, we use an in-memory cache for the first layer and a distributed cache for the second layer.
🔹 RR (Random Replacement)
Random Replacement algorithm randomly selects a cache item and evicts it to make space for new items. This method is also simple to implement and does not require tracking access patterns or frequencies.
➖➖➖➖➖➖➖➖
🕊 @gopher_academy | @GolangEngineers
https://lisyarus.github.io/blog/posts/exponential-smoothing.html
Animation smoothing (exponential smoothing)
Animation smoothing (exponential smoothing)
lisyarus blog
My favourite animation trick: exponential smoothing
Exploit.education
provides a variety of resources that can be used to learn about vulnerability analysis, exploit development, software debugging, binary analysis, and general cyber security issues.
provides a variety of resources that can be used to learn about vulnerability analysis, exploit development, software debugging, binary analysis, and general cyber security issues.