commit a6673f4dd76710a9f767badca48a017088e2f8ea
parent 1a2265d77024044ef07ff75c41e9911136abf1e0
Author: AndrewLockVI <andrewlaack1@gmail.com>
Date: Mon, 3 Feb 2025 21:32:54 -0600
Updated all links to have spaces (looks nicer when rendered)
Diffstat:
35 files changed, 439 insertions(+), 415 deletions(-)
diff --git a/convertLinks.py b/convertLinks.py
@@ -0,0 +1,27 @@
+import re
+import os
+
+def split_camel_case(match):
+ """Insert spaces into CamelCase words."""
+ text = match.group(1)
+ spaced_text = re.sub(r'(?<=[a-z])(?=[A-Z])', ' ', text)
+ return f'[{spaced_text}]'
+
+def update_links(text):
+ """Finds links in brackets and updates CamelCase words."""
+ return re.sub(r'\[(\w+)\]', split_camel_case, text)
+
+def process_directory(directory):
+ """Processes all files in a given directory."""
+ for filename in os.listdir(directory):
+ filepath = os.path.join(directory, filename)
+ if os.path.isfile(filepath):
+ with open(filepath, 'r', encoding='utf-8') as file:
+ content = file.read()
+ updated_content = update_links(content)
+ with open(filepath, 'w', encoding='utf-8') as file:
+ file.write(updated_content)
+
+# Example usage
+directory_path = "./docs"
+process_directory(directory_path)
diff --git a/docs/AISafety.md b/docs/AISafety.md
@@ -19,9 +19,9 @@ How to test for AGI?
Ch. 1
* [Singularity](Singularity.md)
-* [IntelligenceExplosion](IntelligenceExplosion.md)
+* [Intelligence Explosion](IntelligenceExplosion.md)
* [Prognosticator](Prognosticator.md)
-* [OptimalBayesianAgent](OptimalBayesianAgent.md)
-* [FlashCrash](FlashCrash.md) - Real world example of mis-specified utility function causing consequences
-* [StrongAI](StrongAI.md)
-* [WeakAI](WeakAI.md)
+* [Optimal Bayesian Agent](OptimalBayesianAgent.md)
+* [Flash Crash](FlashCrash.md) - Real world example of mis-specified utility function causing consequences
+* [Strong AI](StrongAI.md)
+* [Weak AI](WeakAI.md)
diff --git a/docs/Algorithms.md b/docs/Algorithms.md
@@ -4,10 +4,10 @@ This is an index for links to notes taken about algorithms. These are CS related
## Links
-- [MonteCarloMethod](MonteCarloMethod.md)
-- [LasVegasMethod](LasVegasMethod.md)
-- [PerlinNoise](PerlinNoise.md)
-- [FisherYatesShuffle](FisherYatesShuffle.md)
+- [Monte Carlo Method](MonteCarloMethod.md)
+- [Las Vegas Method](LasVegasMethod.md)
+- [Perlin Noise](PerlinNoise.md)
+- [Fisher Yates Shuffle](FisherYatesShuffle.md)
#### CSCI 303 (DS&A)
@@ -15,30 +15,30 @@ Ch 0 (algorithms):
- [Algorithm](Algorithm.md)
- [Task](Task.md)
-- [TimeComplexity](TimeComplexity.md)
-- [CountingPrinciple](CountingPrinciple.md)
-- [MultiValuedFunction](MultiValuedFunction.md)
+- [Time Complexity](TimeComplexity.md)
+- [Counting Principle](CountingPrinciple.md)
+- [Multi Valued Function](MultiValuedFunction.md)
- [Collection](Collection.md)
-- [FunctionNotation](FunctionNotation.md)
-- [OperatorNotation](OperatorNotation.md)
+- [Function Notation](FunctionNotation.md)
+- [Operator Notation](OperatorNotation.md)
Ch 1 (stacks and queues):
-- [AbstractDataType](AbstractDataType.md)
+- [Abstract Data Type](AbstractDataType.md)
- [Stack](Stack.md)
- [Queue](Queue.md)
Ch 2 (Big-O and Asymptotic Complexity):
-- [BigONotation](BigONotation.md)
-- [AsymptoticNotation](AsymptoticNotation.md) (include asymptotic complexity class)
-- [BigThetaNotation](BigThetaNotation.md)
+- [Big ONotation](BigONotation.md)
+- [Asymptotic Notation](AsymptoticNotation.md) (include asymptotic complexity class)
+- [Big Theta Notation](BigThetaNotation.md)
- [Linearithmic](Linearithmic.md)
Ch 3 (state analysis):
-- [StateAnalysis](StateAnalysis.md)
-- [StirlingsFormula](StirlingsFormula.md)
+- [State Analysis](StateAnalysis.md)
+- [Stirlings Formula](StirlingsFormula.md)
Ch 4 (graphs):
@@ -48,43 +48,43 @@ Ch 4 (graphs):
- [Cycle](Cycle.md)
- [Connected](Connected.md)
- [Tree](Tree.md)
-- [AdjacencyMatrix](AdjacencyMatrix.md) (nxn matrix with true and false for a_i,j)
+- [Adjacency Matrix](AdjacencyMatrix.md) (nxn matrix with true and false for a_i,j)
- [Digraph](Digraph.md)
- [Multigraph](Multigraph.md)
- [Loop](Loop.md) (different than cycle)
- [Sparse](Sparse.md)
- [Subgraph](Subgraph.md)
-- [ConnectedComponent](ConnectedComponent.md)
-- [WeightedGraph](WeightedGraph.md)
-- [EmptyGraph](EmptyGraph.md)
+- [Connected Component](ConnectedComponent.md)
+- [Weighted Graph](WeightedGraph.md)
+- [Empty Graph](EmptyGraph.md)
- [Bipartite](Bipartite.md)
Ch 5 (Hashing)
- [Hashing](Hashing.md)
- [Homogeneous](Homogeneous.md)
-- [HashTable](HashTable.md)
+- [Hash Table](HashTable.md)
- [Key](Key.md)
-- [HashValues](HashValues.md)
-- [HashFunction](HashFunction.md)
+- [Hash Values](HashValues.md)
+- [Hash Function](HashFunction.md)
- [Folding](Folding.md)
-- [ArithmeticComputations](ArithmeticComputations.md)
-- [FiniteField](FiniteField.md)
+- [Arithmetic Computations](ArithmeticComputations.md)
+- [Finite Field](FiniteField.md)
- [Collision](Collision.md)
-- [LinearProbing](LinearProbing.md)
-- [ProbingFunction](ProbingFunction.md)
-- [QuadraticProbing](QuadraticProbing.md)
-- [LoadFactor](LoadFactor.md)
+- [Linear Probing](LinearProbing.md)
+- [Probing Function](ProbingFunction.md)
+- [Quadratic Probing](QuadraticProbing.md)
+- [Load Factor](LoadFactor.md)
- [Chaining](Chaining.md)
-- [BucketAddressing](BucketAddressing.md)
+- [Bucket Addressing](BucketAddressing.md)
Ch 6 (Information Theory and Data Compression)
- InformationTheory
- [Codeword](Codeword.md)
-- [BinaryCode](BinaryCode.md)
+- [Binary Code](BinaryCode.md)
- [Entropy](Entropy.md)
-- [InformationContent](InformationContent.md)
+- [Information Content](InformationContent.md)
- HuffmanCoding
- RootedTree (ordered pair (T,r) where r is the root (arbitrary) and T is a graph (tree))
- Leaf - Exactly one neighbor
@@ -99,59 +99,59 @@ Ch 7 (Game Strategy)
Operation types (operations done with n inputs)
-- [UnaryOperations](UnaryOperations.md)
-- [BinaryOperations](BinaryOperations.md)
-- [NaryOperations](NaryOperations.md)
-- [VariadicOperations](VariadicOperations.md)
+- [Unary Operations](UnaryOperations.md)
+- [Binary Operations](BinaryOperations.md)
+- [Nary Operations](NaryOperations.md)
+- [Variadic Operations](VariadicOperations.md)
#### Intro To Algorithms (MIT)
L1:
-- [AsymptoticNotation](AsymptoticNotation.md)
-- [FundamentalOperations](FundamentalOperations.md)
+- [Asymptotic Notation](AsymptoticNotation.md)
+- [Fundamental Operations](FundamentalOperations.md)
L2:
-- [LinkedLists](LinkedLists.md)
-- [DataStructureAugmentation](DataStructureAugmentation.md)
+- [Linked Lists](LinkedLists.md)
+- [Data Structure Augmentation](DataStructureAugmentation.md)
- [Amortization](Amortization.md)
L4:
- [Hashing](Hashing.md)
-- [OpenAddressing](OpenAddressing.md)
+- [Open Addressing](OpenAddressing.md)
L5 (non-comparative sorting):
-- [CountSort](CountSort.md)
+- [Count Sort](CountSort.md)
L6:
-- [BinaryTree](BinaryTree.md)
+- [Binary Tree](BinaryTree.md)
#### Intro To Algorithms Textbook (CLRS)
2.1
-- [InsertionSort](InsertionSort.md)
-- [LoopInvariant](LoopInvariant.md)
+- [Insertion Sort](InsertionSort.md)
+- [Loop Invariant](LoopInvariant.md)
2.3
- [Incremental](Incremental.md)
-- [DivideAndConquer](DivideAndConquer.md)
-- [MergeSort](MergeSort.md)
+- [Divide And Conquer](DivideAndConquer.md)
+- [Merge Sort](MergeSort.md)
3.2
-- [AsymptoticNotation](AsymptoticNotation.md)
+- [Asymptotic Notation](AsymptoticNotation.md)
- [Trichotomy](Trichotomy.md)
-- [MonotonicFunction](MonotonicFunction.md)
+- [Monotonic Function](MonotonicFunction.md)
#### Other algorithms adjacent stuff
-- [BekensteinBound](BekensteinBound.md)
-- [OracleComputer](OracleComputer.md)
+- [Bekenstein Bound](BekensteinBound.md)
+- [Oracle Computer](OracleComputer.md)
- [Invariance](Invariance.md)
diff --git a/docs/Assembly.md b/docs/Assembly.md
@@ -6,12 +6,12 @@ Main Links For Assembly Language
Assembly Language CS 224
-- [TwosComplement](TwosComplement.md)
-- [IntegerOverflow](IntegerOverflow.md)
-- [ZeroExtension](ZeroExtension.md)
-- [SignedExtension](SignedExtension.md)
+- [Twos Complement](TwosComplement.md)
+- [Integer Overflow](IntegerOverflow.md)
+- [Zero Extension](ZeroExtension.md)
+- [Signed Extension](SignedExtension.md)
- [Word](Word.md)
-- [HalfWord](HalfWord.md)
+- [Half Word](HalfWord.md)
- [Unicode](Unicode.md)
- [Ascii](Ascii.md)
- [String](String.md)
diff --git a/docs/CPP.md b/docs/CPP.md
@@ -6,8 +6,8 @@ This index tracks c++ related concepts.
### Memory Management
-- [UniquePointers](UniquePointers.md)
-- [SharedPointers](SharedPointers.md)
+- [Unique Pointers](UniquePointers.md)
+- [Shared Pointers](SharedPointers.md)
### STL
diff --git a/docs/CS202.md b/docs/CS202.md
@@ -4,18 +4,18 @@ This is the index for my cs 202 notes.
## Main Links
-- [LinkedLists](LinkedLists.md)
-- [MemoryManagement](MemoryManagement.md)
-- [AbstractDataType](AbstractDataType.md)
+- [Linked Lists](LinkedLists.md)
+- [Memory Management](MemoryManagement.md)
+- [Abstract Data Type](AbstractDataType.md)
- [Stack](Stack.md)
- [Queue](Queue.md)
- [Tree](Tree.md)
-- [BinaryTree](BinaryTree.md)
-- [DepthFirstSearch](DepthFirstSearch.md)
-- [BreadthFirstSearch](BreadthFirstSearch.md)
+- [Binary Tree](BinaryTree.md)
+- [Depth First Search](DepthFirstSearch.md)
+- [Breadth First Search](BreadthFirstSearch.md)
- [Rvalue](Rvalue.md)
- [Lvalue](Lvalue.md)
-- [SentinelValue](SentinelValue.md)
-- [CanaryValue](CanaryValue.md)
-- [TwosComplement](TwosComplement.md)
-- [OnesComplement](OnesComplement.md)
+- [Sentinel Value](SentinelValue.md)
+- [Canary Value](CanaryValue.md)
+- [Twos Complement](TwosComplement.md)
+- [Ones Complement](OnesComplement.md)
diff --git a/docs/CS331.md b/docs/CS331.md
@@ -6,7 +6,7 @@ This is the index for my CS 331 notes.
- [Unity](Unity.md)
- [Blender](Blender.md)
-- [MathConceptsCS331](MathConceptsCS331.md)
+- [Math Concepts CS331](MathConceptsCS331.md)
- [IPD](IPD.md)
FINAL EXAM:
diff --git a/docs/CharacteristicRoots.md b/docs/CharacteristicRoots.md
@@ -4,4 +4,4 @@ Ch 8.2
## Notes
-**Definition:** A characteristic root in discrete math are values that satisfy a [CharacteristicEquation](CharacteristicEquation.md).
+**Definition:** A characteristic root in discrete math are values that satisfy a [Characteristic Equation](CharacteristicEquation.md).
diff --git a/docs/ComputerArchitecture.md b/docs/ComputerArchitecture.md
@@ -10,35 +10,35 @@ Links to information learned from computer architecture course
## Main Links
-- [HistoricalDesigns](HistoricalDesigns.md)
+- [Historical Designs](HistoricalDesigns.md)
- [Abstraction](Abstraction.md)
- [Memory](Memory.md)
- [Scheduling](Scheduling.md)
- [Algorithm](Algorithm.md)
- [ISA](ISA.md)
-- [OutOfOrderExecution](OutOfOrderExecution.md)
-- [SuperScalar](SuperScalar.md)
-- [MooresLaw](MooresLaw.md)
-- [ForwardThoughts](ForwardThoughts.md)
-- [DesignPoint](DesignPoint.md)
-- [DRAMRowHammer](DRAMRowHammer.md)
-- [VonNeumannModel](VonNeumannModel.md)
-- [BarrierSynchronization](BarrierSynchronization.md)
-- [MicroArchitecture](MicroArchitecture.md)
+- [Out Of Order Execution](OutOfOrderExecution.md)
+- [Super Scalar](SuperScalar.md)
+- [Moores Law](MooresLaw.md)
+- [Forward Thoughts](ForwardThoughts.md)
+- [Design Point](DesignPoint.md)
+- [DRAMRow Hammer](DRAMRowHammer.md)
+- [Von Neumann Model](VonNeumannModel.md)
+- [Barrier Synchronization](BarrierSynchronization.md)
+- [Micro Architecture](MicroArchitecture.md)
- [Instruction](Instruction.md)
- [Opcode](Opcode.md)
-- [BitSteering](BitSteering.md)
+- [Bit Steering](BitSteering.md)
- [BCD](BCD.md)
-- [ProgrammerVisibleState](ProgrammerVisibleState.md)
+- [Programmer Visible State](ProgrammerVisibleState.md)
- [MUX](MUX.md)
To do:
- [Hamming](Hamming.md)
-- [PipelineControl](PipelineControl.md)
-- [CircuitTechnology](CircuitTechnology.md)
+- [Pipeline Control](PipelineControl.md)
+- [Circuit Technology](CircuitTechnology.md)
- [VLIW](VLIW.md)
- [SRAM](SRAM.md)
- [Adder](Adder.md)
- [Cache](Cache.md)
-- [CriticalPath](CriticalPath.md)
+- [Critical Path](CriticalPath.md)
diff --git a/docs/ComputerScience.md b/docs/ComputerScience.md
@@ -12,8 +12,8 @@ This is the index for my Computer Science related notes.
- [Algorithms](Algorithms.md)
- [Assembly](Assembly.md)
-- [ComputerSecurity](ComputerSecurity.md)
-- [TheoryOfComputation](TheoryOfComputation.md)
-- [ComputerArchitecture](ComputerArchitecture.md)
-- [LinuxStuff](LinuxStuff.md)
+- [Computer Security](ComputerSecurity.md)
+- [Theory Of Computation](TheoryOfComputation.md)
+- [Computer Architecture](ComputerArchitecture.md)
+- [Linux Stuff](LinuxStuff.md)
- [CPP](CPP.md)
diff --git a/docs/ComputerSecurity.md b/docs/ComputerSecurity.md
@@ -9,13 +9,13 @@ Main index for notes related to CSCI 370, Computer Security
##### 1.1 - Cyber, info, network sec
- [Cybersecurity](Cybersecurity.md)
-- [InformationSecurity](InformationSecurity.md)
-- [NetworkSecurity](NetworkSecurity.md)
+- [Information Security](InformationSecurity.md)
+- [Network Security](NetworkSecurity.md)
- Three key objectives
- [Confidentiality](Confidentiality.md)
- [Integrity](Integrity.md)
- [Availability](Availability.md)
-- [NonRepudation](NonRepudation.md)
+- [Non Repudation](NonRepudation.md)
##### 1.2 - OSI Security Architecture
@@ -23,13 +23,13 @@ Main index for notes related to CSCI 370, Computer Security
##### 1.3 - Security Attacks
-- [PassiveAttacks](PassiveAttacks.md)
-- [ActiveAttacks](ActiveAttacks.md)
+- [Passive Attacks](PassiveAttacks.md)
+- [Active Attacks](ActiveAttacks.md)
##### 1.4 - Security Services (ways to support requirements of CIA triad)
- [Authentication](Authentication.md)
-- [NonRepudation](NonRepudation.md)
+- [Non Repudation](NonRepudation.md)
- [Integrity](Integrity.md)
- [Availability](Availability.md)
@@ -41,9 +41,9 @@ Main index for notes related to CSCI 370, Computer Security
- [Cryptography](Cryptography.md)
- [Keyless](Keyless.md)
-- [SingleKey](SingleKey.md)
-- [TwoKey](TwoKey.md)
-- [DigitalSignature](DigitalSignature.md)
+- [Single Key](SingleKey.md)
+- [Two Key](TwoKey.md)
+- [Digital Signature](DigitalSignature.md)
##### 1.8 - Trust
@@ -53,25 +53,25 @@ Main index for notes related to CSCI 370, Computer Security
##### 2.1 - Divisibility and The Division Algorithm
-- [DivisionRules](DivisionRules.md)
-- [DivisionAlgorithm](DivisionAlgorithm.md)
-- [RelativelyPrime](RelativelyPrime.md)
+- [Division Rules](DivisionRules.md)
+- [Division Algorithm](DivisionAlgorithm.md)
+- [Relatively Prime](RelativelyPrime.md)
##### 2.2 - The Euclidean Algorithm
-- [EuclideanAlgorithm](EuclideanAlgorithm.md)
+- [Euclidean Algorithm](EuclideanAlgorithm.md)
- [GCD](GCD.md)
##### 2.5 - Fermat's and Euler's Theorems
-- [FermatsTheorem](FermatsTheorem.md)
-- [EulersTotientFunction](EulersTotientFunction.md)
-- [EulersTheorem](EulersTheorem.md)
+- [Fermats Theorem](FermatsTheorem.md)
+- [Eulers Totient Function](EulersTotientFunction.md)
+- [Eulers Theorem](EulersTheorem.md)
##### 2.6 - Primality Tests
-- [MillerRabinAlgorithm](MillerRabinAlgorithm.md)
+- [Miller Rabin Algorithm](MillerRabinAlgorithm.md)
##### 2.7 - Chinese Remainder Theorem
-- [ChineseRemainderTheorem](ChineseRemainderTheorem.md)
+- [Chinese Remainder Theorem](ChineseRemainderTheorem.md)
diff --git a/docs/DeepLearning.md b/docs/DeepLearning.md
@@ -12,13 +12,13 @@ This index tracks deep learning-related content. While much of my deep learning
Chapter 1
-- [KnowledgeBaseApproach](KnowledgeBaseApproach.md)
-- [PolarCoordinates](PolarCoordinates.md)
-- [RepresentationLearning](RepresentationLearning.md)
-- [FactorsOfVariation](FactorsOfVariation.md)
-- [ComputationalGraph](ComputationalGraph.md)
-- [ProbabilisticGraph](ProbabilisticGraph.md)
-- [DistributedRepresentation](DistributedRepresentation.md)
+- [Knowledge Base Approach](KnowledgeBaseApproach.md)
+- [Polar Coordinates](PolarCoordinates.md)
+- [Representation Learning](RepresentationLearning.md)
+- [Factors Of Variation](FactorsOfVariation.md)
+- [Computational Graph](ComputationalGraph.md)
+- [Probabilistic Graph](ProbabilisticGraph.md)
+- [Distributed Representation](DistributedRepresentation.md)
Chapter 2
@@ -30,8 +30,8 @@ Chapter 2
- [Norm](Norm.md)
- [L1Norm](L1Norm.md)
- [L2Norm](L2Norm.md)
-- [MaxNorm](MaxNorm.md)
-- [FrobeniusNorm](FrobeniusNorm.md)
+- [Max Norm](MaxNorm.md)
+- [Frobenius Norm](FrobeniusNorm.md)
- Orthonormal
- OrthogonalMatrix
- EigenDecomposition
diff --git a/docs/DiscreteMath.md b/docs/DiscreteMath.md
@@ -83,7 +83,7 @@ Unit 2.3 (functions)
Unit 2.4 (sequence + other stuff)
- [Sequence](Sequence.md)
-- [RecurrenceRelation](RecurrenceRelation.md)
+- [Recurrence Relation](RecurrenceRelation.md)
Unit 2.3 (computation 5th edition)
@@ -96,45 +96,45 @@ Unit 2.3 (computation 5th edition)
Unit 2.4 (integers and division)
-- [NumberTheory](NumberTheory.md)
-- [CompositeNumber](CompositeNumber.md)
-- [PrimeNumber](PrimeNumber.md)
-- [MersennePrime](MersennePrime.md)
+- [Number Theory](NumberTheory.md)
+- [Composite Number](CompositeNumber.md)
+- [Prime Number](PrimeNumber.md)
+- [Mersenne Prime](MersennePrime.md)
- [Div](Div.md)
- [Mod](Mod.md)
-- [RelativelyPrime](RelativelyPrime.md)
-- [PairwiseRelativelyPrime](PairwiseRelativelyPrime.md)
-- [PrimeFactorization](PrimeFactorization.md)
+- [Relatively Prime](RelativelyPrime.md)
+- [Pairwise Relatively Prime](PairwiseRelativelyPrime.md)
+- [Prime Factorization](PrimeFactorization.md)
- [GCD](GCD.md)
- [LCM](LCM.md)
- [Congruence](Congruence.md)
-- [CongruenceClass](CongruenceClass.md)
-- [CaesarCipher](CaesarCipher.md)
-- [VigenereCipher](VigenereCipher.md)
-- [EuclideanAlgorithm](EuclideanAlgorithm.md)
-- [LinearCombination](LinearCombination.md)
-- [LinearCongruence](LinearCongruence.md)
+- [Congruence Class](CongruenceClass.md)
+- [Caesar Cipher](CaesarCipher.md)
+- [Vigenere Cipher](VigenereCipher.md)
+- [Euclidean Algorithm](EuclideanAlgorithm.md)
+- [Linear Combination](LinearCombination.md)
+- [Linear Congruence](LinearCongruence.md)
Unit 2.4 (Sequences and Summations 8th edition)
-- [RecurrenceRelation](RecurrenceRelation.md)
+- [Recurrence Relation](RecurrenceRelation.md)
Unit 6.1 (The Basics of Counting 8th edition)
- [Combinatorics](Combinatorics.md)
-- [SumRule](SumRule.md)
-- [TreeDiagram](TreeDiagram.md)
-- [SubtractionRule](SubtractionRule.md)
-- [DivisionRule](DivisionRule.md)
-- [SumOfGeometricSeries](SumOfGeometricSeries.md)
-- [CountingPrinciple](CountingPrinciple.md)
+- [Sum Rule](SumRule.md)
+- [Tree Diagram](TreeDiagram.md)
+- [Subtraction Rule](SubtractionRule.md)
+- [Division Rule](DivisionRule.md)
+- [Sum Of Geometric Series](SumOfGeometricSeries.md)
+- [Counting Principle](CountingPrinciple.md)
Unit 6.2 (Pigeonhole principle)
-- [PigeonholePrinciple](PigeonholePrinciple.md)
-- [GeneralizedPigeonholePrinciple](GeneralizedPigeonholePrinciple.md)
+- [Pigeonhole Principle](PigeonholePrinciple.md)
+- [Generalized Pigeonhole Principle](GeneralizedPigeonholePrinciple.md)
- [Subsequence](Subsequence.md)
-- [RamseyNumbers](RamseyNumbers.md)
+- [Ramsey Numbers](RamseyNumbers.md)
Unit 6.3 (Permutations and Combinations)
@@ -142,14 +142,14 @@ Unit 6.3 (Permutations and Combinations)
- [RPermutation](RPermutation.md)
- [Combination](Combination.md)
- [RCombination](RCombination.md)
-- [CombinatorialProof](CombinatorialProof.md)
-- [BijectiveProof](BijectiveProof.md)
+- [Combinatorial Proof](CombinatorialProof.md)
+- [Bijective Proof](BijectiveProof.md)
Unit 6.4 (Binomial Coefficient & Identities)
-- [BinomialCoefficient](BinomialCoefficient.md)
-- [PascalsIdentity](PascalsIdentity.md)
-- [VandermondesIdentity](VandermondesIdentity.md)
+- [Binomial Coefficient](BinomialCoefficient.md)
+- [Pascals Identity](PascalsIdentity.md)
+- [Vandermondes Identity](VandermondesIdentity.md)
- [Binomial](Binomial.md)
Unit 6.5 (Generalized Permutations & Combinations)
@@ -159,24 +159,24 @@ Unit 6.5 (Generalized Permutations & Combinations)
Unit 8.2 (Solving Linear Recurrence Relations)
-- [RecurrenceRelation](RecurrenceRelation.md)
-- [LinearCombination](LinearCombination.md)
-- [LinearHomogeneousRecurrenceRelation](LinearHomogeneousRecurrenceRelation.md)
-- [CharacteristicEquation](CharacteristicEquation.md)
-- [CharacteristicRoots](CharacteristicRoots.md)
+- [Recurrence Relation](RecurrenceRelation.md)
+- [Linear Combination](LinearCombination.md)
+- [Linear Homogeneous Recurrence Relation](LinearHomogeneousRecurrenceRelation.md)
+- [Characteristic Equation](CharacteristicEquation.md)
+- [Characteristic Roots](CharacteristicRoots.md)
Unit 8.3 (Divide and Conquer)
-- [DivideAndConquer](DivideAndConquer.md)
+- [Divide And Conquer](DivideAndConquer.md)
Unit 8.5 (Inclusion Exclusion)
-- [PrincipleOfInclusionExclusion](PrincipleOfInclusionExclusion.md)
+- [Principle Of Inclusion Exclusion](PrincipleOfInclusionExclusion.md)
Unit 9.1 (Relations)
- [Relation](Relation.md) (define like function)
-- [RelationOnASet](RelationOnASet.md)
+- [Relation On ASet](RelationOnASet.md)
- [Reflexive](Reflexive.md)
- [Symmetric](Symmetric.md)
- [Antisymmetric](Antisymmetric.md)
@@ -184,37 +184,37 @@ Unit 9.1 (Relations)
Unit 9.3 (Representing Relations)
-- [ZeroOneMatrix](ZeroOneMatrix.md)
+- [Zero One Matrix](ZeroOneMatrix.md)
- [Digraph](Digraph.md)
- [Loop](Loop.md)
Unit 9.4 (Closures of Relations)
-- [TransitiveClosure](TransitiveClosure.md)
-- [ReflexiveClosure](ReflexiveClosure.md)
-- [SymmetricClosure](SymmetricClosure.md)
+- [Transitive Closure](TransitiveClosure.md)
+- [Reflexive Closure](ReflexiveClosure.md)
+- [Symmetric Closure](SymmetricClosure.md)
- [Closure](Closure.md)
Unit 9.5 (Equivalence Relations)
-- [EquivalenceRelation](EquivalenceRelation.md)
-- [EquivalenceClass](EquivalenceClass.md) ([a] notation)
+- [Equivalence Relation](EquivalenceRelation.md)
+- [Equivalence Class](EquivalenceClass.md) ([a] notation)
- [Representative](Representative.md)
- [Partition](Partition.md)
Unit 9.6 (Partial Orderings)
-- [PartiallyOrderedSet](PartiallyOrderedSet.md)
-- [HasseDiagram](HasseDiagram.md)
-- [LexicographicOrdering](LexicographicOrdering.md)
+- [Partially Ordered Set](PartiallyOrderedSet.md)
+- [Hasse Diagram](HasseDiagram.md)
+- [Lexicographic Ordering](LexicographicOrdering.md)
Unit 10.1 (Graphs)
- [Graphs](Graphs.md)
- [Multigraph](Multigraph.md)
- [Loop](Loop.md)
-- [PseudoGraphs](PseudoGraphs.md)
-- [MixedGraph](MixedGraph.md)
+- [Pseudo Graphs](PseudoGraphs.md)
+- [Mixed Graph](MixedGraph.md)
Unit 10.2 (Graph Terms)
@@ -222,4 +222,4 @@ Unit 10.2 (Graph Terms)
Unit 10.3 (Representing Graphs and Isomorphisms)
-- [AdjacencyMatrix](AdjacencyMatrix.md) (for dense)
+- [Adjacency Matrix](AdjacencyMatrix.md) (for dense)
diff --git a/docs/DynamicProgramming.md b/docs/DynamicProgramming.md
@@ -8,5 +8,5 @@ L3
There are two necessary conditions for a problem to be solvable via DP:
-1. [OptimalSubstructure](OptimalSubstructure.md)
-2. [OverlappingSubproblems](OverlappingSubproblems.md)
+1. [Optimal Substructure](OptimalSubstructure.md)
+2. [Overlapping Subproblems](OverlappingSubproblems.md)
diff --git a/docs/InsertionSort.md b/docs/InsertionSort.md
@@ -31,7 +31,7 @@ def insertion_sort(ls):
return ls
def move_and_offset(posFrom, posTo, ls):
- last = ls[posFrom]
+ last = ls[pos From]
i = posTo
while i < posFrom + 1:
temp = ls[i]
diff --git a/docs/LinearAlgebra.md b/docs/LinearAlgebra.md
@@ -10,29 +10,29 @@ Linear Algebra Done Right:
Chapter 1:
-- [VectorSpace](VectorSpace.md)
+- [Vector Space](VectorSpace.md)
- [Tuple](Tuple.md)
-- [ComplexVectorSpace](ComplexVectorSpace.md)
+- [Complex Vector Space](ComplexVectorSpace.md)
- [Subspace](Subspace.md)
- [RealVectorSpace.md](RealVectorSpace.md)
- [Coordinate](Coordinate.md)
-- [SumOfVectorSpaces](SumOfVectorSpaces.md)
-- [DirectSum](DirectSum.md)
+- [Sum Of Vector Spaces](SumOfVectorSpaces.md)
+- [Direct Sum](DirectSum.md)
Chapter 2:
-- [LinearCombination](LinearCombination.md)
+- [Linear Combination](LinearCombination.md)
- [Span](Span.md)
-- [FiniteDimensional](FiniteDimensional.md)
-- [LinearIndependence](LinearIndependence.md)
-- [BasisOfSubspace](BasisOfSubspace.md)
-- [StandardBasis](StandardBasis.md)
+- [Finite Dimensional](FiniteDimensional.md)
+- [Linear Independence](LinearIndependence.md)
+- [Basis Of Subspace](BasisOfSubspace.md)
+- [Standard Basis](StandardBasis.md)
- [Dimensions](Dimensions.md)
Chapter 3:
-- [LinearMaps](LinearMaps.md)
-- [NullSpace](NullSpace.md)
+- [Linear Maps](LinearMaps.md)
+- [Null Space](NullSpace.md)
- [Range](Range.md)
- [Invertible](Invertible.md)
- [Isomorphic](Isomorphic.md)
@@ -41,25 +41,25 @@ Gilbert Strang Lectures:
Lecture 2:
-- [GaussianElimination](GaussianElimination.md)
-- [PermutationMatrix](PermutationMatrix.md)
-- [InverseMatrix](InverseMatrix.md)
+- [Gaussian Elimination](GaussianElimination.md)
+- [Permutation Matrix](PermutationMatrix.md)
+- [Inverse Matrix](InverseMatrix.md)
Lecture 3:
-- [MatrixMultiplication](MatrixMultiplication.md)
+- [Matrix Multiplication](MatrixMultiplication.md)
- [Singular](Singular.md)
- [Invertible](Invertible.md)
-- [InverseMatrix](InverseMatrix.md)
+- [Inverse Matrix](InverseMatrix.md)
- [Determinant](Determinant.md)
-- [GaussianElimination](GaussianElimination.md)
+- [Gaussian Elimination](GaussianElimination.md)
Lecture 4:
- [Transpose](Transpose.md)
-- [InverseMatrix](InverseMatrix.md)
+- [Inverse Matrix](InverseMatrix.md)
- [LUDecomposition](LUDecomposition.md)
-- [PermutationMatrix](PermutationMatrix.md)
+- [Permutation Matrix](PermutationMatrix.md)
Lecture 5:
@@ -70,33 +70,33 @@ Khan Academy:
Khan Unit 1 (mostly):
- [Matrix](Matrix.md)
-- [LinearEquations](LinearEquations.md)
-- [SystemsOfEquations](SystemsOfEquations.md)
-- [LinearCombination](LinearCombination.md)
-- [ColumnSpace](ColumnSpace.md)
-- [DistanceCalculation](DistanceCalculation.md)
-- [DotProduct](DotProduct.md)
-- [VectorMatrixMultipication](VectorMatrixMultipication.md)
+- [Linear Equations](LinearEquations.md)
+- [Systems Of Equations](SystemsOfEquations.md)
+- [Linear Combination](LinearCombination.md)
+- [Column Space](ColumnSpace.md)
+- [Distance Calculation](DistanceCalculation.md)
+- [Dot Product](DotProduct.md)
+- [Vector Matrix Multipication](VectorMatrixMultipication.md)
- [Invertible](Invertible.md)
-- [UnitVector](UnitVector.md)
+- [Unit Vector](UnitVector.md)
- [Span](Span.md)
-- [LinearIndependence](LinearIndependence.md)
-- [LinearSubspace](LinearSubspace.md)
+- [Linear Independence](LinearIndependence.md)
+- [Linear Subspace](LinearSubspace.md)
- [Closure](Closure.md)
-- [BasisOfSubspace](BasisOfSubspace.md)
-- [AngleBetweenVectors](AngleBetweenVectors.md)
-- [LawOfCosines](LawOfCosines.md)
-- [EquationOfAPlane](EquationOfAPlane.md)
-- [CrossProduct](CrossProduct.md)
+- [Basis Of Subspace](BasisOfSubspace.md)
+- [Angle Between Vectors](AngleBetweenVectors.md)
+- [Law Of Cosines](LawOfCosines.md)
+- [Equation Of APlane](EquationOfAPlane.md)
+- [Cross Product](CrossProduct.md)
- [Arcsin](Arcsin.md)
- [Arccos](Arccos.md)
-- [TripleProductExpansion](TripleProductExpansion.md)
-- [NormalVector](NormalVector.md)
-- [DistanceToPlane](DistanceToPlane.md)
-- [PlaneToPlaneDistance](PlaneToPlaneDistance.md)
-- [ReducedRowEchelonForm](ReducedRowEchelonForm.md)
+- [Triple Product Expansion](TripleProductExpansion.md)
+- [Normal Vector](NormalVector.md)
+- [Distance To Plane](DistanceToPlane.md)
+- [Plane To Plane Distance](PlaneToPlaneDistance.md)
+- [Reduced Row Echelon Form](ReducedRowEchelonForm.md)
- [Transpose](Transpose.md)
-- [NullSpace](NullSpace.md)
+- [Null Space](NullSpace.md)
- [Nullity](Nullity.md)
- [Rank](Rank.md)
@@ -105,41 +105,41 @@ Khan Unit 2:
- [Codomain](Codomain.md)
- [Range](Range.md)
- [Transformations](Transformations.md)
-- [LinearTransformation](LinearTransformation.md)
-- [IdentityMatrix](IdentityMatrix.md)
+- [Linear Transformation](LinearTransformation.md)
+- [Identity Matrix](IdentityMatrix.md)
- [Image](Image.md)
- [Preimage](Preimage.md)
- [Kernel](Kernel.md)
-- [DiagonalMatrices](DiagonalMatrices.md)
+- [Diagonal Matrices](DiagonalMatrices.md)
- [Rotation](Rotation.md)
-- [StandardMatrix](StandardMatrix.md)
-- [UnitVector](UnitVector.md)
+- [Standard Matrix](StandardMatrix.md)
+- [Unit Vector](UnitVector.md)
- [Projection](Projection.md)
-- [MatrixMultiplication](MatrixMultiplication.md)
-- [InverseTransformation](InverseTransformation.md)
+- [Matrix Multiplication](MatrixMultiplication.md)
+- [Inverse Transformation](InverseTransformation.md)
- [Surjective](Surjective.md)
- [Injective](Injective.md)
- [Bijective](Bijective.md)
- [Homogeneous](Homogeneous.md)
- [Inhomogeneous](Inhomogeneous.md)
- [Determinant](Determinant.md)
-- [RuleOfSarrus](RuleOfSarrus.md)
+- [Rule Of Sarrus](RuleOfSarrus.md)
- [Hypervolume](Hypervolume.md)
- [Hyperplane](Hyperplane.md)
-- [AmbientSpace](AmbientSpace.md)
+- [Ambient Space](AmbientSpace.md)
- [Shear](Shear.md)
-- [RightHandRule](RightHandRule.md)
+- [Right Hand Rule](RightHandRule.md)
- [Duality](Duality.md)
-- [CramersRule](CramersRule.md)
-- [GaussianElimination](GaussianElimination.md)
-- [EigenVector](EigenVector.md)
+- [Cramers Rule](CramersRule.md)
+- [Gaussian Elimination](GaussianElimination.md)
+- [Eigen Vector](EigenVector.md)
- [Transpose](Transpose.md)
Khan Unit 3:
-- [OrthogonalComplement](OrthogonalComplement.md)
+- [Orthogonal Complement](OrthogonalComplement.md)
- [Projection](Projection.md)
-- [ChangeOfBasis](ChangeOfBasis.md)
+- [Change Of Basis](ChangeOfBasis.md)
- [Orthonormal](Orthonormal.md)
-- [GramSchmidtProcess](GramSchmidtProcess.md)
-- [EigenVector](EigenVector.md)
+- [Gram Schmidt Process](GramSchmidtProcess.md)
+- [Eigen Vector](EigenVector.md)
diff --git a/docs/MachineLearning.md b/docs/MachineLearning.md
@@ -30,155 +30,155 @@ Links to ML Notes
#### Ch 2.2
-- [MatrixMultiplication](MatrixMultiplication.md)
-- [HadamardProduct](HadamardProduct.md)
-- [IdentityMatrix](IdentityMatrix.md)
+- [Matrix Multiplication](MatrixMultiplication.md)
+- [Hadamard Product](HadamardProduct.md)
+- [Identity Matrix](IdentityMatrix.md)
- [Associative](Associative.md)
- [Distributive](Distributive.md)
- [Commutative](Commutative.md)
-- [InverseTransformation](InverseTransformation.md)
+- [Inverse Transformation](InverseTransformation.md)
- [Transpose](Transpose.md)
-- [SymmetricMatrix](SymmetricMatrix.md)
-- [LinearCombination](LinearCombination.md)
-- [ParticularSolution](ParticularSolution.md)
-- [GeneralSolution](GeneralSolution.md)
-- [ElementaryTransformations](ElementaryTransformations.md)
-- [RowEchelonForm](RowEchelonForm.md)
-- [BasicVariables](BasicVariables.md)
-- [FreeVariables](FreeVariables.md)
-- [ReducedRowEchelonForm](ReducedRowEchelonForm.md)
-- [GaussianElimination](GaussianElimination.md)
-- [MinusOneTrick](MinusOneTrick.md)
+- [Symmetric Matrix](SymmetricMatrix.md)
+- [Linear Combination](LinearCombination.md)
+- [Particular Solution](ParticularSolution.md)
+- [General Solution](GeneralSolution.md)
+- [Elementary Transformations](ElementaryTransformations.md)
+- [Row Echelon Form](RowEchelonForm.md)
+- [Basic Variables](BasicVariables.md)
+- [Free Variables](FreeVariables.md)
+- [Reduced Row Echelon Form](ReducedRowEchelonForm.md)
+- [Gaussian Elimination](GaussianElimination.md)
+- [Minus One Trick](MinusOneTrick.md)
## ML Categories
-- [SupervisedLearning](SupervisedLearning.md)
-- [SemiSupervisedLearning](SemiSupervisedLearning.md)
-- [SelfSupervisedLearning](SelfSupervisedLearning.md)
-- [UnsupervisedLearning](UnsupervisedLearning.md)
-- [ReinforcementLearning](ReinforcementLearning.md)
-- [InstanceBasedLearning](InstanceBasedLearning.md)
-- [ModelBasedLearning](ModelBasedLearning.md)
+- [Supervised Learning](SupervisedLearning.md)
+- [Semi Supervised Learning](SemiSupervisedLearning.md)
+- [Self Supervised Learning](SelfSupervisedLearning.md)
+- [Unsupervised Learning](UnsupervisedLearning.md)
+- [Reinforcement Learning](ReinforcementLearning.md)
+- [Instance Based Learning](InstanceBasedLearning.md)
+- [Model Based Learning](ModelBasedLearning.md)
## Concepts
- [AISafety](AISafety.md)
-- [RegressionProblem](RegressionProblem.md)
-- [TransferLearning](TransferLearning.md)
-- [VisualizationAlgorithm](VisualizationAlgorithm.md)
-- [DimensionalityReduction](DimensionalityReduction.md)
-- [AnomalyDetection](AnomalyDetection.md)
-- [NoveltyDetection](NoveltyDetection.md)
-- [RuleLearning](RuleLearning.md)
-- [LinearRegression](LinearRegression.md)
-- [GradientDescent](GradientDescent.md)
-- [ClassificationProblem](ClassificationProblem.md)
-- [SupportVectorMachine](SupportVectorMachine.md)
-- [ClusteringAlgorithms](ClusteringAlgorithms.md)
-- [EigenVector](EigenVector.md)
+- [Regression Problem](RegressionProblem.md)
+- [Transfer Learning](TransferLearning.md)
+- [Visualization Algorithm](VisualizationAlgorithm.md)
+- [Dimensionality Reduction](DimensionalityReduction.md)
+- [Anomaly Detection](AnomalyDetection.md)
+- [Novelty Detection](NoveltyDetection.md)
+- [Rule Learning](RuleLearning.md)
+- [Linear Regression](LinearRegression.md)
+- [Gradient Descent](GradientDescent.md)
+- [Classification Problem](ClassificationProblem.md)
+- [Support Vector Machine](SupportVectorMachine.md)
+- [Clustering Algorithms](ClusteringAlgorithms.md)
+- [Eigen Vector](EigenVector.md)
- [NLP](NLP.md)
- [NLU](NLU.md)
- [Feature](Feature.md)
-- [OfflineLearning](OfflineLearning.md)
-- [OnlineLearning](OnlineLearning.md)
-- [KNearestNeighbor](KNearestNeighbor.md)
+- [Offline Learning](OfflineLearning.md)
+- [Online Learning](OnlineLearning.md)
+- [KNearest Neighbor](KNearestNeighbor.md)
- [Overfitting](Overfitting.md)
- [Underfitting](Underfitting.md)
-- [GeneralizationError](GeneralizationError.md)
+- [Generalization Error](GeneralizationError.md)
- [RMSE](RMSE.md)
- [MAE](MAE.md)
-- [StratifiedSampling](StratifiedSampling.md)
-- [CorrelationCoefficient](CorrelationCoefficient.md)
-- [LogisticRegression](LogisticRegression.md)
+- [Stratified Sampling](StratifiedSampling.md)
+- [Correlation Coefficient](CorrelationCoefficient.md)
+- [Logistic Regression](LogisticRegression.md)
- [Imputation](Imputation.md)
-- [OneHotEncoding](OneHotEncoding.md)
-- [LabelEncoding](LabelEncoding.md)
-- [TargetEncoding](TargetEncoding.md)
+- [One Hot Encoding](OneHotEncoding.md)
+- [Label Encoding](LabelEncoding.md)
+- [Target Encoding](TargetEncoding.md)
- [Hyperparameter](Hyperparameter.md)
-- [FeatureScaling](FeatureScaling.md)
+- [Feature Scaling](FeatureScaling.md)
- [Standardization](Standardization.md)
-- [MinMaxScaling](MinMaxScaling.md)
-- [OrdinaryLeastSquares](OrdinaryLeastSquares.md)
-- [RadialBasisFunction](RadialBasisFunction.md)
+- [Min Max Scaling](MinMaxScaling.md)
+- [Ordinary Least Squares](OrdinaryLeastSquares.md)
+- [Radial Basis Function](RadialBasisFunction.md)
- [KMeans](KMeans.md)
-- [StochasticAlgorithm](StochasticAlgorithm.md)
+- [Stochastic Algorithm](StochasticAlgorithm.md)
- [Ensembles](Ensembles.md)
-- [ConfusionMatrix](ConfusionMatrix.md)
-- [CrossValidation](CrossValidation.md)
+- [Confusion Matrix](ConfusionMatrix.md)
+- [Cross Validation](CrossValidation.md)
- [Precision](Precision.md)
-- [TruePositiveRate](TruePositiveRate.md)
-- [HarmonicMean](HarmonicMean.md)
+- [True Positive Rate](TruePositiveRate.md)
+- [Harmonic Mean](HarmonicMean.md)
- [Accuracy](Accuracy.md)
-- [DecisionThreshold](DecisionThreshold.md)
+- [Decision Threshold](DecisionThreshold.md)
- [ROC](ROC.md)
-- [MulticlassClassifier](MulticlassClassifier.md)
-- [OneVersusAll](OneVersusAll.md)
-- [OneVersusOne](OneVersusOne.md)
-- [MultilabelClassification](MultilabelClassification.md)
-- [MultioutputClassification](MultioutputClassification.md)
-- [PartialDerivative](PartialDerivative.md)
-- [RidgeRegression](RidgeRegression.md)
-- [LassoRegression](LassoRegression.md)
-- [ElasticNetRegression](ElasticNetRegression.md)
-- [EarlyStopping](EarlyStopping.md)
-- [SoftmaxRegression](SoftmaxRegression.md)
+- [Multiclass Classifier](MulticlassClassifier.md)
+- [One Versus All](OneVersusAll.md)
+- [One Versus One](OneVersusOne.md)
+- [Multilabel Classification](MultilabelClassification.md)
+- [Multioutput Classification](MultioutputClassification.md)
+- [Partial Derivative](PartialDerivative.md)
+- [Ridge Regression](RidgeRegression.md)
+- [Lasso Regression](LassoRegression.md)
+- [Elastic Net Regression](ElasticNetRegression.md)
+- [Early Stopping](EarlyStopping.md)
+- [Softmax Regression](SoftmaxRegression.md)
- [SVM](SVM.md)
-- [DecisionTrees](DecisionTrees.md)
-- [SimilarityFeature](SimilarityFeature.md)
+- [Decision Trees](DecisionTrees.md)
+- [Similarity Feature](SimilarityFeature.md)
- [CART](CART.md)
-- [RandomForest](RandomForest.md)
-- [VotingClassifiers](VotingClassifiers.md)
+- [Random Forest](RandomForest.md)
+- [Voting Classifiers](VotingClassifiers.md)
- [Bagging](Bagging.md)
- [Pasting](Pasting.md)
- [Bias](Bias.md)
- [Variance](Variance.md)
-- [OutOfBag](OutOfBag.md)
-- [RandomPatches](RandomPatches.md)
-- [RandomSubspaces](RandomSubspaces.md)
-- [ExtraTrees](ExtraTrees.md)
-- [AdaBoost](AdaBoost.md)
-- [GradientBoosting](GradientBoosting.md)
-- [HistogramBasedGradientBoosting](HistogramBasedGradientBoosting.md)
+- [Out Of Bag](OutOfBag.md)
+- [Random Patches](RandomPatches.md)
+- [Random Subspaces](RandomSubspaces.md)
+- [Extra Trees](ExtraTrees.md)
+- [Ada Boost](AdaBoost.md)
+- [Gradient Boosting](GradientBoosting.md)
+- [Histogram Based Gradient Boosting](HistogramBasedGradientBoosting.md)
- [Stacking](Stacking.md)
- [Projection](Projection.md)
- [Subspace](Subspace.md)
-- [ManifoldLearning](ManifoldLearning.md)
+- [Manifold Learning](ManifoldLearning.md)
- [PCA](PCA.md)
-- [RandomProjection](RandomProjection.md)
+- [Random Projection](RandomProjection.md)
- [LLE](LLE.md)
- [Affinity](Affinity.md)
- [Segmentation](Segmentation.md)
- [DBSCAN](DBSCAN.md)
-- [GaussianMixtureModels](GaussianMixtureModels.md)
-- [NeuralNetworks](NeuralNetworks.md)
+- [Gaussian Mixture Models](GaussianMixtureModels.md)
+- [Neural Networks](NeuralNetworks.md)
- [Perceptrons](Perceptrons.md)
- [Backpropagation](Backpropagation.md)
- [MLP](MLP.md)
-- [WideAndDeepNN](WideAndDeepNN.md)
-- [CategoricalCrossEntropy](CategoricalCrossEntropy.md)
-- [VanishingGradients](VanishingGradients.md)
-- [ExplodingGradients](ExplodingGradients.md)
-- [UnstableGradients](UnstableGradients.md)
-- [LeakyReLU](LeakyReLU.md)
-- [GradientClipping](GradientClipping.md)
-- [BatchNormalization](BatchNormalization.md)
-- [PretrainedModels](PretrainedModels.md)
-- [UnsupervisedPretraining](UnsupervisedPretraining.md)
+- [Wide And Deep NN](WideAndDeepNN.md)
+- [Categorical Cross Entropy](CategoricalCrossEntropy.md)
+- [Vanishing Gradients](VanishingGradients.md)
+- [Exploding Gradients](ExplodingGradients.md)
+- [Unstable Gradients](UnstableGradients.md)
+- [Leaky Re LU](LeakyReLU.md)
+- [Gradient Clipping](GradientClipping.md)
+- [Batch Normalization](BatchNormalization.md)
+- [Pretrained Models](PretrainedModels.md)
+- [Unsupervised Pretraining](UnsupervisedPretraining.md)
- [Autoencoder](Autoencoder.md)
- [Optimizer](Optimizer.md)
- [Momentum](Momentum.md)
- [NAG](NAG.md)
-- [AdaGrad](AdaGrad.md)
+- [Ada Grad](AdaGrad.md)
- [Adam](Adam.md)
- [Dropout](Dropout.md)
-- [MaxNormRegularization](MaxNormRegularization.md)
+- [Max Norm Regularization](MaxNormRegularization.md)
- [Tensor](Tensor.md)
- [Transpose](Transpose.md)
- [CNN](CNN.md)
-- [NaiveBayes](NaiveBayes.md)
+- [Naive Bayes](NaiveBayes.md)
- [Embedding](Embedding.md)
-- [RepresentationLearning](RepresentationLearning.md)
-- [PoolingLayers](PoolingLayers.md)
-- [DataAugmentation](DataAugmentation.md)
+- [Representation Learning](RepresentationLearning.md)
+- [Pooling Layers](PoolingLayers.md)
+- [Data Augmentation](DataAugmentation.md)
- [SMOTE](SMOTE.md)
-- [LatentSpace](LatentSpace.md)
+- [Latent Space](LatentSpace.md)
diff --git a/docs/Math.md b/docs/Math.md
@@ -5,18 +5,18 @@ This is the index for my math notes.
## Course Notes
- [Math310](Math310.md)
-- [DiscreteMath](DiscreteMath.md)
+- [Discrete Math](DiscreteMath.md)
## Other Focuses
-- [ComputerArchitecture](ComputerArchitecture.md)
-- [MachineLearning](MachineLearning.md)
+- [Computer Architecture](ComputerArchitecture.md)
+- [Machine Learning](MachineLearning.md)
- [AISafety](AISafety.md)
-- [StatisticsAndProbability](StatisticsAndProbability.md)
-- [LinuxStuff](LinuxStuff.md)
-- [LinearAlgebra](LinearAlgebra.md)
+- [Statistics And Probability](StatisticsAndProbability.md)
+- [Linux Stuff](LinuxStuff.md)
+- [Linear Algebra](LinearAlgebra.md)
- [Calculus](Calculus.md)
- [Physics](Physics.md)
-- [ReinforcementLearning](ReinforcementLearning.md)
-- [DeepLearning](DeepLearning.md)
+- [Reinforcement Learning](ReinforcementLearning.md)
+- [Deep Learning](DeepLearning.md)
- [CPP](CPP.md)
diff --git a/docs/Math310.md b/docs/Math310.md
@@ -5,15 +5,15 @@ This is the index for my main Math 310 notes.
## Main Links
- [Induction](Induction.md)
-- [StrongInduction](StrongInduction.md)
-- [SmallestCounterExample](SmallestCounterExample.md)
-- [CounterExample](CounterExample.md)
-- [VectorSpace](VectorSpace.md)
-- [PowerSet](PowerSet.md)
+- [Strong Induction](StrongInduction.md)
+- [Smallest Counter Example](SmallestCounterExample.md)
+- [Counter Example](CounterExample.md)
+- [Vector Space](VectorSpace.md)
+- [Power Set](PowerSet.md)
- [Contrapositive](Contrapositive.md)
- [Contradiction](Contradiction.md)
-- [CartesianProduct](CartesianProduct.md)
-- [ProveSetEquality](ProveSetEquality.md)
-- [PerfectNumbers](PerfectNumbers.md)
-- [GaussianIntegers](GaussianIntegers.md)
+- [Cartesian Product](CartesianProduct.md)
+- [Prove Set Equality](ProveSetEquality.md)
+- [Perfect Numbers](PerfectNumbers.md)
+- [Gaussian Integers](GaussianIntegers.md)
- [Partition](Partition.md)
diff --git a/docs/MergeSort.md b/docs/MergeSort.md
@@ -31,11 +31,11 @@ def merge(ls):
# Merge lists (O(n))
while leftPos < len(left) and rightPos < len(right):
- if left[leftPos] < right[rightPos]:
- sorted.append(left[leftPos])
+ if left[left Pos] < right[right Pos]:
+ sorted.append(left[left Pos])
leftPos += 1
else:
- sorted.append(right[rightPos])
+ sorted.append(right[right Pos])
rightPos += 1
sorted.extend(left[leftPos:])
diff --git a/docs/NullSpace.md b/docs/NullSpace.md
@@ -10,7 +10,7 @@ These are all of the vectors that when multiplied by the matrix are equivalent t
To calculate the null space do the following:
-1. Get [ReducedRowEchelonForm](ReducedRowEchelonForm.md)
+1. Get [Reduced Row Echelon Form](ReducedRowEchelonForm.md)
2. Write out find the values of each pivot entry (relation to other values)
3. Plug this into vectors of height n where each vector is multiplied by the corresponding axis component
diff --git a/docs/OracleComputer.md b/docs/OracleComputer.md
@@ -6,4 +6,4 @@ SS
**Definition:** An oracle computer is a computer that can compute any computable problem.
-Such a system does not need to be possible see [BekensteinBound](BekensteinBound.md) for why it may not be possible.
+Such a system does not need to be possible see [Bekenstein Bound](BekensteinBound.md) for why it may not be possible.
diff --git a/docs/OrthogonalComplement.md b/docs/OrthogonalComplement.md
@@ -18,4 +18,4 @@ Every element of the nullspace is in the orthogonal complement and vice versa th
For the arbitrary subspace V, we know dim(V) = k. As such, we also know for O which is the orthogonal complement, that dim(O) = k - n where R^n is the [[AmbientSpace.md]].
-This is given because we also know that the [Nullity](Nullity.md) + [Rank](Rank.md) = dim([AmbientSpace](AmbientSpace.md)).
+This is given because we also know that the [Nullity](Nullity.md) + [Rank](Rank.md) = dim([Ambient Space](AmbientSpace.md)).
diff --git a/docs/Rank.md b/docs/Rank.md
@@ -8,4 +8,4 @@ Khan
[Nullity](Nullity.md) is the same thing except specifically referring to a matrix's null space.
-We call the rank 'full rank' when the rank is equivalent to the [AmbientSpace](AmbientSpace.md).
+We call the rank 'full rank' when the rank is equivalent to the [Ambient Space](AmbientSpace.md).
diff --git a/docs/RealVectorSpace.md b/docs/RealVectorSpace.md
@@ -6,7 +6,7 @@
## Notes
-**Definition:** A real vector space is a [VectorSpace](VectorSpace.md) on $R$ where $R$ is the set of real numbers.
+**Definition:** A real vector space is a [Vector Space](VectorSpace.md) on $R$ where $R$ is the set of real numbers.
## Importance
diff --git a/docs/RecencyHeuristic.md b/docs/RecencyHeuristic.md
@@ -6,4 +6,4 @@ L4
**Definition:** The recency heuristic is a solution to the credit assignment problem where we assign credit to reward/punishment to the most recent state(s).
-This is opposed to the [FrequencyHeuristic](FrequencyHeuristic.md) where we assign credit to the things that happened most often leading to the reward signal.
+This is opposed to the [Frequency Heuristic](FrequencyHeuristic.md) where we assign credit to the things that happened most often leading to the reward signal.
diff --git a/docs/ReinforcementLearning.md b/docs/ReinforcementLearning.md
@@ -3,56 +3,56 @@
Reinforcement Learning: An Introduction (Sutton & Barto)
Chapter 1 (Introduction)
-* [MarkovDecisionProcesses](MarkovDecisionProcesses.md)
+* [Markov Decision Processes](MarkovDecisionProcesses.md)
* [Exploit](Exploit.md)
* [Explore](Explore.md)
* [Policy](Policy.md)
-* [RewardSignal](RewardSignal.md)
-* [ValueFunction](ValueFunction.md)
+* [Reward Signal](RewardSignal.md)
+* [Value Function](ValueFunction.md)
* [Model](Model.md)
-* [EvolutionaryMethods](EvolutionaryMethods.md)
+* [Evolutionary Methods](EvolutionaryMethods.md)
DeepMind UCL Lectures
L1
-* [CreditAssignmentProblem](CreditAssignmentProblem.md)
-* [ImitationLearning](ImitationLearning.md)
-* [MarkovAssumption](MarkovAssumption.md)
-* [PartiallyObservableMarkovDecisionProcess](PartiallyObservableMarkovDecisionProcess.md)
-* [ModelFree](ModelFree.md)
+* [Credit Assignment Problem](CreditAssignmentProblem.md)
+* [Imitation Learning](ImitationLearning.md)
+* [Markov Assumption](MarkovAssumption.md)
+* [Partially Observable Markov Decision Process](PartiallyObservableMarkovDecisionProcess.md)
+* [Model Free](ModelFree.md)
* [Bandits](Bandits.md)
* [Evaluation](Evaluation.md)
L2
-* [MarkovDecisionProcesses](MarkovDecisionProcesses.md)
-* [MarkovAssumption](MarkovAssumption.md)
-* [DiscountFactor](DiscountFactor.md)
-* [MarkovRewardProcess](MarkovRewardProcess.md)
-* [MarkovProcess](MarkovProcess.md)
+* [Markov Decision Processes](MarkovDecisionProcesses.md)
+* [Markov Assumption](MarkovAssumption.md)
+* [Discount Factor](DiscountFactor.md)
+* [Markov Reward Process](MarkovRewardProcess.md)
+* [Markov Process](MarkovProcess.md)
* [Return](Return.md)
* [Policy](Policy.md)
-* [BellmanEquation](BellmanEquation.md)
+* [Bellman Equation](BellmanEquation.md)
L3
-* [DynamicProgramming](DynamicProgramming.md)
-* [OptimalSubstructure](OptimalSubstructure.md)
-* [OverlappingSubproblems](OverlappingSubproblems.md)
+* [Dynamic Programming](DynamicProgramming.md)
+* [Optimal Substructure](OptimalSubstructure.md)
+* [Overlapping Subproblems](OverlappingSubproblems.md)
L4
-* [ModelFree](ModelFree.md)
+* [Model Free](ModelFree.md)
* [Episodic](Episodic.md)
* [Episode](Episode.md)
-* [MonteCarloLearning](MonteCarloLearning.md)
-* [IncrementalMean](IncrementalMean.md)
-* [TemporalDifferenceLearning](TemporalDifferenceLearning.md)
-* [FrequencyHeuristic](FrequencyHeuristic.md)
-* [RecencyHeuristic](RecencyHeuristic.md)
-* [EligibilityTraces](EligibilityTraces.md)
+* [Monte Carlo Learning](MonteCarloLearning.md)
+* [Incremental Mean](IncrementalMean.md)
+* [Temporal Difference Learning](TemporalDifferenceLearning.md)
+* [Frequency Heuristic](FrequencyHeuristic.md)
+* [Recency Heuristic](RecencyHeuristic.md)
+* [Eligibility Traces](EligibilityTraces.md)
L5
-* [ModelFree](ModelFree.md)
-* [MonteCarloLearning](MonteCarloLearning.md)
-* [TemporalDifferenceLearning](TemporalDifferenceLearning.md)
-* [OnPolicyLearning](OnPolicyLearning.md)
-* [OffPolicyLearning](OffPolicyLearning.md)
+* [Model Free](ModelFree.md)
+* [Monte Carlo Learning](MonteCarloLearning.md)
+* [Temporal Difference Learning](TemporalDifferenceLearning.md)
+* [On Policy Learning](OnPolicyLearning.md)
+* [Off Policy Learning](OffPolicyLearning.md)
* EpsilonGreedy
diff --git a/docs/Span.md b/docs/Span.md
@@ -6,6 +6,6 @@
## Notes
-**Definition:** The span of (v_1, ..., v_m) is the set of all [LinearCombination](LinearCombination.md) of (v_1, ..., v_m).
+**Definition:** The span of (v_1, ..., v_m) is the set of all [Linear Combination](LinearCombination.md) of (v_1, ..., v_m).
This may be all R^2, R^3, or some other vector space.
diff --git a/docs/StandardBasis.md b/docs/StandardBasis.md
@@ -6,4 +6,4 @@
## Notes
-**Definition:** The standard basis is the [BasisOfSubspace](BasisOfSubspace.md) where each vector is made up of all 0's and one 1.
+**Definition:** The standard basis is the [Basis Of Subspace](BasisOfSubspace.md) where each vector is made up of all 0's and one 1.
diff --git a/docs/StatisticsAndProbability.md b/docs/StatisticsAndProbability.md
@@ -26,29 +26,29 @@ Chapter 1.2:
Chapter 1.3:
- [Permutation](Permutation.md)
- - [BinomialCoefficient](BinomialCoefficient.md)
- - [OrderedSample](OrderedSample.md)
+ - [Binomial Coefficient](BinomialCoefficient.md)
+ - [Ordered Sample](OrderedSample.md)
- [Binomial](Binomial.md)
- - [DistinguishablePermutation](DistinguishablePermutation.md)
- - [MultinomialCoefficient](MultinomialCoefficient.md)
+ - [Distinguishable Permutation](DistinguishablePermutation.md)
+ - [Multinomial Coefficient](MultinomialCoefficient.md)
Chapter 1.4:
- - [ConditionalProbability](ConditionalProbability.md)
+ - [Conditional Probability](ConditionalProbability.md)
Chapter 1.5:
- - [IndependentEvents](IndependentEvents.md)
- - [PairwiseIndependence](PairwiseIndependence.md)
- - [MutuallyIndependent](MutuallyIndependent.md)
+ - [Independent Events](IndependentEvents.md)
+ - [Pairwise Independence](PairwiseIndependence.md)
+ - [Mutually Independent](MutuallyIndependent.md)
Chapter 1.6:
- - [BayesTheroem](BayesTheroem.md)
- - [PriorProbability](PriorProbability.md)
- - [PosteriorProbability](PosteriorProbability.md)
+ - [Bayes Theroem](BayesTheroem.md)
+ - [Prior Probability](PriorProbability.md)
+ - [Posterior Probability](PosteriorProbability.md)
Chapter 2.1:
- - [RandomVariables](RandomVariables.md)
- - [ProbabilityMassFunction](ProbabilityMassFunction.md)
- - [DiscreteRandomVariable](DiscreteRandomVariable.md)
+ - [Random Variables](RandomVariables.md)
+ - [Probability Mass Function](ProbabilityMassFunction.md)
+ - [Discrete Random Variable](DiscreteRandomVariable.md)
- Support (space of X)
- HypergeometricDistribution
diff --git a/docs/TheoryOfComputation.md b/docs/TheoryOfComputation.md
@@ -10,10 +10,10 @@ Lecture 01/24
Lecture 01/27
-- [RegularLanguages](RegularLanguages.md)
-- [DeterministicFiniteAutomata](DeterministicFiniteAutomata.md)
+- [Regular Languages](RegularLanguages.md)
+- [Deterministic Finite Automata](DeterministicFiniteAutomata.md)
Lecture 01/28
-- [DeterministicFiniteAutomata](DeterministicFiniteAutomata.md)
-- [NonDeterministicFiniteAutomata](NonDeterministicFiniteAutomata.md)
+- [Deterministic Finite Automata](DeterministicFiniteAutomata.md)
+- [Non Deterministic Finite Automata](NonDeterministicFiniteAutomata.md)
diff --git a/docs/Unity.md b/docs/Unity.md
@@ -13,31 +13,31 @@ Unity is a popular game engine, no duh.
### Important Conceptual Ideas
- [Texture](Texture.md)
-- [TextureMaps](TextureMaps.md)
+- [Texture Maps](TextureMaps.md)
- [Baking](Baking.md)
-- [SurfaceRepresentation](SurfaceRepresentation.md)
+- [Surface Representation](SurfaceRepresentation.md)
- [Mesh](Mesh.md)
- [Transform](Transform.md)
- [Quaternions](Quaternions.md)
### Components
-- [MeshFilter](MeshFilter.md)
-- [MeshRenderer](MeshRenderer.md)
+- [Mesh Filter](MeshFilter.md)
+- [Mesh Renderer](MeshRenderer.md)
- [Script](Script.md)
- [Animation](Animation.md)
-- [AnimationController](AnimationController.md)
+- [Animation Controller](AnimationController.md)
### Other Unity Specifics
- [Asset](Asset.md)
-- [GameObject](GameObject.md)
-- [MonoBehaviour](MonoBehaviour.md)
+- [Game Object](GameObject.md)
+- [Mono Behaviour](MonoBehaviour.md)
- [Lighting](Lighting.md)
-- [GameLoop](GameLoop.md)
+- [Game Loop](GameLoop.md)
- [Vector3](Vector3.md)
- [Input](Input.md)
- [Movement](Movement.md)
- [Translate](Translate.md)
- [Rotate](Rotate.md)
-- [LocalScale](LocalScale.md)
+- [Local Scale](LocalScale.md)
diff --git a/docs/overrides/footer.html b/docs/overrides/footer.html
diff --git a/mkdocs.yml b/mkdocs.yml
@@ -14,11 +14,8 @@ extra_javascript:
- javascripts/mathjax.js
- https://unpkg.com/mathjax@3/es5/tex-mml-chtml.js
-
-
theme:
name: material
- custom_dir: docs/overrides
favicon: ./favicon.ico
plugins:
diff --git a/test b/test
