CAT2IIM By Manoj Mahajan’s Post

2024 NSF CPS PI meeting demo (continued): To give a visual feel of the coupled cascade propagation to my colleagues in LinkedIn, I have prepared a video. The MATLAB code was developed by my ex-student Dr. Sina Gharebaghi. The first part of the video shows a still image of the final results of a particular cascading failure case study in the IEEE 118-bus system without preventive control (outages: red nodes/edges). In the second part, the progressive outages in presence of optimal preventive control can be seen through appearance of red nodes/edges in the graphs. Please follow the cursor that points to key features/variables throughout. Please refer to our paper in IEEE TSG for more details: https://lnkd.in/efP2vVzb

🔢 Day 4 of GfG 160: Next Permutation 🔢  Today’s challenge on my 160 Days of Problem Solving journey pushed me to think algorithmically and dive into the concept of permutations! 🚀  🔄 Problem: Next Permutation   Difficulty: Medium | Accuracy: 100% | Submissions: 148K+  📝 Problem Statement:   Given an array `arr[]` representing a permutation, implement the **next lexicographical permutation**. If no such permutation exists, rearrange the numbers into the lowest possible order (sorted in ascending order).  💡 Steps to Solve:   1️⃣ Find the first index (`pivot`) from the end where `arr[i] < arr[i+1]`.   2️⃣ Swap the `pivot` element with the smallest larger element to its right.   3️⃣ Reverse the elements to the right of the `pivot` to get the next permutation.  ✨ Takeaways:   This problem demonstrates the power of understanding permutation mathematics and how careful in-place array manipulations can achieve the desired results with optimal performance.  🔗 Stepping up the difficulty ladder and loving the learning process. On to the next one! 💪  #GeeksForGeeks #ProblemSolving #NextPermutation #Day4 #CodingJourney #KeepLearning #GfG160 #KeepLearning #ConsistencyIsKey #gfg160 #geekstreak2024

🌟 Day 70 of #100DaysOfDSA Challenge 🌟 Today, I focused on understanding and implementing key concepts related to graphs: - Graph Components : Learned about the fundamental components that make up graphs. - Cycle Detection :  - Explored how to detect cycles in undirected graphs.  - Learned techniques for identifying cycles in directed graphs. Gaining a solid grasp of these concepts is crucial for tackling complex problems in graph theory! #GraphTheory #CycleDetection #CodingJourney #100DaysOfCode #DSA

Calculate the shortest paths in a graph using Dijkstra's algorithm! 🚀 This program finds the optimal routes from a specified source node to all other nodes, ensuring efficiency and accuracy. 📈✨ Ideal for learning and demonstrating graph traversal techniques! 🔍🛤️

Really proud that I just got 5.5/10 for my Bachelor Thesis to pass. Python package based on my Bachelor Thesis 🤣 - "EVRPTW-PR-ALNS 0.0.3" has been released in PyPI: https://lnkd.in/ewanjCBx. Try "pip install EVRPTW-PR-ALNS" in your Python IDE or view code in Github: https://lnkd.in/ejje_D_F. The released version is more like a demo, later more stuff and guidance will be added! This package provides a solution for the Electric Vehicle Routing Problem with Time Window and Partially Recharging Strategy (EVRPTW-PR) using both a Mixed Integer Linear Programming (MILP) model and Adaptive Large Neighborhood Search (ALNS). More functionality details are in thesis, and build upon the seminal papers, which are deeply appreciated: -Keskin and Catay (2016) -Schneider, Stenger, and Goeke (2014) -Ropke and Pisinger (2006)

It's official! I will be presenting not once, but twice at the Society for Industrial and Applied Mathematics (SIAM) Annual Meeting '24. First, at Student Days I will be presenting my research on optimizing algorithmic trading using fractal reinterpretation of market graphs. Then, I will share my insights about applications of Monte Carlo methods in statistical significance testing at the regular session during the Virtual Component (session CP2/VCP2 on 18th of July). It will be a great pleasure to speak among the greatest mathematicians and to gain valuable knowledge from them! #SIAMAN24

GCD Without Libraries, Day 8 Today's challenge was to compute the Greatest Common Divisor (GCD) of two numbers n and m—no libraries allowed! Approach: Using the Euclidean algorithm, we repeatedly take remainders until one of the numbers becomes 0. The other number is the GCD.  #NinjasSlayground #Codingninjas

【Online Fault Monitoring of On-Load Tap-Changer Based on Voiceprint Detection】 Full article: https://lnkd.in/g2WHSam9 (Authored by Kitwa Henock Bondo, from Hubei University of Technology, China.) On-Load Tap-Changers (#OLTC) play a critical role in regulating voltage levels during varying load conditions in power systems. This paper presents a novel approach that combines #voiceprint_detection with MATLAB analysis to enhance fault monitoring in OLTC, which harnesses the unique acoustic emissions produced by OLTC during operation and utilizes MATLAB's powerful analysis capabilities to accurately detect and classify faults. #Online_Fault_Monitoring 

Problem 3 Day 3- Hash Table Hey connections, Today is all about Bit Manipulation in Hash Table! Here's how we can solve the problem more efficiently. Explanation 1. Cumulative XOR Array: We create an array (xors) to store the cumulative XOR values from the start of the array up to each index. This helps us quickly compute the XOR of any subarray. 2. Iterate Over Possible Triplets: We use three nested loops to iterate over all possible triplets (i, j, k). For each triplet, we check if the XOR of elements from i to k is equal to the XOR of elements from i to j-1 concatenated with j to k. I hope the logic was easy for you to grasp. I am looking forward to teaching you guys problem-solving. HeyCoach #day3 #problemsolving #dsa #graphs #rightapproach #softwaredevelopment #learning

Journal Impact Factor JCR-WoS: 2.0 (2023) Q1 CiteScore 2023: 3.1 Q1