Author Archives: stgstg27

A Practical Guide to Feature Scaling in Machine Learning

Introduction Feature scaling is one of the most overlooked yet crucial steps in the machine learning pipeline. It’s the quiet hero ensuring that your models converge faster, predictions stay accurate, and algorithms behave as expected. Whether you’re a beginner or a seasoned data scientist, understanding when and how to scale your features can make allContinue reading “A Practical Guide to Feature Scaling in Machine Learning”

Understanding Consistent Hashing: Improving Distributed Caching Efficiency

Introduction:In the realm of distributed systems and caching mechanisms, the concept of consistent hashing plays a vital role in optimizing efficiency and reliability. By understanding how consistent hashing works and its significance in distributed caching, we can delve deeper into improving the scalability and performance of our systems. 1. What is Hashing?Hashing is a fundamentalContinue reading “Understanding Consistent Hashing: Improving Distributed Caching Efficiency”

Smart Hike – Backend

What was the project? We worked on a platform to show nearby hikes, recommend them and advanced filters to allow users to choose their hikes in a personal manner – https://develop.dg28ry4dtil6u.amplifyapp.com/ (API used might have expired) Backend Architecture The application architecture uses AWS Lambda, Amazon API Gateway, Amazon DynamoDB, Amazon Cognito, and AWS Amplify Console. Amplify Console provides continuous deploymentContinue reading “Smart Hike – Backend”

Background Subtraction

Background Subtraction is widely used in motion tracking and analysis. This is my work on differnt Background Subtraction algorithms. Getting Started I have coded in python lanngauge and used opencv Library for the subtractor. Python Version: 3.6.2 Opencv Version : 3.4.1 What is Background Subtraction? The idea behind background subtraction (also commonly referred to asContinue reading “Background Subtraction”

Distributed System’s Impossible dream – CAP Theorm Part 2

To follow that starno matter how hopeless,no matter how far,to fight for the rightwithout question or pause,to be willing to march, march into hellfor that heavenly cause — An extract from “Mad men are children of God” by Dale Wasserman We are going to discuss the CAP theorem. To recap: CAP theorem in distributed systems meansContinue reading “Distributed System’s Impossible dream – CAP Theorm Part 2”

Distributed System’s Impossible dream – CAP Theorm Part 1

To dream the impossible dreamTo fight the unbeatable foeTo bear with unbearable sorrowTo run where the brave dare not go — An extract from “Mad men are children of God” by Dale Wasserman CAP theorem in distributed systems means that a distributed system can deliver only two of three desired characteristics: consistency, availability, and partition tolerance (the ‘C,’ ‘A’ andContinue reading “Distributed System’s Impossible dream – CAP Theorm Part 1”