ComputingNotes

Tactical MANETs – Node Mobility, Tx Range, Routing Schemes

by ComputingNotes
Tactical MANETs Tactical Mobile Ad-Hoc Networks (MANETs) provide dynamic, infrastructure-less connectivity in environments without traditional networks. Live Simulation: Full Network Packet Routing 1. Node Mobility Tactical devices are constantly moving. Military units travel in swarms or platoons, requiring the network to predict group mobility patterns to maintain stable connections as topology shifts. Simulation: Platoon Movement ... Read More

Quantum Feature Map

by ComputingNotes
Resources: The Concept: Quantum Feature Maps In classical machine learning, a “kernel trick” is often used to map data into a higher-dimensional space. Quantum computers provide a natural way to do this: Feature Map The process of encoding a classical input vector \( \vec{x} \) into a quantum state \( |\Phi(\vec{x})\rangle \) acts as a ... Read More

Inner or Dot Products – Linear Algebra

by ComputingNotes
In linear algebra, the dot product (or inner product) is specifically used for vectors. It takes two vectors of the same dimension and results in a single scalar value (a number). 1. Geometric Definition Geometrically, the dot product measures the overlap or projection of one vector onto another. a · b = ||a|| ||b|| cos(θ) ... Read More

Probability – Conditional Probability and Independence

by ComputingNotes
Resource: What is Conditional Probability? Conditional Probability Conditional probability is the likelihood of an event occurring, given that another event has already happened. It allows us to update our understanding of an outcome based on new information or specific “conditions.” The Formula P(A|B) = P(A ∩ B) P(B) • P(A|B): The probability of event A ... Read More

Asymptotic Notation: Upper Bound (Big Oh) – DSA

by ComputingNotes
Reference: Key Concept: Suppose, we have two algorithms A and B, then how do we decide which algorithm is better? Upper Bound – Big Oh What is upper bound for a function f(n)? The formal definition can be Formal Definition: Big O Notation For a function \( f(n) \) that is non-negative for all integers ... Read More

Probability – Distributions

by ComputingNotes
Book Probability by Jim Pitman, Page 19 Events and Sets Set Theory & Venn Diagram Gallery Intersection: \(A \cap B\) A B “A AND B” — Elements in both. Union: \(A \cup B\) A B “A OR B” — Elements in either or both. Complement: \(A^c\) A U “NOT A” — Everything outside A. Subset: ... Read More

Paper Highlight – Quantum Inspired classical algorithm for recommendation systems

by ComputingNotes
E. Tang, “A quantum-inspired classical algorithm for recommendation systems,” in Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, Jun. 2019, pp. 217–228. doi: 10.1145/3313276.3316310.\ “Introduction | IBM Quantum Learning,” IBM Quantum Learning, 2021. https://quantum.cloud.ibm.com/learning/en/courses/quantum-machine-learning/introduction (accessed Feb. 20, 2026). Paper Summary: Classical Analogue to Quantum Recommendation Systems Author: Ewin Tang Key Finding: The ... Read More

How to use LLMs with Matlab.

by ComputingNotes
https://github.com/matlab-deep-learning/llms-with-matlab/blob/main/examples/RetrievalAugmentedGenerationUsingOllamaAndMATLAB.md https://blogs.mathworks.com/deep-learning/2024/07/09/local-llms-with-matlab Connet to Ollama:https://github.com/matlab-deep-learning/llms-with-matlab/blob/main/doc/Ollama.md OR matlab terminal >> !ollama pull mistral

IBM Course: Introduction to Quantum Machine Learning

by ComputingNotes
Resources: Introduction to Quantum Machine Learning A Comprehensive Course Overview The Classical-Quantum Intersection Quantum Machine Learning (QML) is a symbiotic cycle where quantum and classical systems push each other’s limits. The current focus remains on applying quantum algorithms to classical datasets to complement existing workflows where classical systems already excel. Feature Mapping & Kernels A ... Read More

Caculus – Exponential Functions

by ComputingNotes
Resource: The Exponential Function Suppose we have a quantity \(y\), whose rate of change over time is proportional to the amount present. We can describe this relationship using a differential equation: \[ \frac{dy}{dt} = ky \] If we define the initial state where \(y = y_0\) at time \(t = 0\), the solution to this ... Read More
error: