DjPractLelo 0.1.9__tar.gz → 0.2.0__tar.gz

djpractlelo-0.2.0/DjPractLelo/resource_loader.py

@@ -0,0 +1,35 @@
+from importlib.resources import files
+from pathlib import Path
+
+# Base resources directory
+BASE_RESOURCES = files("DjPractLelo") / "resources"
+
+
+def get_txt_file(category: str, filename: str) -> Path:
+    """
+    Get a specific TXT file from a category.
+    category: 'data_science' or 'soft_computing'
+    filename: must end with .txt
+    """
+    if not filename.endswith(".txt"):
+        raise ValueError("Only .txt files are allowed")
+
+    return BASE_RESOURCES / category / filename
+
+
+def list_txt_files(category: str) -> list[Path]:
+    """
+    List all TXT files in a category.
+    """
+    directory = BASE_RESOURCES / category
+    return [p for p in directory.iterdir() if p.suffix == ".txt"]
+
+
+def load_txt(filename: str, category: str = "data_science") -> str:
+    """
+    Read a TXT file and return its content.
+    """
+    path = get_txt_file(category, filename)
+
+    with open(path, "r", encoding="utf-8") as f:
+        return f.read()

{djpractlelo-0.1.9 → djpractlelo-0.2.0}/DjPractLelo.egg-info/PKG-INFO

@@ -1,6 +1,6 @@
 Metadata-Version: 2.4
 Name: DjPractLelo
-Version: 0.1.9
+Version: 0.2.0
 Summary: My first Python package
 Author: DjPractVala
 Author-email: DjPractVala <youremail@example.com>

djpractlelo-0.2.0/DjPractLelo.egg-info/SOURCES.txt

@@ -0,0 +1,10 @@
+LICENCE
+README.md
+pyproject.toml
+setup.py
+DjPractLelo/__init__.py
+DjPractLelo/resource_loader.py
+DjPractLelo.egg-info/PKG-INFO
+DjPractLelo.egg-info/SOURCES.txt
+DjPractLelo.egg-info/dependency_links.txt
+DjPractLelo.egg-info/top_level.txt

{djpractlelo-0.1.9 → djpractlelo-0.2.0}/PKG-INFO

@@ -1,6 +1,6 @@
 Metadata-Version: 2.4
 Name: DjPractLelo
-Version: 0.1.9
+Version: 0.2.0
 Summary: My first Python package
 Author: DjPractVala
 Author-email: DjPractVala <youremail@example.com>

{djpractlelo-0.1.9 → djpractlelo-0.2.0}/pyproject.toml

@@ -4,7 +4,7 @@ build-backend = "setuptools.build_meta"
 
 [project]
 name = "DjPractLelo"
-version = "0.1.9"
+version = "0.2.0"
 description = "My first Python package"
 readme = "README.md"
 requires-python = ">=3.7"
@@ -25,12 +25,6 @@ where = ["."]
 
 [tool.setuptools.package-data]
 DjPractLelo = [
-    "resources/**/*.json",
-    "resources/**/*.csv",
-    "resources/**/*.docx",
-    "resources/**/*.R",
-    "resources/**/*.jpg",
-    "resources/**/*.mp4",
-    "resources/**/*.mp3",
-    "resources/**/*.xml"
+    "resources/data_science/*.txt",
+    "resources/soft_computing/*.txt"
 ]

{djpractlelo-0.1.9 → djpractlelo-0.2.0}/setup.py

