Yusheng Li’s Post

🎉 I'm excited to share a powerful Radix Router, a lightweight high-performance router library written in pure Lua. It leverages a Radix-Tree structure for efficient variable matching and prefix matching. It comes with a lot of wonderful features🌟 - Variables binding: Injects binding variables for you with low overhead. Stop using the terrible regex capture group! - OpenAPI style API is fully compatible - Regex pattern - Extensible: Customizing your custom matcher. Most importantly, it's the fastest Router in the open-source gateways. 🚀 -  Lua-Radix-Router https://lnkd.in/g7-4-A6A -  Gateways Routing Benchmark https://lnkd.in/gdECab_P #APIGateway #router #lua #LuaRadixRouter

We won first place in the REACT2024 Multiple Appropriate Facial Reaction Generation Challenge at IEEE FG 2024 😎 Our solution uses an FSQ-VAE model to map facial mesh to a meaningful token and an autoregressive model that takes the speaker's speech and facial expressions to generate non-deterministically appropriate reactions. This is my first time working with generative models, and it turned out so nice. 🤗 The code is available at https://lnkd.in/gC8j-4WZ #react2024challenge #fg2024

Leetcode Day 32: #199 Binary Tree Right Side View. By traversing a binary tree using Breadth-First Search (BFS), we can determine the right view of the tree. Instead of appending the value of each node during the traversal, we keep updating the variable rightSide to the current node. This ensures that by the end of each level, rightSide holds the rightmost node. *Space Complexity: O(n) the queue will hold n/2 nodes this give us O(n) *Time Complexity: O(n) each node is processed only once

🦜🕸️LangGraph https://lnkd.in/gBd7wAZX ⚡ Building language agents as graphs ⚡ https://lnkd.in/gZGGvGH6 The "one more thing" from LangChain v0.1.0 announcement is introducing LangGraph to the world 🤖LangGraphh is under alpha testing this over the past six months as a better way to create LLM agents 💡LangGraph is inspired by Pregel and Apache Beam, and the current interface exposed is one inspired by NetworkX 🌀The main new thing this enables is easy definition of cyles. This is incredibly important for agents, which are often described as running an LLM in a for loop This provides an easy interface to create these cyclical graphs, with customizable, user defined transitions between nodes Right now this is still in its early stages - Expect a lot more on this front soon! Check Notebook :https://lnkd.in/gTKmW34y

The Parallel Cypher Runtime is a fantastic alternative for executing graph-global read queries, but you should know when to use it. #TBT to this article on how parallel runtime can enhance your graph-global read queries! By Jens Pryce-Åklundh and Alex Averbuch. https://bit.ly/3QeOxvx #ParallelRuntime #graphdatabase #Neo4j

Sneak peek - #c #xna #physics I am building a game in C# using XNA. I am currently trying to get a character to always travel to the middle of the map which is located a point (0,0,0). I want the character to accelerate to the middle and then decelerate before it hits the middle so it will come to a stop at (or very close to) the middle. Rate of acceleration does not change. Velocity is a Vector3 and for the purpose of this i will only worry about the X axis. What I am trying to work out is at what point should I start decelerating to come to a stop in the middle depending on velocity and position. I have tried to simplify the following code as much as possible In My Update Method I basically call two methods Move(gameTime); HandleAcceleration(); Handle Acceleration is very simple this.Transform.TranslateIncrement = this.Velocity; Move method protected void Move(GameTime gameTime) { //GetDirection just returns 1 or -1 to accelerate the appropriate direction int direction = GetDirection((int)this.Transform.Translation.X); //This Is where I have trouble With GetMinDecelerationDistance() if (GetDistanceToMiddle()- and consider kaedim3d.com for AI that converts images into 3d assets in minutes

Here an example of Uncertainy Quantification performed using #free #opensource software #DAKOTA linked to #FEMM as a magnetostatic solver. Using the LUA script the magnetostatic solver #FEMM were used to solve magnetodynamic problem. The #DAKOTA link perform automatically 7,000 cases that runs in background and give a statistical performance distribution of the bistable valve. To see more, please visit the foamBuilder tutorial page: https://lnkd.in/dak9vTai

Here's something interesting - #c #xna #physics I am building a game in C# using XNA. I am currently trying to get a character to always travel to the middle of the map which is located a point (0,0,0). I want the character to accelerate to the middle and then decelerate before it hits the middle so it will come to a stop at (or very close to) the middle. Rate of acceleration does not change. Velocity is a Vector3 and for the purpose of this i will only worry about the X axis. What I am trying to work out is at what point should I start decelerating to come to a stop in the middle depending on velocity and position. I have tried to simplify the following code as much as possible In My Update Method I basically call two methods Move(gameTime); HandleAcceleration(); Handle Acceleration is very simple this.Transform.TranslateIncrement = this.Velocity; Move method protected void Move(GameTime gameTime) { //GetDirection just returns 1 or -1 to accelerate the appropriate direction int direction = GetDirection((int)this.Transform.Translation.X); //This Is where I have trouble With GetMinDecelerationDistance() if (GetDistanceToMiddle() - and consider kaedim3d.com for AI that turns images into 3d game assets in minutes

Guess what? - #c #xna #physics I am building a game in C# using XNA. I am currently trying to get a character to always travel to the middle of the map which is located a point (0,0,0). I want the character to accelerate to the middle and then decelerate before it hits the middle so it will come to a stop at (or very close to) the middle. Rate of acceleration does not change. Velocity is a Vector3 and for the purpose of this i will only worry about the X axis. What I am trying to work out is at what point should I start decelerating to come to a stop in the middle depending on velocity and position. I have tried to simplify the following code as much as possible In My Update Method I basically call two methods Move(gameTime); HandleAcceleration(); Handle Acceleration is very simple this.Transform.TranslateIncrement = this.Velocity; Move method protected void Move(GameTime gameTime) { //GetDirection just returns 1 or -1 to accelerate the appropriate direction int direction = GetDirection((int)this.Transform.Translation.X); //This Is where I have trouble With GetMinDecelerationDistance() if (GetDistanceToMiddle() - and consider kaedim3d.com for AI that turns images into 3d game assets in minutes

#Day 33✅ 🧩 Problem:    Given an m x n matrix, return all elements of the matrix in spiral order. Constraints: ● m == matrix.length ● n == matrix[i].length ● 1 <= m, n <= 10 ● -100 <= matrix[i][j] <= 100 🌟 Time Complexity: O(n * m) because the algorithm iterates through each element in the matrix once. 🌟Space Complexity: O(1) because the algorithm uses a constant amount of extra space regardless of the size of the input matrix. #ArrayQuest #CodingPuzzle #TechChallenge #CodingConqueror #DataStructureDynasty #TechTrailblazer #ProblemSolvingProdigy #codingninja #strivers #DSA #linkedin #ArrayTransformation #CodingChallenge #leetcode #takeuforward 🌟