Sheng Guo’s Post

Light Up the Future with Li-Fi: My DIY Receiver is Here! Calling all tech enthusiasts and data ninjas! I'm bursting with excitement to share my latest creation: a Li-Fi receiver circuit that harnesses the power of visible light for high-speed, secure, and unidirectional data transmission. Forget clunky cables and radio waves , Li-Fi uses the flicker of LEDs to send information, making it immune to interference, super secure (no eavesdropping!), and blazing fast. ⚡ But this isn't just some theoretical concept. I've built a real-life Li-Fi receiver circuit from scratch, complete with: Light-sensitive photodetector: Captures the secret messages encoded in light. Boosting amplifier: Turns those whispers into shouts for easy processing. Savvy comparator: Decodes the light's hidden language, one binary bit at a time. ️ FTDI bridge: Transforms the code into a format your computer can understand. Python magic: Unlocks the data's secrets and reveals its true form. 🪄 I'm still tinkering and tweaking, but the results are already electrifying. Want to see it in action? Check out my demo video and witness the future of wireless communication firsthand! And for the real tech wizards out there, dive deep into the code and schematics on my GitHub repository: yashdeepkum (github.com). Don't hesitate to fork it, experiment, and let's build the future of Li-Fi together! So, ditch the wires, embrace the light, and join me on this exciting journey into the world of Li-Fi! ✨ #LiFi #WirelessRevolution #DIYTech #Innovation P.S. Stay tuned for even more updates and mind-blowing Li-Fi experiments! P.P.S. Did I mention it's also super safe for humans? No more fried brains from microwaves!

An #OSINT tool to collect intelligence on the #Darkweb. Prying Deep crawls dark/clear net platforms and extracts as much intelligence as possible effectively. Source: https://lnkd.in/dWrVCN2k

🌟𝐒𝐭𝐫𝐞𝐚𝐤 𝐃𝐚𝐲 156 💻 𝐉𝐮𝐥𝐲 𝐋𝐞𝐞𝐭𝐂𝐨𝐝𝐢𝐧𝐠 𝐂𝐡𝐚𝐥𝐥𝐞𝐧𝐠𝐞 - 𝐃𝐚𝐲 05 🧠 Problem of the Day: 2058. Find the Minimum and Maximum Number of Nodes Between Critical Points (https://lnkd.in/gJy-wQAH) 🔍 𝐀𝐩𝐩𝐫𝐨𝐚𝐜𝐡: First track the positions of these critical points, and for each new critical point found, update the minimum distance between consecutive critical points and store the first and most recent critical points' positions to calculate the maximum distance. If fewer than two critical points are found, return {-1, -1}; otherwise, return the minimum and maximum distances between critical points. 📚 Solution Link: https://lnkd.in/gz_8ApXp #leetcode #leetcodechallenge #dsa #leetcodestreak #potd #JobSeeker #DataStructures #Algorithms

Hello, Connections!!! Day 86 of 365 Solved the question of Different Bits Sum Pairwise. Problem Description We define f(X, Y) as the number of different corresponding bits in the binary representation of X and Y. For example, f(2, 7) = 2, since the binary representation of 2 and 7 are 010 and 111, respectively. The first and the third bit differ, so f(2, 7) = 2. You are given an array of N positive integers, A1, A2,..., AN. Find sum of f(Ai, Aj) for all pairs (i, j) such that 1 ≤ i, j ≤ N. Return the answer modulo 109+7. Just took up a new challenge for 365 days, I have participated in the #365daysofscaler, looking forward to learning new things and making a full 365-day streak. #scalerdiscord #codewithscaler #365daysofcode

3 weeks to go for the #LLM code-gen #competition for producing correct relationship directions for knowledge graph in #Cypher queries. Let's see if you can crack this challenge: https://lnkd.in/eWJhm2DA #GenerativeAI

With the fast pace of LLM releases, new Red Hat technology is now allowing a community of developers to contribute new knowledge and skills to open source LLMs on a week by week basis. This is a complement to IBM making Granite code models open source for code generative tasks. #ai #llm #ibm #redhat

Matteo Catena is presenting the routing join feature in Siren Federate. This join strategy leverages data distribution knowledge to optimize execution, making it a powerful tool for improving performance when data modeling can be planned upfront. Check out his blog post to better understand how this algorithm works, how it differs from other join strategies, and in which scenarios you can leverage it to improve performance.

Just solved the Diagonal Difference challenge on HackerRank! Strengthening my algorithmic problem-solving abilities. #ProblemSolving #HackerRank #Algorithms #Continuouslearning [Check out the challenge here](https://lnkd.in/ga7Bjayw)

I've just published a blog post about the routing join, one of the #distributed join algorithms for Elasticsearch that we develop here at Siren. The routing join is one of the join algorithms #Siren Federate has in its toolbox. It is useful when joining #Elasticsearch documents by using their unique identifiers, the _id field. The routing join is specifically tailored for this scenario and effective at reducing its #latency. In this blog post (link below) I will illustrate the idea behind the routing join. Using a practical example, I will first introduce some of Elasticsearch’s #join mechanisms and their limitations. Then, I will show how Federate’s joins overcome them and which other challenges they introduce. Following, I will explain how the routing join #algorithm works and why it is efficient for joining documents by using their _id field.