@@ -2,7 +2,7 @@ from setuptools import setup, find_packages
 
 setup(
     name="DjPractLelo",
-    version="0.1.9",
+    version="0.2.0",
     author="DjPractVala",
     description="My demo Python package",
     packages=find_packages(),

djpractlelo-0.1.9/DjPractLelo/resource_loader.py

@@ -1,42 +0,0 @@
-from importlib.resources import files
-from pathlib import Path
-import json
-
-# Base resources directory
-BASE_RESOURCES = files("DjPractLelo") / "resources"
-
-
-def get_resource(category: str, filename: str) -> Path:
-    """
-    Get any resource file from a category.
-    category: 'data_science' or 'soft_computing'
-    filename: exact filename
-    """
-    return BASE_RESOURCES / category / filename
-
-
-def list_files(category: str, extension: str | None = None) -> list[Path]:
-    """
-    List files in a category.
-    extension: '.csv', '.json', '.py', '.R', '.mp3', '.mp4', '.xml' etc. (None = all files)
-    """
-    directory = BASE_RESOURCES / category
-    if extension:
-        return [p for p in directory.iterdir() if p.suffix == extension]
-    return [p for p in directory.iterdir() if p.is_file()]
-
-
-def load_json(filename: str, category: str = "data_science") -> dict:
-    """
-    Load any JSON file from resources.
-    """
-    path = get_resource(category, filename)
-    with open(path, "r", encoding="utf-8") as f:
-        return json.load(f)
-
-
-def get_manual(category: str) -> Path:
-    """
-    Get manual.docx from any category.
-    """
-    return get_resource(category, "manual.docx")

djpractlelo-0.1.9/DjPractLelo/resources/soft_computing/10a_simple_genetic algorithm.py

@@ -1,48 +0,0 @@
-import numpy as np
-import random
-
-def activate_function(x):
-    return 1 / (1 + np.exp(-x))
-
-
-n = int(input("Enter Number of inputs you want:"))
-
-# Initial weights (only once)
-weights = np.random.randn(n)
-
-bias = np.random.uniform(0.1, 0.9)
-
-# User inputs
-inputs = []
-for i in range(n):
-    inputs.append(float(input("Enter your input: ")))
-
-inputs = np.array(inputs)
-
-print("\nInitial Weights (First Generation):")
-print(weights)
-
-# Crossover (self crossover using split)
-crossover_point = random.randint(1, n-1)
-child_weights = np.concatenate((weights[:crossover_point], weights[crossover_point:]))
-
-print("\nAfter Crossover:")
-print(child_weights)
-
-# Mutation (change one weight)
-mutation_index = random.randint(0, n-1)
-old_weight = child_weights[mutation_index]
-child_weights[mutation_index] += np.random.randn()
-
-print("\nAfter Mutation:")
-print(f"Weight {mutation_index} changed from {old_weight} to {child_weights[mutation_index]}")
-
-# Neuron output using evolved weights
-z = 0
-for i in range(n):
-    z += inputs[i] * child_weights[i]
-
-z += bias
-
-print("\nFinal Output:")
-print(activate_function(z))

djpractlelo-0.1.9/DjPractLelo/resources/soft_computing/10b_genetic-algorithm-city.py

@@ -1,33 +0,0 @@
-import random, math
-
-class City:
-    def __init__(self, x, y):
-        self.x, self.y = x, y
-    def distance(self, city):
-        return math.sqrt((self.x - city.x)**2 + (self.y - city.y)**2)
-    def __repr__(self):
-        return f"({self.x},{self.y})"
-
-class Fitness:
-    def __init__(self, route):
-        self.route = route
-    def distance(self):
-        total = 0
-        for i in range(len(self.route)):
-            total += self.route[i].distance(self.route[(i+1)%len(self.route)])
-        return total
-    def fitness(self):
-        return 1 / self.distance()
-
-cities = [City(random.randint(0,50), random.randint(0,50)) for _ in range(5)]
-
-population = [random.sample(cities, len(cities)) for _ in range(4)]
-
-for _ in range(5):
-    population.sort(key=lambda r: Fitness(r).fitness(), reverse=True)
-    parent1, parent2 = population[0], population[1]
-    child = parent1[:2] + [c for c in parent2 if c not in parent1[:2]]
-
-best = population[0]
-print("Best Route:", best)
-print("Distance:", Fitness(best).distance())

djpractlelo-0.1.9/DjPractLelo/resources/soft_computing/1a_simple_nueral.py

@@ -1,34 +0,0 @@
-import numpy as np
-import random
-
-def activate_function(x):
-    return 1 / (1 + np.exp(-x))
-
-    
-n=int(input("Enter Number of inputs you want:"))
-
-weights = np.random.randn(n)
-
-bias = np.random.uniform(low=0.1, high=0.9)
-
-#User input
-inputs = []
-for i in range(number):
-    val = float(input(f"Enter your input: "))
-    inputs.append(val)
-
-z=0
-for i in range(n):
-    z += (inputs[i] * weights[i])
-
-z = z + bias
-
-# Apply activation function
-print(activate_function(z))
-
-
-
-
-
-
-

djpractlelo-0.1.9/DjPractLelo/resources/soft_computing/1b_binary_bipolar.py

@@ -1,25 +0,0 @@
-import math
-import numpy as np
-
-n=int(input("Enter Number of inputs you want:"))
-
-weights = np.random.randn(n)
-
-bias = np.random.uniform(low=0.1, high=0.9)
-
-inputs = []
-for i in range(n):
-    val = float(input(f"Enter your input: "))
-    inputs.append(val)
-
-z=0
-for i in range(n):
-    z += (inputs[i] * weights[i])
-
-z = z + bias
-
-binary_sigmoidal = 1 / (1 + np.exp(-z))
-bipolar_sigmoidal = 2 / (1 + np.exp(-z)) - 1
-
-print("Binary Sigmoidal = ", round(binary_sigmoidal, 3))
-print("Bipolar Sigmoidal = ", round(bipolar_sigmoidal, 3))

djpractlelo-0.1.9/DjPractLelo/resources/soft_computing/2a_macclouch_AND.py

@@ -1,24 +0,0 @@
-#Mcclouch AND
-
-x1inputs = [0, 0, 1, 1]
-x2inputs = [0, 1, 0, 1]
-
-# Weights (excitatory)
-w1 = 1
-w2 = 1
-
-# Threshold(must be sum of weights to fire only when both inputs are 1)
-threshold = w1+w2  
-
-print("x1  x2  sum  Y")
-for x1, x2 in zip(x1inputs, x2inputs):
-    
-    addittion = x1 * w1 + x2 * w2
-    
-    # Apply threshold
-    if addittion >= threshold:
-        Y = 1
-    else:
-        Y = 0
-    
-    print(f"{x1}   {x2}   {addittion}    {Y}")

djpractlelo-0.1.9/DjPractLelo/resources/soft_computing/2b_macclouch_OR.py

@@ -1,24 +0,0 @@
-# McCulloch-Pitts OR
-
-x1inputs = [0, 0, 1, 1]
-x2inputs = [0, 1, 0, 1]
-
-# Weights (excitatory)
-w1 = 1
-w2 = 1
-
-# Threshold (must be 1 to fire when at least one input is 1)
-threshold = 1  # minimum excitatory input to fire
-
-print("x1  x2  sum  Y")
-for x1, x2 in zip(x1inputs, x2inputs):
-    
-    addition = x1 * w1 + x2 * w2
-    
-    # Apply threshold
-    if addition >= threshold:
-        Y = 1
-    else:
-        Y = 0
-    
-    print(f"{x1}   {x2}   {addition}    {Y}")

djpractlelo-0.1.9/DjPractLelo/resources/soft_computing/2c_macclouch_XOR.py

@@ -1,36 +0,0 @@
-'''XOR= '''
-''' 0 if inputs are same,else 1'''
-
-x1inputs = [0, 0, 1, 1]
-x2inputs = [0, 1, 0, 1]
-
-print("x1  x2  Y")
-
-for x1, x2 in zip(x1inputs, x2inputs):
-    
-    # First layer neurons
-    # Neuron1 = x1 AND NOT x2
-    neuron1_sum = x1 * 1 + x2 * -1
-    neuron1_threshold = 1
-    if neuron1_sum >= neuron1_threshold:
-        neuron1 = 1
-    else:
-        neuron1 = 0
-    
-    # Neuron2 = NOT x1 AND x2
-    neuron2_sum = x1 * -1 + x2 * 1
-    neuron2_threshold = 1
-    if neuron2_sum >= neuron2_threshold:
-        neuron2 = 1
-    else:
-        neuron2 = 0
-    
-    # Output neuron = Neuron1 OR Neuron2
-    output_sum = neuron1 * 1 + neuron2 * 1
-    output_threshold = 1
-    if output_sum >= output_threshold:
-        Y = 1
-    else:
-        Y = 0
-    
-    print(f"{x1}   {x2}   {Y}")

djpractlelo-0.1.9/DjPractLelo/resources/soft_computing/3a_hebb_rule.py

@@ -1,56 +0,0 @@
-import numpy as np
-
-# Sigmoid activation function
-def activate_function(x):
-    return 1 / (1 + np.exp(-x))
-
-# Learning rate for Hebbian learning
-learning_rate = 0.1
-
-n = int(input("Enter number of inputs you want: "))
-
-weights = np.random.randn(n)
-bias = np.random.randn()
-
-print("\nInitial weights:", weights)
-print("Bias:", bias, "\n")
-
-inputs = []
-for i in range(n):
-    val = float(input(f"Enter input {i+1}: "))
-    inputs.append(val)
-
-inputs = np.array(inputs)
-
-y=0
-for i in range(n):
-    y += (inputs[i] * weights[i])
-
-y = y + bias
-print("\nWeighted sum (z) before Hebbian update:", y)
-
-output = activate_function(y)
-print("Output before Hebbian update:", round(output, 3))
-
-
-
-
-#Hebbian Learning Rule
-target = round(output)
-
-# Update weights according to Hebb's rule
-weights += learning_rate * inputs
-bias += learning_rate   
-
-print("\nWeights after Hebbian learning:", weights)
-print("Bias after Hebbian learning:", bias)
-
-#Compute new sum and output after learning
-for i in range(n):
-    y += (inputs[i] * weights[i])
-
-y= y + bias
-output_new = activate_function(y)
-
-print("\nSum after Hebbian update:",y)
-print("Output after Hebbian update:",output)

djpractlelo-0.1.9/DjPractLelo/resources/soft_computing/3b_delta_rule.py

@@ -1,63 +0,0 @@
-import numpy as np
-
-# Sigmoid activation function
-def activate_function(x):
-    return 1 / (1 + np.exp(-x))
-
-# Learning rate
-learning_rate = 0.1
-
-n = int(input("Enter number of inputs you want: "))
-
-weights = np.random.randn(n)
-bias = np.random.randn()
-
-print("\nInitial weights:", weights)
-print("Bias:", bias, "\n")
-
-inputs = []
-for i in range(n):
-    val = float(input(f"Enter input {i+1}: "))
-    inputs.append(val)
-
-inputs = np.array(inputs)
-
-y = 0
-for i in range(n):
-    y += (inputs[i] * weights[i])
-
-y = y + bias
-print("\nWeighted sum (z) before learning:", y)
-
-output = activate_function(y)
-print("Output before learning:",output)
-
-
-
-
-
-
-# -------- Delta Rule --------
-target = float(input("Enter target output (0 or 1): "))
-
-error = target - output
-print(error)
-
-
-# Update weights and bias using Delta rule
-weights += learning_rate * inputs*error
-bias += learning_rate
-
-print("\nWeights after Delta learning:", weights)
-print("Bias after Delta learning:", bias)
-
-#New sum and output after learning
-y = 0
-for i in range(n):
-    y += (inputs[i] * weights[i])
-
-y = y + bias
-output = activate_function(y)
-
-print("\nSum after Delta update:", y)
-print("Output after Delta update:", output)

djpractlelo-0.1.9/DjPractLelo/resources/soft_computing/4a_back-prop.py

@@ -1,31 +0,0 @@
-import numpy as np
-
-# Activation function and derivative
-sig = lambda x: 1/(1+np.exp(-x))
-dsig = lambda x: x*(1-x)
-
-# Number of inputs
-n = int(input("Enter number of inputs: "))
-
-# Initialize weights and bias
-weights = np.random.randn(n)
-bias = np.random.rand()
-
-# User input
-inputs = np.array([float(input(f"Enter input {i+1}: ")) for i in range(n)])
-target = float(input("Enter target output: "))
-
-# Training
-lr = 0.1
-for _ in range(1000):
-    out = sig(np.dot(inputs, weights) + bias)
-    error = target - out
-    delta = error * dsig(out)
-    weights += lr * delta * inputs
-    bias += lr * delta
-
-# Output
-out = sig(np.dot(inputs, weights) + bias)
-print("Trained output:", out)
-print("Trained weights:", weights)
-print("Trained bias:", bias)

djpractlelo-0.1.9/DjPractLelo/resources/soft_computing/4b_back-prop-error.py

@@ -1,34 +0,0 @@
-import numpy as np
-
-# Sigmoid and derivative
-sig = lambda x: 1/(1+np.exp(-x))
-dsig = lambda x: x*(1-x)
-
-# Number of inputs
-n = int(input("Enter number of inputs: "))
-
-# User inputs
-inputs = np.array([float(input(f"Enter input {i+1}: ")) for i in range(n)])
-target = float(input("Enter target output: "))
-
-# Initialize weights and bias
-weights = np.random.randn(n)
-bias = np.random.rand()
-
-# Learning rate and epochs
-lr = 0.1
-epochs = 1000
-
-# Training loop (backpropagation)
-for _ in range(epochs):
-    out = sig(np.dot(inputs, weights) + bias)  # Forward pass
-    error = target - out
-    delta = error * dsig(out)
-    weights += lr * delta * inputs            # Update weights
-    bias += lr * delta                         # Update bias
-
-# Final output
-out = sig(np.dot(inputs, weights) + bias)
-print("Trained output:", out)
-print("Trained weights:", weights)
-print("Trained bias:", bias)

djpractlelo-0.1.9/DjPractLelo/resources/soft_computing/6a_kohonen_self.py

@@ -1,38 +0,0 @@
-import random
-cities = [
-    [0, 0],      # Kudal
-    [-25, 0],    # Malvan
-    [0, -18],    # Sawantwadi
-    [0, 35],     # Kanakavali
-    [0, 65],     # Vaibhavwadi
-    [-35, 65],   # Devgad
-    [-20, -18]   # Vengurle
-]
-
-city_names = ["Kudal", "Malvan", "Sawantwadi", "Kanakavali", "Vaibhavwadi", "Devgad", "Vengurle"]
-
-neurons = 3          # number of clusters.
-learning_rate = 0.3
-epochs = 50
-
-# Initialize neuron positions randomly
-weights = [[random.uniform(-50, 70), random.uniform(-20, 70)] for _ in range(neurons)]
-
-#Training
-for _ in range(epochs):
-    for city in cities:
-        winner = min(range(neurons), key=lambda i: (city[0]-weights[i][0])**2 + (city[1]-weights[i][1])**2)
-        for j in range(2):
-            weights[winner][j] += learning_rate * (city[j] - weights[winner][j])
-
-# Print cluster centers
-print("Neuron positions (cluster centers):")
-for i, w in enumerate(weights):
-    print(f"Neuron {i}: {w}")
-
-# Assign each city to its nearest neuron
-print("\nCity assignments:")
-for idx, city in enumerate(cities):
-    nearest = min(range(neurons), key=lambda i: (city[0]-weights[i][0])**2 + (city[1]-weights[i][1])**2)
-    print(f"{city_names[idx]} -> Cluster {nearest}")
-

djpractlelo-0.1.9/DjPractLelo/resources/soft_computing/9a_ratios_fuzzy.py

@@ -1,25 +0,0 @@
-#membership function
-def fuzzy(x, a=4, b=7, c=10):
-    if x <= a or x >= c:
-        return 0
-    elif x <= b:
-        return (x - a) / (b - a)
-    else:
-        return (c - x) / (c - b)
-
-n = int(input("Enter number of shops: "))
-ratings = []
-
-# User input
-for i in range(n):
-    ratings.append(float(input(f"Enter rating for Shop {i+1}: ")))
-
-# Fuzzification
-memberships = [fuzzy(r) for r in ratings]
-total = sum(memberships)
-
-# Fuzzy ratios
-print("\nShop  Membership  Fuzzy Ratio")
-for i in range(n):
-    ratio = memberships[i] / total if total != 0 else 0
-    print(f"{i+1:>3}    {memberships[i]:.2f}        {ratio:.2f}")

djpractlelo-0.1.9/DjPractLelo/resources/soft_computing/9b_tipping problem.py

@@ -1,31 +0,0 @@
-def fuzzy(x, a, b, c):
-    if x <= a or x >= c:
-        return 0
-    elif x <= b:
-        return (x - a) / (b - a)
-    else:
-        return (c - x) / (c - b)
-
-# ---- User Input ----
-service = float(input("Enter service quality (0-10): "))
-food = float(input("Enter food quality (0-10): "))
-
-# ---- Fuzzification ----
-service_poor = fuzzy(service, 0, 0, 5)
-service_avg  = fuzzy(service, 3, 5, 7)
-service_good = fuzzy(service, 5, 10, 10)
-
-food_bad  = fuzzy(food, 0, 0, 5)
-food_avg  = fuzzy(food, 3, 5, 7)
-food_good = fuzzy(food, 5, 10, 10)
-
-# ---- Rule Evaluation ----
-low_tip    = max(service_poor, food_bad)
-medium_tip = service_avg
-high_tip   = min(service_good, food_good)
-
-# ---- Defuzzification (Weighted Average) ----
-tip = (low_tip*5 + medium_tip*15 + high_tip*25) / \
-      (low_tip + medium_tip + high_tip)
-
-print(f"\nRecommended Tip: {tip:.2f}%")

djpractlelo-0.1.9/DjPractLelo/resources/soft_computing/Delta Rule.py

@@ -1,28 +0,0 @@
-# Initial values
-w1 = 0.5   # old weight
-w2 = -0.3  # old weight
-b  = 0.2   # old bias
-
-# Inputs
-x1 = 1
-x2 = 0
-
-# Target and output
-t = 1      # target output
-y = 0      # actual output (predicted by neuron)
-
-# Learning rate
-eta = 0.1
-
-# Error
-error = t - y
-
-# Delta rule update
-w1_new = w1 + eta * error * x1
-w2_new = w2 + eta * error * x2
-b_new  = b  + eta * error
-
-# Print results
-print("Old w1:", w1, "-> New w1:", w1_new)
-print("Old w2:", w2, "-> New w2:", w2_new)
-print("Old b :", b,  "-> New b :", b_new)

djpractlelo-0.1.9/DjPractLelo/resources/soft_computing/adaptive-resonance.py

@@ -1,21 +0,0 @@
-import numpy as np
-
-X = np.array([[1,1,0,0],
-              [1,0,0,0],
-              [0,0,1,1],
-              [0,0,1,0]])
-
-rho = 0.6
-clusters = []
-
-for x in X:
-    for i, w in enumerate(clusters):
-        if np.sum(x & w) / np.sum(x) >= rho:
-            clusters[i] = x & w
-            break
-    else:  
-        clusters.append(x.copy())
-
-print("Clusters formed:", len(clusters))
-for i, c in enumerate(clusters):
-    print("Cluster", i+1, ":", c)

djpractlelo-0.1.9/DjPractLelo/resources/soft_computing/hebbs.py

@@ -1,19 +0,0 @@
-# Initial values
-w1 = 0.5   # old weight
-w2 = -0.3  # old weight
-b  = 0.2   # old bias
-
-# Inputs
-x1 = 1
-x2 = 0
-y  = 1     # target/output
-
-# Update rule
-w1_new = w1 + x1 * y
-w2_new = w2 + x2 * y
-b_new  = b + y
-
-# Print results
-print("Old w1:", w1, "-> New w1:", w1_new)
-print("Old w2:", w2, "-> New w2:", w2_new)
-print("Old b :", b,  "-> New b :", b_new)

djpractlelo-0.1.9/DjPractLelo/resources/soft_computing/hopfield.py

@@ -1,25 +0,0 @@
-import numpy as np
-
-# 1. Store patterns (-1 and 1 only)
-p1 = np.array([1, -1, 1, -1])
-p2 = np.array([-1, 1, -1, 1])
-patterns = [p1, p2]
-
-# 2. Create weight matrix
-W = np.zeros((4, 4))
-for p in patterns:
-    W += np.outer(p, p)
-np.fill_diagonal(W, 0)
-
-# 3. Recall function
-def recall(x):
-    for _ in range(5):           # update few times
-        x = np.sign(W @ x)
-    return x
-
-# 4. Noisy input
-test = np.array([1, -1, -1, -1])
-
-# 5. Output
-print("Noisy Input :", test)
-print("Recalled    :", recall(test))

djpractlelo-0.1.9/DjPractLelo/resources/soft_computing/linear-neural-network.py

@@ -1,15 +0,0 @@
-# Take inputs from user
-x1 = float(input("Enter first input (x1): "))
-x2 = float(input("Enter second input (x2): "))
-b= float(input("Enter bias value : "))
-
-
-# Weights (fixed)
-w1 = 0.5
-w2 = 1.0
-
-# Linear Neural Network formula
-y = w1*x1 + w2*x2 + b
-print("The weights and biase are ",w1,w2,b)
-
-print("Output:", y)

djpractlelo-0.1.9/DjPractLelo/resources/soft_computing/linear-seperability.py

@@ -1,16 +0,0 @@
-import numpy as np
-import matplotlib.pyplot as plt
-
-height = np.linspace(140, 190, 100)
-weight = 0.5 * height - 30
-
-plt.plot(height, weight)
-plt.title("Linear Separability: Boys vs Girls")
-plt.xlabel("Height (cm)")
-plt.ylabel("Weight (kg)")
-
-plt.text(150, 70, "Boys Region")
-plt.text(150, 30, "Girls Region")
-
-plt.grid(True)
-plt.show()

djpractlelo-0.1.9/DjPractLelo/resources/soft_computing/membership-operators.py

@@ -1,22 +0,0 @@
-print("---- Membership Operators ----")
-
-nums = [10, 20, 30]
-text = "Python"
-data = {"name": "Sam", "age": 22}
-
-print(nums,"\n",text,"\n",data)
-
-print("20 is present in 'nums' array :",20 in nums)        
-print("40 is not present in 'nums' array :",40 not in nums)    
- 
-print("\n---- Identity Operators ----")
-
-a = [1, 2, 3]
-b = a          
-c = [1, 2, 3]  
-
-print(a is b)       
-print(a is not b)   
-
-print(a is c)       
-print("Array 'a' has same elements like 'c' ",a == c)

djpractlelo-0.1.9/DjPractLelo/resources/soft_computing/radial-basis-function.py

@@ -1,22 +0,0 @@
-import math
-
-# Radial Basis Function (Gaussian)
-def rbf(x, c, sigma):
-    return math.exp(-((x - c)**2) / (2 * sigma**2))
-
-# Hidden neurons centers
-centers = [1, 2, 3]      # positions of RBF neurons
-sigma = 1.0              # width of Gaussian
-
-# Output weights
-weights = [0.5, -1.0, 0.8]
-
-# User input
-x = float(input("Enter input value: "))
-
-# Compute output
-y = 0
-for i in range(len(centers)):
-    y += weights[i] * rbf(x, centers[i], sigma)
-
-print("RBF Network Output:", y)

djpractlelo-0.1.9/DjPractLelo.egg-info/SOURCES.txt

@@ -1,34 +0,0 @@
-LICENCE
-README.md
-pyproject.toml
-setup.py
-DjPractLelo/__init__.py
-DjPractLelo/resource_loader.py
-DjPractLelo.egg-info/PKG-INFO
-DjPractLelo.egg-info/SOURCES.txt
-DjPractLelo.egg-info/dependency_links.txt
-DjPractLelo.egg-info/top_level.txt
-DjPractLelo/resources/data_science/practical_manual.docx
-DjPractLelo/resources/soft_computing/10a_simple_genetic algorithm.py
-DjPractLelo/resources/soft_computing/10b_genetic-algorithm-city.py
-DjPractLelo/resources/soft_computing/1a_simple_nueral.py
-DjPractLelo/resources/soft_computing/1b_binary_bipolar.py
-DjPractLelo/resources/soft_computing/2a_macclouch_AND.py
-DjPractLelo/resources/soft_computing/2b_macclouch_OR.py
-DjPractLelo/resources/soft_computing/2c_macclouch_XOR.py
-DjPractLelo/resources/soft_computing/3a_hebb_rule.py
-DjPractLelo/resources/soft_computing/3b_delta_rule.py
-DjPractLelo/resources/soft_computing/4a_back-prop.py
-DjPractLelo/resources/soft_computing/4b_back-prop-error.py
-DjPractLelo/resources/soft_computing/6a_kohonen_self.py
-DjPractLelo/resources/soft_computing/9a_ratios_fuzzy.py
-DjPractLelo/resources/soft_computing/9b_tipping problem.py
-DjPractLelo/resources/soft_computing/Delta Rule.py
-DjPractLelo/resources/soft_computing/adaptive-resonance.py
-DjPractLelo/resources/soft_computing/hebbs.py
-DjPractLelo/resources/soft_computing/hopfield.py
-DjPractLelo/resources/soft_computing/linear-neural-network.py
-DjPractLelo/resources/soft_computing/linear-seperability.py
-DjPractLelo/resources/soft_computing/membership-operators.py
-DjPractLelo/resources/soft_computing/practical_manual.docx
-DjPractLelo/resources/soft_computing/radial-basis-function.py