<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom" xmlns:dc="http://purl.org/dc/elements/1.1/">
  <channel>
    <title>DEV Community: Mujahida Joynab</title>
    <description>The latest articles on DEV Community by Mujahida Joynab (@mujahida_joynab_64c7407d8).</description>
    <link>https://dev.to/mujahida_joynab_64c7407d8</link>
    <image>
      <url>https://media2.dev.to/dynamic/image/width=90,height=90,fit=cover,gravity=auto,format=auto/https:%2F%2Fdev-to-uploads.s3.us-east-2.amazonaws.com%2Fuploads%2Fuser%2Fprofile_image%2F2273503%2F58c3bc7f-8ef8-4557-80fc-65c37807950e.png</url>
      <title>DEV Community: Mujahida Joynab</title>
      <link>https://dev.to/mujahida_joynab_64c7407d8</link>
    </image>
    <atom:link rel="self" type="application/rss+xml" href="https://dev.to/feed/mujahida_joynab_64c7407d8"/>
    <language>en</language>
    <item>
      <title>Linux Commands</title>
      <dc:creator>Mujahida Joynab</dc:creator>
      <pubDate>Thu, 20 Aug 2026 16:17:40 +0000</pubDate>
      <link>https://dev.to/mujahida_joynab_64c7407d8/linux-commands-33e2</link>
      <guid>https://dev.to/mujahida_joynab_64c7407d8/linux-commands-33e2</guid>
      <description>&lt;h3&gt;
  
  
  1. &lt;code&gt;mkdir --help&lt;/code&gt;
&lt;/h3&gt;

&lt;p&gt;&lt;strong&gt;Meaning:&lt;/strong&gt; Shows help for &lt;code&gt;mkdir&lt;/code&gt; command&lt;br&gt;&lt;br&gt;
&lt;strong&gt;Description:&lt;/strong&gt; Displays all options and usage rules for creating directories.&lt;/p&gt;




&lt;h3&gt;
  
  
  2. &lt;code&gt;clear&lt;/code&gt;
&lt;/h3&gt;

&lt;p&gt;&lt;strong&gt;Meaning:&lt;/strong&gt; Cleans the terminal&lt;br&gt;&lt;br&gt;
&lt;strong&gt;Description:&lt;/strong&gt; Removes all previous output from the terminal screen.&lt;/p&gt;




&lt;h3&gt;
  
  
  3. &lt;code&gt;alias c=clear&lt;/code&gt;
&lt;/h3&gt;

&lt;p&gt;&lt;strong&gt;Meaning:&lt;/strong&gt; Creates a shortcut for &lt;code&gt;clear&lt;/code&gt;&lt;br&gt;&lt;br&gt;
&lt;strong&gt;Description:&lt;/strong&gt; After this, typing &lt;code&gt;c&lt;/code&gt; and pressing Enter will clear the terminal.&lt;/p&gt;




&lt;h3&gt;
  
  
  4. &lt;code&gt;/etc/shadow&lt;/code&gt;
&lt;/h3&gt;

&lt;p&gt;&lt;strong&gt;Meaning:&lt;/strong&gt; Stores user passwords&lt;br&gt;&lt;br&gt;
&lt;strong&gt;Description:&lt;/strong&gt; Every hacker wants to access this file because it contains all encrypted passwords.&lt;/p&gt;




&lt;h3&gt;
  
  
  5. &lt;code&gt;/etc/passwd&lt;/code&gt;
&lt;/h3&gt;

&lt;p&gt;&lt;strong&gt;Meaning:&lt;/strong&gt; Stores user information&lt;br&gt;&lt;br&gt;
&lt;strong&gt;Description:&lt;/strong&gt; Contains username, UID, GID, home directory, and shell.&lt;/p&gt;




&lt;h3&gt;
  
  
  6. &lt;code&gt;/etc/group&lt;/code&gt;
&lt;/h3&gt;

&lt;p&gt;&lt;strong&gt;Meaning:&lt;/strong&gt; Stores group information&lt;br&gt;&lt;br&gt;
&lt;strong&gt;Description:&lt;/strong&gt; Contains group names, GIDs, and group members.&lt;/p&gt;




&lt;h3&gt;
  
  
  7. &lt;code&gt;tail -3 /etc/shadow&lt;/code&gt;
&lt;/h3&gt;

&lt;p&gt;&lt;strong&gt;Meaning:&lt;/strong&gt; Shows last 3 lines of shadow file&lt;br&gt;&lt;br&gt;
&lt;strong&gt;Description:&lt;/strong&gt; Displays password info of the last 3 users.&lt;/p&gt;




&lt;h3&gt;
  
  
  8. &lt;code&gt;head -3 /etc/shadow&lt;/code&gt;
&lt;/h3&gt;

&lt;p&gt;&lt;strong&gt;Meaning:&lt;/strong&gt; Shows first 3 lines of shadow file&lt;br&gt;&lt;br&gt;
&lt;strong&gt;Description:&lt;/strong&gt; Displays password info of the first 3 users.&lt;/p&gt;




&lt;h3&gt;
  
  
  9. &lt;code&gt;cat /etc/group&lt;/code&gt;
&lt;/h3&gt;

&lt;p&gt;&lt;strong&gt;Meaning:&lt;/strong&gt; Shows all groups&lt;br&gt;&lt;br&gt;
&lt;strong&gt;Description:&lt;/strong&gt; Displays all group information and members.&lt;/p&gt;




&lt;h3&gt;
  
  
  10. &lt;code&gt;cat /etc/passwd&lt;/code&gt;
&lt;/h3&gt;

&lt;p&gt;&lt;strong&gt;Meaning:&lt;/strong&gt; Shows all users&lt;br&gt;&lt;br&gt;
&lt;strong&gt;Description:&lt;/strong&gt; Displays all user account information.&lt;/p&gt;




&lt;h3&gt;
  
  
  11. &lt;code&gt;cat /etc/shadow&lt;/code&gt;
&lt;/h3&gt;

&lt;p&gt;&lt;strong&gt;Meaning:&lt;/strong&gt; Shows passwords of all users&lt;br&gt;&lt;br&gt;
&lt;strong&gt;Description:&lt;/strong&gt; Displays encrypted passwords and password policy details.&lt;/p&gt;




&lt;h3&gt;
  
  
  12. &lt;code&gt;whoami&lt;/code&gt;
&lt;/h3&gt;

&lt;p&gt;&lt;strong&gt;Meaning:&lt;/strong&gt; Shows current user&lt;br&gt;&lt;br&gt;
&lt;strong&gt;Description:&lt;/strong&gt; Tells you which user you are currently logged in as.&lt;/p&gt;




&lt;h3&gt;
  
  
  13. &lt;code&gt;pwd&lt;/code&gt;
&lt;/h3&gt;

&lt;p&gt;&lt;strong&gt;Meaning:&lt;/strong&gt; Shows current folder&lt;br&gt;&lt;br&gt;
&lt;strong&gt;Description:&lt;/strong&gt; Tells you which directory you are currently in.&lt;/p&gt;




&lt;h3&gt;
  
  
  14. &lt;code&gt;useradd --help&lt;/code&gt;
&lt;/h3&gt;

&lt;p&gt;&lt;strong&gt;Meaning:&lt;/strong&gt; Shows help for &lt;code&gt;useradd&lt;/code&gt;&lt;br&gt;&lt;br&gt;
&lt;strong&gt;Description:&lt;/strong&gt; Displays all options and rules for creating a new user.&lt;/p&gt;




&lt;h3&gt;
  
  
  15. &lt;code&gt;useradd kamal&lt;/code&gt;
&lt;/h3&gt;

&lt;p&gt;&lt;strong&gt;Meaning:&lt;/strong&gt; Creates a new user named &lt;code&gt;kamal&lt;/code&gt;&lt;br&gt;&lt;br&gt;
&lt;strong&gt;Description:&lt;/strong&gt; Creates a user account and a group named &lt;code&gt;kamal&lt;/code&gt;.&lt;/p&gt;




&lt;h3&gt;
  
  
  16. &lt;code&gt;passwd kamal&lt;/code&gt;
&lt;/h3&gt;

&lt;p&gt;&lt;strong&gt;Meaning:&lt;/strong&gt; Sets password for user &lt;code&gt;kamal&lt;/code&gt;&lt;br&gt;&lt;br&gt;
&lt;strong&gt;Description:&lt;/strong&gt; Used to set or change the login password for a user.&lt;/p&gt;




&lt;h3&gt;
  
  
  17. &lt;code&gt;sudo&lt;/code&gt;
&lt;/h3&gt;

&lt;p&gt;&lt;strong&gt;Meaning:&lt;/strong&gt; Run command as superuser&lt;br&gt;&lt;br&gt;
&lt;strong&gt;Description:&lt;/strong&gt; Means "on behalf of the superuser." Not needed if you are already root.&lt;/p&gt;




&lt;h3&gt;
  
  
  18. &lt;code&gt;usermod -s /sbin/nologin kamal&lt;/code&gt;
&lt;/h3&gt;

&lt;p&gt;&lt;strong&gt;Meaning:&lt;/strong&gt; Blocks login for &lt;code&gt;kamal&lt;/code&gt;&lt;br&gt;&lt;br&gt;
&lt;strong&gt;Description:&lt;/strong&gt; Changes the user's shell to nologin so they cannot log in.&lt;/p&gt;




&lt;h3&gt;
  
  
  19. &lt;code&gt;usermod -s /bin/bash kamal&lt;/code&gt;
&lt;/h3&gt;

&lt;p&gt;&lt;strong&gt;Meaning:&lt;/strong&gt; Unblocks login for &lt;code&gt;kamal&lt;/code&gt;&lt;br&gt;&lt;br&gt;
&lt;strong&gt;Description:&lt;/strong&gt; Restores the bash shell so the user can log in again.&lt;/p&gt;




&lt;h3&gt;
  
  
  20. &lt;code&gt;history&lt;/code&gt;
&lt;/h3&gt;

&lt;p&gt;&lt;strong&gt;Meaning:&lt;/strong&gt; Shows previously used commands&lt;br&gt;&lt;br&gt;
&lt;strong&gt;Description:&lt;/strong&gt; Displays a list of commands you have run earlier.&lt;/p&gt;




&lt;h3&gt;
  
  
  21. &lt;code&gt;su kamal&lt;/code&gt;
&lt;/h3&gt;

&lt;p&gt;&lt;strong&gt;Meaning:&lt;/strong&gt; Switch to user &lt;code&gt;kamal&lt;/code&gt;&lt;br&gt;&lt;br&gt;
&lt;strong&gt;Description:&lt;/strong&gt; Logs in or switches to the &lt;code&gt;kamal&lt;/code&gt; user account.&lt;/p&gt;




&lt;h3&gt;
  
  
  22. &lt;code&gt;exit&lt;/code&gt;
&lt;/h3&gt;

&lt;p&gt;&lt;strong&gt;Meaning:&lt;/strong&gt; Ends current session&lt;br&gt;&lt;br&gt;
&lt;strong&gt;Description:&lt;/strong&gt; Closes shell, returns to previous user, or closes terminal.&lt;/p&gt;




&lt;h3&gt;
  
  
  23. &lt;code&gt;usermod -L kamal&lt;/code&gt;
&lt;/h3&gt;

&lt;p&gt;&lt;strong&gt;Meaning:&lt;/strong&gt; Locks &lt;code&gt;kamal&lt;/code&gt; account&lt;br&gt;&lt;br&gt;
&lt;strong&gt;Description:&lt;/strong&gt; Locks the user account by adding &lt;code&gt;!&lt;/code&gt; to the password.&lt;/p&gt;




&lt;h3&gt;
  
  
  24. &lt;code&gt;usermod -U kamal&lt;/code&gt;
&lt;/h3&gt;

&lt;p&gt;&lt;strong&gt;Meaning:&lt;/strong&gt; Unlocks &lt;code&gt;kamal&lt;/code&gt; account&lt;br&gt;&lt;br&gt;
&lt;strong&gt;Description:&lt;/strong&gt; Unlocks the user account by removing &lt;code&gt;!&lt;/code&gt; from the password.&lt;/p&gt;




&lt;h3&gt;
  
  
  25. &lt;code&gt;usermod -e 2026-08-27 kamal&lt;/code&gt;
&lt;/h3&gt;

&lt;p&gt;&lt;strong&gt;Meaning:&lt;/strong&gt; Sets expiry date for &lt;code&gt;kamal&lt;/code&gt;&lt;br&gt;&lt;br&gt;
&lt;strong&gt;Description:&lt;/strong&gt; Account will automatically expire on the given date.&lt;/p&gt;




&lt;h2&gt;
  
  
  Key Concepts
&lt;/h2&gt;

&lt;h3&gt;
  
  
  Group Explanation:
&lt;/h3&gt;

&lt;p&gt;A group is like a WhatsApp group. If you send a message, all members see it. In Linux, you give permissions (read, write, or both) to a group, and all members get that access.&lt;/p&gt;

&lt;h3&gt;
  
  
  User Creation Rules:
&lt;/h3&gt;

&lt;ol&gt;
&lt;li&gt;When you create a user, a group with the same name is automatically created.&lt;/li&gt;
&lt;li&gt;User IDs (UID) start from 1000 by default.&lt;/li&gt;
&lt;/ol&gt;

&lt;h3&gt;
  
  
  Password Status in &lt;code&gt;/etc/shadow&lt;/code&gt;:
&lt;/h3&gt;

&lt;ul&gt;
&lt;li&gt;Password set → shows encrypted text
&lt;/li&gt;
&lt;li&gt;No password → shows &lt;code&gt;!&lt;/code&gt; (account locked)&lt;/li&gt;
&lt;/ul&gt;

&lt;h3&gt;
  
  
  Shell:
&lt;/h3&gt;

&lt;p&gt;A program that:&lt;/p&gt;

&lt;ul&gt;
&lt;li&gt;Takes user commands
&lt;/li&gt;
&lt;li&gt;Tells computer to execute them
&lt;/li&gt;
&lt;li&gt;Shows results
&lt;/li&gt;
&lt;li&gt;Acts as an interface between user and operating system&lt;/li&gt;
&lt;/ul&gt;

&lt;h3&gt;
  
  
  Service Users:
&lt;/h3&gt;

&lt;p&gt;Every service in Linux runs as a user.&lt;/p&gt;




&lt;h2&gt;
  
  
  Quick Reference Table
&lt;/h2&gt;

&lt;div class="table-wrapper-paragraph"&gt;&lt;table&gt;
&lt;thead&gt;
&lt;tr&gt;
&lt;th&gt;Command&lt;/th&gt;
&lt;th&gt;কাজ&lt;/th&gt;
&lt;/tr&gt;
&lt;/thead&gt;
&lt;tbody&gt;
&lt;tr&gt;
&lt;td&gt;&lt;code&gt;mkdir --help&lt;/code&gt;&lt;/td&gt;
&lt;td&gt;mkdir-এর help দেখায়&lt;/td&gt;
&lt;/tr&gt;
&lt;tr&gt;
&lt;td&gt;&lt;code&gt;clear&lt;/code&gt;&lt;/td&gt;
&lt;td&gt;Terminal পরিষ্কার করে&lt;/td&gt;
&lt;/tr&gt;
&lt;tr&gt;
&lt;td&gt;&lt;code&gt;alias c=clear&lt;/code&gt;&lt;/td&gt;
&lt;td&gt;Shortcut তৈরি করে&lt;/td&gt;
&lt;/tr&gt;
&lt;tr&gt;
&lt;td&gt;&lt;code&gt;/etc/shadow&lt;/code&gt;&lt;/td&gt;
&lt;td&gt;Password থাকে&lt;/td&gt;
&lt;/tr&gt;
&lt;tr&gt;
&lt;td&gt;&lt;code&gt;/etc/passwd&lt;/code&gt;&lt;/td&gt;
&lt;td&gt;User info থাকে&lt;/td&gt;
&lt;/tr&gt;
&lt;tr&gt;
&lt;td&gt;&lt;code&gt;/etc/group&lt;/code&gt;&lt;/td&gt;
&lt;td&gt;Group info থাকে&lt;/td&gt;
&lt;/tr&gt;
&lt;tr&gt;
&lt;td&gt;&lt;code&gt;tail -3 /etc/shadow&lt;/code&gt;&lt;/td&gt;
&lt;td&gt;Last 3 lines দেখায়&lt;/td&gt;
&lt;/tr&gt;
&lt;tr&gt;
&lt;td&gt;&lt;code&gt;head -3 /etc/shadow&lt;/code&gt;&lt;/td&gt;
&lt;td&gt;First 3 lines দেখায়&lt;/td&gt;
&lt;/tr&gt;
&lt;tr&gt;
&lt;td&gt;&lt;code&gt;cat /etc/group&lt;/code&gt;&lt;/td&gt;
&lt;td&gt;সব group দেখায়&lt;/td&gt;
&lt;/tr&gt;
&lt;tr&gt;
&lt;td&gt;&lt;code&gt;cat /etc/passwd&lt;/code&gt;&lt;/td&gt;
&lt;td&gt;সব user দেখায়&lt;/td&gt;
&lt;/tr&gt;
&lt;tr&gt;
&lt;td&gt;&lt;code&gt;cat /etc/shadow&lt;/code&gt;&lt;/td&gt;
&lt;td&gt;সব password দেখায়&lt;/td&gt;
&lt;/tr&gt;
&lt;tr&gt;
&lt;td&gt;&lt;code&gt;whoami&lt;/code&gt;&lt;/td&gt;
&lt;td&gt;Current user দেখায়&lt;/td&gt;
&lt;/tr&gt;
&lt;tr&gt;
&lt;td&gt;&lt;code&gt;pwd&lt;/code&gt;&lt;/td&gt;
&lt;td&gt;Current folder দেখায়&lt;/td&gt;
&lt;/tr&gt;
&lt;tr&gt;
&lt;td&gt;&lt;code&gt;useradd --help&lt;/code&gt;&lt;/td&gt;
&lt;td&gt;useradd-এর help দেখায়&lt;/td&gt;
&lt;/tr&gt;
&lt;tr&gt;
&lt;td&gt;&lt;code&gt;useradd kamal&lt;/code&gt;&lt;/td&gt;
&lt;td&gt;নতুন user তৈরি করে&lt;/td&gt;
&lt;/tr&gt;
&lt;tr&gt;
&lt;td&gt;&lt;code&gt;passwd kamal&lt;/code&gt;&lt;/td&gt;
&lt;td&gt;Password set করে&lt;/td&gt;
&lt;/tr&gt;
&lt;tr&gt;
&lt;td&gt;&lt;code&gt;sudo&lt;/code&gt;&lt;/td&gt;
&lt;td&gt;Super user হিসেবে চালায়&lt;/td&gt;
&lt;/tr&gt;
&lt;tr&gt;
&lt;td&gt;&lt;code&gt;usermod -s /sbin/nologin kamal&lt;/code&gt;&lt;/td&gt;
&lt;td&gt;Login বন্ধ করে&lt;/td&gt;
&lt;/tr&gt;
&lt;tr&gt;
&lt;td&gt;&lt;code&gt;usermod -s /bin/bash kamal&lt;/code&gt;&lt;/td&gt;
&lt;td&gt;Login চালু করে&lt;/td&gt;
&lt;/tr&gt;
&lt;tr&gt;
&lt;td&gt;&lt;code&gt;history&lt;/code&gt;&lt;/td&gt;
&lt;td&gt;আগের commands দেখায়&lt;/td&gt;
&lt;/tr&gt;
&lt;tr&gt;
&lt;td&gt;&lt;code&gt;su kamal&lt;/code&gt;&lt;/td&gt;
&lt;td&gt;kamal user-এ switch করে&lt;/td&gt;
&lt;/tr&gt;
&lt;tr&gt;
&lt;td&gt;&lt;code&gt;exit&lt;/code&gt;&lt;/td&gt;
&lt;td&gt;Session বন্ধ করে&lt;/td&gt;
&lt;/tr&gt;
&lt;tr&gt;
&lt;td&gt;&lt;code&gt;usermod -L kamal&lt;/code&gt;&lt;/td&gt;
&lt;td&gt;Account lock করে&lt;/td&gt;
&lt;/tr&gt;
&lt;tr&gt;
&lt;td&gt;&lt;code&gt;usermod -U kamal&lt;/code&gt;&lt;/td&gt;
&lt;td&gt;Account unlock করে&lt;/td&gt;
&lt;/tr&gt;
&lt;tr&gt;
&lt;td&gt;&lt;code&gt;usermod -e DATE kamal&lt;/code&gt;&lt;/td&gt;
&lt;td&gt;Expire date set করে&lt;/td&gt;
&lt;/tr&gt;
&lt;/tbody&gt;
&lt;/table&gt;&lt;/div&gt;

</description>
    </item>
    <item>
      <title>Sense of Data: Histograms, Bell Curves, and Beyond</title>
      <dc:creator>Mujahida Joynab</dc:creator>
      <pubDate>Thu, 20 Aug 2026 14:22:18 +0000</pubDate>
      <link>https://dev.to/mujahida_joynab_64c7407d8/sense-of-data-histograms-bell-curves-and-beyond-3f34</link>
      <guid>https://dev.to/mujahida_joynab_64c7407d8/sense-of-data-histograms-bell-curves-and-beyond-3f34</guid>
      <description>&lt;p&gt;When a histogram is too wide or too narrow, it becomes less useful for understanding the data.&lt;/p&gt;

&lt;p&gt;Both histograms and curves are types of &lt;strong&gt;distributions&lt;/strong&gt;—they show us the &lt;strong&gt;probability of measurements&lt;/strong&gt;.&lt;/p&gt;

&lt;ul&gt;
&lt;li&gt;
&lt;strong&gt;Collecting data&lt;/strong&gt; and plotting it on a graph gives us a &lt;strong&gt;histogram&lt;/strong&gt;.&lt;/li&gt;
&lt;li&gt;
&lt;strong&gt;Extracting insights&lt;/strong&gt; from that graph gives us a &lt;strong&gt;distribution&lt;/strong&gt;.&lt;/li&gt;
&lt;/ul&gt;

&lt;p&gt;&lt;strong&gt;Example:&lt;/strong&gt;&lt;br&gt;&lt;br&gt;
Imagine we collect the heights of all our classmates and plot them on a graph. That graph is the &lt;strong&gt;histogram&lt;/strong&gt;.&lt;/p&gt;

&lt;p&gt;Then, we analyze that graph to find insights, such as:&lt;/p&gt;

&lt;ul&gt;
&lt;li&gt;What is the tallest height?&lt;/li&gt;
&lt;li&gt;What is the shortest height?&lt;/li&gt;
&lt;li&gt;What is the average height?&lt;/li&gt;
&lt;li&gt;Which height does no one have?&lt;/li&gt;
&lt;li&gt;What is the probability of a classmate being exactly 5 feet tall?&lt;/li&gt;
&lt;/ul&gt;

&lt;p&gt;Finding these answers and understanding the overall pattern of the data is what we call the &lt;strong&gt;distribution&lt;/strong&gt;.&lt;/p&gt;




&lt;h3&gt;
  
  
  Normal Distribution
&lt;/h3&gt;

&lt;p&gt;The &lt;strong&gt;Gaussian distribution&lt;/strong&gt;, also known as the &lt;strong&gt;Normal Distribution&lt;/strong&gt;, is shaped like a bell.&lt;/p&gt;

&lt;p&gt;This bell shape occurs because most data points are clustered around the average, while only a few are much higher or lower. As a result, the middle of the graph is tall, and the two sides taper off—just like a bell.&lt;/p&gt;

&lt;ul&gt;
&lt;li&gt;If the data is tightly centered around the average, the bell becomes &lt;strong&gt;narrow&lt;/strong&gt;. This indicates &lt;strong&gt;low variance&lt;/strong&gt;.&lt;/li&gt;
&lt;li&gt;If the data is spread out far from the average, the bell becomes &lt;strong&gt;wide&lt;/strong&gt;. This indicates &lt;strong&gt;high variance&lt;/strong&gt;.&lt;/li&gt;
&lt;/ul&gt;




&lt;h3&gt;
  
  
  Central Limit Theorem
&lt;/h3&gt;

&lt;p&gt;If the histogram is not bell-shaped, we can take samples from different groups.&lt;/p&gt;

&lt;p&gt;Then, we calculate the &lt;strong&gt;average of each group&lt;/strong&gt; and create a new histogram using those averages.&lt;/p&gt;

&lt;p&gt;By doing this, the resulting histogram will tend to form a &lt;strong&gt;bell-shaped curve&lt;/strong&gt;.&lt;/p&gt;

&lt;p&gt;This is known as the &lt;strong&gt;Central Limit Theorem&lt;/strong&gt;.&lt;/p&gt;

&lt;ul&gt;
&lt;li&gt;
&lt;strong&gt;Population:&lt;/strong&gt; When the number of participants equals the total number of individuals we are studying, we refer to them as the &lt;strong&gt;population&lt;/strong&gt;, and their characteristics are called &lt;strong&gt;population parameters&lt;/strong&gt;.&lt;/li&gt;
&lt;/ul&gt;

</description>
    </item>
    <item>
      <title>Blockchain</title>
      <dc:creator>Mujahida Joynab</dc:creator>
      <pubDate>Tue, 11 Aug 2026 23:54:56 +0000</pubDate>
      <link>https://dev.to/mujahida_joynab_64c7407d8/blockchain-m1d</link>
      <guid>https://dev.to/mujahida_joynab_64c7407d8/blockchain-m1d</guid>
      <description>&lt;p&gt;Blockchain is a way of storing data in blocks, which are then linked together to form a chain essentially functioning as a database. It records details like who transferred currency to whom, ensuring that the same currency cannot be spent twice.&lt;/p&gt;

&lt;p&gt;Think of blockchain as a digital ledger. Now, what if someone tries to create a fake ledger? Since this false ledger would be much smaller than the legitimate one because it’s fabricated on the spot—no one in the network would accept or use it.&lt;/p&gt;

&lt;p&gt;At the end of every page (or block) of transactions, a unique hash number is generated. In a blockchain, if one previous hash is altered, it does not automatically change all the previous hashes in the chain.&lt;/p&gt;

</description>
    </item>
    <item>
      <title>Linux Commands</title>
      <dc:creator>Mujahida Joynab</dc:creator>
      <pubDate>Tue, 11 Aug 2026 23:42:47 +0000</pubDate>
      <link>https://dev.to/mujahida_joynab_64c7407d8/linux-commands-4laa</link>
      <guid>https://dev.to/mujahida_joynab_64c7407d8/linux-commands-4laa</guid>
      <description>&lt;p&gt;Navigate — Use cd to move around; cd / goes to root, just cd goes home, and cd /etc/audit jumps straight to that folder.&lt;/p&gt;

&lt;p&gt;Look around — Use ls -l (or ll) to see detailed file lists; add --help to any command when stuck (like ls --help).&lt;/p&gt;

&lt;p&gt;Create things — mkdir folder_name makes a directory, touch file.txt makes an empty file, and vim or nano edits files.&lt;/p&gt;

&lt;p&gt;Configure the system — The /etc/ directory holds all config files; for example, change SSH port in /etc/ssh/sshd_config for better security.&lt;/p&gt;

&lt;p&gt;Remember superpowers — Always use sudo before editing system files (like sudo vim /etc/ssh/sshd_config) to act as admin.&lt;/p&gt;

</description>
    </item>
    <item>
      <title>Network Address Translation</title>
      <dc:creator>Mujahida Joynab</dc:creator>
      <pubDate>Fri, 10 Apr 2026 05:33:55 +0000</pubDate>
      <link>https://dev.to/mujahida_joynab_64c7407d8/network-address-translation-472p</link>
      <guid>https://dev.to/mujahida_joynab_64c7407d8/network-address-translation-472p</guid>
      <description>&lt;p&gt;NET is used due to insufficient number of IPv4 address for all internet connected device&amp;nbsp;.&amp;nbsp;&lt;br&gt;
How NAT&amp;nbsp;Works&amp;nbsp;&lt;/p&gt;

&lt;p&gt;NAT usually lives inside your Router. Here is how it handles your data:&lt;br&gt;
The Request: You sit at your laptop (Private IP: 192.168.1.5) and request to see google.com.&lt;br&gt;
The Translation: Your router receives this request. It knows 192.168.1.5 cannot travel on the public internet. It "translates" your private address into the router's Public IP (e.g., 203.0.113.10).&lt;br&gt;
The Table: The router makes a note in its NAT Translation Table. It records which private device requested which website and through which "Port."&lt;br&gt;
The Response: Google sends the data back to your Public IP. The router checks its table, sees the data is meant for your laptop, and passes it back to 192.168.1.5.&lt;/p&gt;

&lt;p&gt;Types of&amp;nbsp;NAT&lt;br&gt;
There are three main ways NAT is implemented:&lt;br&gt;
Static NAT: Maps one private IP to one public IP. Usually used for servers inside a network that need to be accessed from the outside.&lt;br&gt;
Dynamic NAT: Maps a private IP to a public IP from a group (pool) of available public IPs.&lt;br&gt;
PAT (Port Address Translation): Also known as NAT Overload. This is what you use at home! It allows thousands of devices to share one public IP by assigning each device a unique "Port Number."&lt;/p&gt;

&lt;p&gt;The Benefits of&amp;nbsp;NAT&lt;br&gt;
IP Conservation: We don't need a unique public IP for every single smartphone and tablet on Earth.&lt;br&gt;
Security: NAT acts as a natural firewall. Since your private IP is hidden, hackers on the internet cannot see your device directly; they only see your router's public address.&lt;br&gt;
Flexibility: You can change your internal network setup (add or remove devices) without having to request new IP addresses from your ISP.&lt;/p&gt;

</description>
    </item>
    <item>
      <title>Private IP Addresses</title>
      <dc:creator>Mujahida Joynab</dc:creator>
      <pubDate>Fri, 10 Apr 2026 01:39:57 +0000</pubDate>
      <link>https://dev.to/mujahida_joynab_64c7407d8/private-ip-addresses-2i41</link>
      <guid>https://dev.to/mujahida_joynab_64c7407d8/private-ip-addresses-2i41</guid>
      <description>&lt;p&gt;Private IP address are unique within a Local Area Network . It can connected through router using Network Address Translation(NAT)  . Private IP addresses range&lt;br&gt;
10.0.0.0 - 10.255.255.255 ; which is class A&lt;br&gt;
172.16.0.0 - 172.31.255.255 ; which is class B&lt;br&gt;
192.168.0.0 - 192.168.255.255  ; which is class C&lt;/p&gt;

</description>
    </item>
    <item>
      <title>Subnet mask</title>
      <dc:creator>Mujahida Joynab</dc:creator>
      <pubDate>Mon, 02 Mar 2026 14:58:44 +0000</pubDate>
      <link>https://dev.to/mujahida_joynab_64c7407d8/subnet-mask-4k0d</link>
      <guid>https://dev.to/mujahida_joynab_64c7407d8/subnet-mask-4k0d</guid>
      <description>&lt;p&gt;We understand by subnet mask that which bits are fixed and which bits are changeable (host portion).&lt;br&gt;
Example - 192.168.1.0/24&lt;br&gt;
Here first 24 bits are fixed .&lt;br&gt;
Total Bit = 32 &lt;br&gt;
Rest = 32 - 24 = 8&lt;br&gt;
and 2^8 - 2 = 254 are changable&lt;/p&gt;

&lt;p&gt;Why 2 are subtracted ? &lt;br&gt;
Because 0 and 255 are researved &lt;/p&gt;

&lt;p&gt;0 = Network Address (Reserved )(All host bit 0)&lt;br&gt;
Example: 192.168.1.0&lt;/p&gt;

&lt;p&gt;255=  Broadcast Address (All host bit 1)&lt;br&gt;
Example: 192.168.1.255&lt;/p&gt;

&lt;p&gt;Usable IP range: 192.168.1.1 to 192.168.1.254 (254 addresses)&lt;/p&gt;

</description>
    </item>
    <item>
      <title>Rectified Linear Unit</title>
      <dc:creator>Mujahida Joynab</dc:creator>
      <pubDate>Fri, 13 Feb 2026 14:57:29 +0000</pubDate>
      <link>https://dev.to/mujahida_joynab_64c7407d8/rectified-linear-unit-2207</link>
      <guid>https://dev.to/mujahida_joynab_64c7407d8/rectified-linear-unit-2207</guid>
      <description>&lt;p&gt;ReLU is the most popular activation function in deep learning because it’s super simple and makes AI learn &lt;strong&gt;much faster&lt;/strong&gt;.&lt;/p&gt;

&lt;p&gt;&lt;strong&gt;What it does (main point):&lt;/strong&gt;&lt;/p&gt;

&lt;ul&gt;
&lt;li&gt;Positive input? → Passes it &lt;strong&gt;exactly as is&lt;/strong&gt; to the next layer
&lt;/li&gt;
&lt;li&gt;Negative or zero input? → Outputs &lt;strong&gt;0&lt;/strong&gt; (blocks it, nothing passes)&lt;/li&gt;
&lt;/ul&gt;

&lt;p&gt;&lt;strong&gt;ReLU(x) = max(0, x)&lt;/strong&gt;&lt;/p&gt;

&lt;p&gt;&lt;a href="https://media2.dev.to/dynamic/image/width=800%2Cheight=%2Cfit=scale-down%2Cgravity=auto%2Cformat=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fys1qvdvx23c5z25doucz.png" class="article-body-image-wrapper"&gt;&lt;img src="https://media2.dev.to/dynamic/image/width=800%2Cheight=%2Cfit=scale-down%2Cgravity=auto%2Cformat=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fys1qvdvx23c5z25doucz.png" alt=" " width="800" height="523"&gt;&lt;/a&gt;&lt;/p&gt;

&lt;p&gt;&lt;strong&gt;Why this makes AI learn fast:&lt;/strong&gt;&lt;/p&gt;

&lt;ul&gt;
&lt;li&gt;No "squashing" like old functions (Sigmoid/Tanh) → gradients don’t vanish
&lt;/li&gt;
&lt;li&gt;Very fast to compute (just check if &amp;gt; 0)
&lt;/li&gt;
&lt;li&gt;Many neurons turn off (output 0) → less work, faster training&lt;/li&gt;
&lt;/ul&gt;

&lt;p&gt;&lt;strong&gt;Quick comparison:&lt;/strong&gt;&lt;/p&gt;

&lt;p&gt;&lt;a href="https://media2.dev.to/dynamic/image/width=800%2Cheight=%2Cfit=scale-down%2Cgravity=auto%2Cformat=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fb6i8fls3v7cp56vtbpmh.png" class="article-body-image-wrapper"&gt;&lt;img src="https://media2.dev.to/dynamic/image/width=800%2Cheight=%2Cfit=scale-down%2Cgravity=auto%2Cformat=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fb6i8fls3v7cp56vtbpmh.png" alt=" " width="800" height="533"&gt;&lt;/a&gt;&lt;/p&gt;

&lt;ul&gt;
&lt;li&gt;Sigmoid → slow, vanishing gradient
&lt;/li&gt;
&lt;li&gt;Tanh → better but still slow
&lt;/li&gt;
&lt;li&gt;
&lt;strong&gt;ReLU&lt;/strong&gt; → fast, no vanishing gradient (for positive values)&lt;/li&gt;
&lt;/ul&gt;

&lt;p&gt;That's why almost every modern neural network (CNNs, Transformers, etc.) uses ReLU by default.&lt;/p&gt;

&lt;p&gt;&lt;strong&gt;One small issue:&lt;/strong&gt; Sometimes neurons "die" (always output 0 and stop learning).&lt;br&gt;&lt;br&gt;
Solution: Use Leaky ReLU or similar if needed.&lt;/p&gt;

&lt;p&gt;&lt;strong&gt;Main thing in one line:&lt;/strong&gt;&lt;br&gt;&lt;br&gt;
&lt;strong&gt;ReLU lets only positive signals pass through fully and blocks negative ones → this simple rule makes deep learning train fast and powerful.&lt;/strong&gt; &lt;/p&gt;

</description>
    </item>
    <item>
      <title>Softmax Function</title>
      <dc:creator>Mujahida Joynab</dc:creator>
      <pubDate>Fri, 13 Feb 2026 14:06:41 +0000</pubDate>
      <link>https://dev.to/mujahida_joynab_64c7407d8/softmax-function-1dbm</link>
      <guid>https://dev.to/mujahida_joynab_64c7407d8/softmax-function-1dbm</guid>
      <description>&lt;p&gt;&lt;strong&gt;Softmax&lt;/strong&gt; = a simple trick that turns scores into &lt;strong&gt;probabilities&lt;/strong&gt; (numbers between 0 and 1 that add up to exactly 1).&lt;/p&gt;

&lt;p&gt;Imagine you are waiting for &lt;strong&gt;Bus 49&lt;/strong&gt; and want to guess:&lt;/p&gt;

&lt;ul&gt;
&lt;li&gt;Will there be &lt;strong&gt;lots of empty seats&lt;/strong&gt;?
&lt;/li&gt;
&lt;li&gt;Will there be &lt;strong&gt;only a few empty seats&lt;/strong&gt;?
&lt;/li&gt;
&lt;li&gt;Will there be &lt;strong&gt;no empty seats&lt;/strong&gt; at all?&lt;/li&gt;
&lt;/ul&gt;

&lt;p&gt;We give each situation a “happiness score”:&lt;/p&gt;

&lt;ul&gt;
&lt;li&gt;Lots of empty seats → score &lt;strong&gt;3&lt;/strong&gt; (yay! ❤️)
&lt;/li&gt;
&lt;li&gt;Few empty seats → score &lt;strong&gt;2&lt;/strong&gt; (okay 😐)
&lt;/li&gt;
&lt;li&gt;No empty seats → score &lt;strong&gt;1&lt;/strong&gt; (ugh 😩)&lt;/li&gt;
&lt;/ul&gt;

&lt;p&gt;Now softmax magic happens in just two steps:&lt;/p&gt;

&lt;p&gt;&lt;strong&gt;Step 1:&lt;/strong&gt; Make each score much bigger using &lt;strong&gt;exponential&lt;/strong&gt; (e^score). This makes good things &lt;strong&gt;really stand out&lt;/strong&gt;!&lt;/p&gt;

&lt;ul&gt;
&lt;li&gt;e³ ≈ &lt;strong&gt;20&lt;/strong&gt;
&lt;/li&gt;
&lt;li&gt;e² ≈ &lt;strong&gt;7&lt;/strong&gt;
&lt;/li&gt;
&lt;li&gt;e¹ ≈ &lt;strong&gt;3&lt;/strong&gt;
&lt;/li&gt;
&lt;/ul&gt;

&lt;p&gt;(We use easy round numbers here — actual values are 20.1, 7.4, 2.7, but close enough!)&lt;/p&gt;

&lt;p&gt;&lt;strong&gt;Step 2:&lt;/strong&gt; Add them up and divide to get probabilities.&lt;/p&gt;

&lt;p&gt;Total = 20 + 7 + 3 = &lt;strong&gt;30&lt;/strong&gt;&lt;/p&gt;

&lt;p&gt;Now the chances are:&lt;/p&gt;

&lt;ul&gt;
&lt;li&gt;Lots of empty seats → 20 / 30 = &lt;strong&gt;⅔ ≈ 67%&lt;/strong&gt;
&lt;/li&gt;
&lt;li&gt;Few empty seats → 7 / 30 ≈ &lt;strong&gt;23%&lt;/strong&gt;
&lt;/li&gt;
&lt;li&gt;No empty seats → 3 / 30 = &lt;strong&gt;10%&lt;/strong&gt;
&lt;/li&gt;
&lt;/ul&gt;

&lt;p&gt;→ 67% + 23% + 10% = &lt;strong&gt;100%&lt;/strong&gt; ✓&lt;/p&gt;

&lt;p&gt;That’s it! Softmax just says:&lt;br&gt;&lt;br&gt;
“Turn your scores into chances — the better score gets much more chance, but everyone still gets something, and it all adds to 100%.”&lt;/p&gt;

&lt;h3&gt;
  
  
  The Tiny Formula (you can almost remember it)
&lt;/h3&gt;

&lt;p&gt;For any score z:&lt;/p&gt;

&lt;p&gt;&lt;strong&gt;probability = eᶻ / (sum of e for all scores)&lt;/strong&gt;&lt;/p&gt;

&lt;p&gt;That’s why in apps, games, or AI models (like ChatGPT choosing the next word), the final answer often comes from &lt;strong&gt;softmax&lt;/strong&gt; — it picks the most likely thing, but softly, with percentages.&lt;/p&gt;

</description>
    </item>
    <item>
      <title>What is an Expert System?</title>
      <dc:creator>Mujahida Joynab</dc:creator>
      <pubDate>Sat, 13 Dec 2025 05:50:51 +0000</pubDate>
      <link>https://dev.to/mujahida_joynab_64c7407d8/what-is-an-expert-system-4187</link>
      <guid>https://dev.to/mujahida_joynab_64c7407d8/what-is-an-expert-system-4187</guid>
      <description>&lt;p&gt;Imagine you have a super-smart robot doctor inside a computer. That's kind of what an &lt;strong&gt;Expert System&lt;/strong&gt; is! It's a computer program that knows a lot about something special and can help make decisions—just like a human expert would.&lt;/p&gt;

&lt;h2&gt;
  
  
  🧠 How Does It Work? Think of It Like This:
&lt;/h2&gt;

&lt;p&gt;An Expert System has &lt;strong&gt;two main parts&lt;/strong&gt;:&lt;/p&gt;

&lt;h3&gt;
  
  
  1. &lt;strong&gt;The Knowledge Base&lt;/strong&gt; - The "Brain Library" 📚
&lt;/h3&gt;

&lt;p&gt;This is where all the expert knowledge is stored!&lt;/p&gt;

&lt;ul&gt;
&lt;li&gt;
&lt;strong&gt;Facts&lt;/strong&gt;: Simple truths like:

&lt;ul&gt;
&lt;li&gt;"My temperature is 103°F" 🌡️&lt;/li&gt;
&lt;li&gt;"I have a headache" 🤕&lt;/li&gt;
&lt;/ul&gt;


&lt;/li&gt;

&lt;li&gt;

&lt;strong&gt;Rules&lt;/strong&gt;: "If-Then" instructions that connect facts, like:

&lt;ul&gt;
&lt;li&gt;
&lt;strong&gt;IF&lt;/strong&gt; temperature &amp;gt; 100°F &lt;strong&gt;AND&lt;/strong&gt; headache = yes&lt;/li&gt;
&lt;li&gt;
&lt;strong&gt;THEN&lt;/strong&gt; disease might be fever&lt;/li&gt;
&lt;/ul&gt;


&lt;/li&gt;

&lt;/ul&gt;

&lt;h3&gt;
  
  
  2. &lt;strong&gt;The Inference Engine&lt;/strong&gt; - The "Thinking Machine" ⚙️
&lt;/h3&gt;

&lt;p&gt;This is the problem-solver that uses the knowledge base to figure things out! It works in two cool ways:&lt;/p&gt;

&lt;p&gt;&lt;strong&gt;🔍 Forward Chaining:&lt;/strong&gt; Starting with facts to reach a conclusion&lt;br&gt;
&lt;/p&gt;

&lt;div class="highlight js-code-highlight"&gt;
&lt;pre class="highlight plaintext"&gt;&lt;code&gt;Facts → "I have high temperature" + "I have headache"
        ↓
    Thinking... 🤔
        ↓
Conclusion → "You might have fever!"
&lt;/code&gt;&lt;/pre&gt;

&lt;/div&gt;



&lt;p&gt;&lt;strong&gt;🔍 Backward Chaining:&lt;/strong&gt; Starting with a goal and checking facts&lt;br&gt;
&lt;/p&gt;

&lt;div class="highlight js-code-highlight"&gt;
&lt;pre class="highlight plaintext"&gt;&lt;code&gt;Goal → "Do I have fever?"
        ↓
    What facts do I need? 🤔
        ↓
Check → Do I have high temperature? Yes!
        Do I have headache? Yes!
        ↓
Conclusion → "Yes, you might have fever!"
&lt;/code&gt;&lt;/pre&gt;

&lt;/div&gt;



&lt;h2&gt;
  
  
  🌟 Real-Life Examples You Might Know:
&lt;/h2&gt;

&lt;p&gt;&lt;strong&gt;Medical Help:&lt;/strong&gt; Some computer programs help doctors figure out what illness you might have.&lt;/p&gt;

&lt;p&gt;&lt;strong&gt;Farm Help:&lt;/strong&gt; Programs that help farmers know when to water plants or what fertilizer to use.&lt;/p&gt;

&lt;h2&gt;
  
  
  🛠️ How Do People Make Expert Systems?
&lt;/h2&gt;

&lt;p&gt;&lt;strong&gt;Expert System Shells:&lt;/strong&gt; These are like ready-made toolkits! Programmers add the specific knowledge they need. Some popular ones are:&lt;/p&gt;

&lt;ul&gt;
&lt;li&gt;
&lt;strong&gt;CLIPS&lt;/strong&gt; &lt;/li&gt;
&lt;li&gt;&lt;strong&gt;Jess&lt;/strong&gt;&lt;/li&gt;
&lt;/ul&gt;

&lt;h2&gt;
  
  
  📝 Three Main Ways to Store Knowledge:
&lt;/h2&gt;

&lt;ol&gt;
&lt;li&gt;
&lt;strong&gt;If-Then Rules:&lt;/strong&gt; Like a recipe book of decisions&lt;/li&gt;
&lt;li&gt;
&lt;strong&gt;Decision Trees:&lt;/strong&gt; Like a choose-your-own-adventure book&lt;/li&gt;
&lt;li&gt;
&lt;strong&gt;Frames:&lt;/strong&gt; Like organized file folders with information&lt;/li&gt;
&lt;/ol&gt;

&lt;h2&gt;
  
  
  🔍 Why Are They So Careful?
&lt;/h2&gt;

&lt;p&gt;Good expert systems include:&lt;/p&gt;

&lt;ul&gt;
&lt;li&gt;
&lt;strong&gt;Validation:&lt;/strong&gt; Making sure the information is correct ✅&lt;/li&gt;
&lt;li&gt;
&lt;strong&gt;Explanation:&lt;/strong&gt; Being able to explain &lt;strong&gt;why&lt;/strong&gt; they made a decision (Example: "I think you have fever &lt;strong&gt;because&lt;/strong&gt; your temperature is high &lt;strong&gt;and&lt;/strong&gt; you have a headache")&lt;/li&gt;
&lt;li&gt;
&lt;strong&gt;Data Sensitivity:&lt;/strong&gt; Being careful with private information 🔒&lt;/li&gt;
&lt;/ul&gt;

&lt;h2&gt;
  
  
  💡 Fun Fact:
&lt;/h2&gt;

&lt;p&gt;There's an expert system called &lt;strong&gt;PITUMBERG&lt;/strong&gt; (you might have meant "PITUBERG" or similar) that shows how these systems can help in specific fields!&lt;/p&gt;

&lt;h2&gt;
  
  
  ✨ In a Nutshell:
&lt;/h2&gt;

&lt;p&gt;Expert Systems = &lt;strong&gt;Knowledge Base&lt;/strong&gt; (what it knows) + &lt;strong&gt;Inference Engine&lt;/strong&gt; (how it thinks)&lt;/p&gt;

&lt;p&gt;They help doctors, farmers, engineers, and many others make smart decisions by combining lots of knowledge with logical rules—just like a very helpful robot friend! 🤖💖&lt;/p&gt;

&lt;p&gt;&lt;em&gt;Next time you play a detective game or solve a puzzle, remember—you're thinking a bit like an expert system too!&lt;/em&gt;&lt;/p&gt;

</description>
      <category>ai</category>
      <category>beginners</category>
      <category>computerscience</category>
    </item>
    <item>
      <title>A Complete Guide to Evidence Fusion and Risk Assessment Using Sequential Combination</title>
      <dc:creator>Mujahida Joynab</dc:creator>
      <pubDate>Sat, 13 Dec 2025 05:21:55 +0000</pubDate>
      <link>https://dev.to/mujahida_joynab_64c7407d8/a-complete-guide-to-evidence-fusion-and-risk-assessment-using-sequential-combination-57hi</link>
      <guid>https://dev.to/mujahida_joynab_64c7407d8/a-complete-guide-to-evidence-fusion-and-risk-assessment-using-sequential-combination-57hi</guid>
      <description>&lt;h2&gt;
  
  
  Introduction
&lt;/h2&gt;

&lt;p&gt;In decision-making systems, particularly in risk assessment and analysis, we often face the challenge of combining multiple pieces of evidence into a unified perspective. This blog explores an elegant sequential combination method for fusing evidence values (like 100, 1000, or any number of inputs) to determine risk probabilities across multiple categories—from "Very Very Low" to "Very Very High" risk.&lt;/p&gt;

&lt;h2&gt;
  
  
  The Core Methodology: Sequential Evidence Fusion
&lt;/h2&gt;

&lt;h3&gt;
  
  
  The Sequential Combination Formula
&lt;/h3&gt;

&lt;p&gt;The heart of our approach lies in sequentially combining evidence using a weighted fusion method:&lt;/p&gt;

&lt;ol&gt;
&lt;li&gt;&lt;strong&gt;Start with the first two evidence values (m₁ and m₂)&lt;/strong&gt;&lt;/li&gt;
&lt;li&gt;&lt;strong&gt;Combine them into a single value (C₁)&lt;/strong&gt;&lt;/li&gt;
&lt;li&gt;&lt;strong&gt;Take this combined value and fuse it with the third evidence (m₃) to get C₂&lt;/strong&gt;&lt;/li&gt;
&lt;li&gt;&lt;strong&gt;Continue this process: Cₙ = fuse(Cₙ₋₁, mₙ₊₁)&lt;/strong&gt;&lt;/li&gt;
&lt;li&gt;&lt;strong&gt;Repeat until all evidence is incorporated&lt;/strong&gt;&lt;/li&gt;
&lt;/ol&gt;

&lt;p&gt;This incremental approach allows the system to naturally weigh evidence as it accumulates, creating a dynamic assessment that evolves with each new piece of information.&lt;/p&gt;

&lt;h3&gt;
  
  
  Mathematical Foundation
&lt;/h3&gt;

&lt;p&gt;The combination formula typically follows a pattern that might look like:&lt;br&gt;
&lt;/p&gt;

&lt;div class="highlight js-code-highlight"&gt;
&lt;pre class="highlight plaintext"&gt;&lt;code&gt;C_k = α·C_{k-1} + β·m_k + γ·(C_{k-1}·m_k)
&lt;/code&gt;&lt;/pre&gt;

&lt;/div&gt;



&lt;p&gt;Where coefficients α, β, and γ are tuned based on:&lt;/p&gt;

&lt;ul&gt;
&lt;li&gt;Evidence reliability&lt;/li&gt;
&lt;li&gt;Temporal relevance (if evidence is time-stamped)&lt;/li&gt;
&lt;li&gt;Domain-specific importance factors&lt;/li&gt;
&lt;/ul&gt;

&lt;h3&gt;
  
  
  Normalization: The 1-k Factor
&lt;/h3&gt;

&lt;p&gt;After sequential combination, we apply normalization to ensure our final value falls within a consistent range (typically 0 to 1):&lt;br&gt;
&lt;/p&gt;

&lt;div class="highlight js-code-highlight"&gt;
&lt;pre class="highlight plaintext"&gt;&lt;code&gt;Normalized Value = 1 - k · (some transformation of combined evidence)
&lt;/code&gt;&lt;/pre&gt;

&lt;/div&gt;



&lt;p&gt;Or more generally:&lt;br&gt;
&lt;/p&gt;

&lt;div class="highlight js-code-highlight"&gt;
&lt;pre class="highlight plaintext"&gt;&lt;code&gt;Normalized Score = 1 - f(combined_evidence)
&lt;/code&gt;&lt;/pre&gt;

&lt;/div&gt;



&lt;p&gt;This normalization ensures that higher combined evidence values correspond to higher risk levels, properly scaled for interpretation.&lt;/p&gt;

&lt;h2&gt;
  
  
  Risk Categorization Framework
&lt;/h2&gt;

&lt;p&gt;Our system classifies risk into 11 distinct categories for granular assessment:&lt;/p&gt;

&lt;div class="table-wrapper-paragraph"&gt;&lt;table&gt;
&lt;thead&gt;
&lt;tr&gt;
&lt;th&gt;Risk Level&lt;/th&gt;
&lt;th&gt;Typical Probability Range&lt;/th&gt;
&lt;th&gt;Description&lt;/th&gt;
&lt;/tr&gt;
&lt;/thead&gt;
&lt;tbody&gt;
&lt;tr&gt;
&lt;td&gt;Very Very Low&lt;/td&gt;
&lt;td&gt;0-9%&lt;/td&gt;
&lt;td&gt;Minimal to negligible risk&lt;/td&gt;
&lt;/tr&gt;
&lt;tr&gt;
&lt;td&gt;Very Low&lt;/td&gt;
&lt;td&gt;10-19%&lt;/td&gt;
&lt;td&gt;Low probability of adverse outcomes&lt;/td&gt;
&lt;/tr&gt;
&lt;tr&gt;
&lt;td&gt;Low&lt;/td&gt;
&lt;td&gt;20-29%&lt;/td&gt;
&lt;td&gt;Below average risk&lt;/td&gt;
&lt;/tr&gt;
&lt;tr&gt;
&lt;td&gt;Very Very Medium&lt;/td&gt;
&lt;td&gt;30-39%&lt;/td&gt;
&lt;td&gt;Lower medium risk&lt;/td&gt;
&lt;/tr&gt;
&lt;tr&gt;
&lt;td&gt;Very Medium&lt;/td&gt;
&lt;td&gt;40-49%&lt;/td&gt;
&lt;td&gt;Medium-low risk&lt;/td&gt;
&lt;/tr&gt;
&lt;tr&gt;
&lt;td&gt;Medium&lt;/td&gt;
&lt;td&gt;50-59%&lt;/td&gt;
&lt;td&gt;Average/expected risk level&lt;/td&gt;
&lt;/tr&gt;
&lt;tr&gt;
&lt;td&gt;High Medium&lt;/td&gt;
&lt;td&gt;60-69%&lt;/td&gt;
&lt;td&gt;Medium-high risk&lt;/td&gt;
&lt;/tr&gt;
&lt;tr&gt;
&lt;td&gt;High&lt;/td&gt;
&lt;td&gt;70-79%&lt;/td&gt;
&lt;td&gt;Elevated risk requiring attention&lt;/td&gt;
&lt;/tr&gt;
&lt;tr&gt;
&lt;td&gt;Very High&lt;/td&gt;
&lt;td&gt;80-89%&lt;/td&gt;
&lt;td&gt;Significantly elevated risk&lt;/td&gt;
&lt;/tr&gt;
&lt;tr&gt;
&lt;td&gt;Very Very High&lt;/td&gt;
&lt;td&gt;90-100%&lt;/td&gt;
&lt;td&gt;Critical risk requiring immediate action&lt;/td&gt;
&lt;/tr&gt;
&lt;/tbody&gt;
&lt;/table&gt;&lt;/div&gt;

&lt;h2&gt;
  
  
  Practical Implementation: From Excel to Actionable Insights
&lt;/h2&gt;

&lt;h3&gt;
  
  
  Step 1: Data Preparation
&lt;/h3&gt;

&lt;p&gt;Evidence values stored in Excel (or CSV) format are loaded into the system. These could represent:&lt;/p&gt;

&lt;ul&gt;
&lt;li&gt;Financial transaction amounts&lt;/li&gt;
&lt;li&gt;Security alert scores&lt;/li&gt;
&lt;li&gt;Medical test results&lt;/li&gt;
&lt;li&gt;Quality control measurements&lt;/li&gt;
&lt;li&gt;Any numerical evidence relevant to risk assessment&lt;/li&gt;
&lt;/ul&gt;

&lt;h3&gt;
  
  
  Step 2: Sequential Combination Process
&lt;/h3&gt;



&lt;div class="highlight js-code-highlight"&gt;
&lt;pre class="highlight python"&gt;&lt;code&gt;&lt;span class="k"&gt;def&lt;/span&gt; &lt;span class="nf"&gt;sequential_combine&lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="n"&gt;evidence_list&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt; &lt;span class="n"&gt;alpha&lt;/span&gt;&lt;span class="o"&gt;=&lt;/span&gt;&lt;span class="mf"&gt;0.4&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt; &lt;span class="n"&gt;beta&lt;/span&gt;&lt;span class="o"&gt;=&lt;/span&gt;&lt;span class="mf"&gt;0.4&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt; &lt;span class="n"&gt;gamma&lt;/span&gt;&lt;span class="o"&gt;=&lt;/span&gt;&lt;span class="mf"&gt;0.2&lt;/span&gt;&lt;span class="p"&gt;):&lt;/span&gt;
    &lt;span class="sh"&gt;"""&lt;/span&gt;&lt;span class="s"&gt;
    Sequentially combine evidence using weighted fusion
    &lt;/span&gt;&lt;span class="sh"&gt;"""&lt;/span&gt;
    &lt;span class="k"&gt;if&lt;/span&gt; &lt;span class="nf"&gt;len&lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="n"&gt;evidence_list&lt;/span&gt;&lt;span class="p"&gt;)&lt;/span&gt; &lt;span class="o"&gt;&amp;lt;&lt;/span&gt; &lt;span class="mi"&gt;2&lt;/span&gt;&lt;span class="p"&gt;:&lt;/span&gt;
        &lt;span class="k"&gt;return&lt;/span&gt; &lt;span class="n"&gt;evidence_list&lt;/span&gt;&lt;span class="p"&gt;[&lt;/span&gt;&lt;span class="mi"&gt;0&lt;/span&gt;&lt;span class="p"&gt;]&lt;/span&gt; &lt;span class="k"&gt;if&lt;/span&gt; &lt;span class="n"&gt;evidence_list&lt;/span&gt; &lt;span class="k"&gt;else&lt;/span&gt; &lt;span class="mi"&gt;0&lt;/span&gt;

    &lt;span class="c1"&gt;# Normalize evidence to [0,1] range first
&lt;/span&gt;    &lt;span class="n"&gt;normalized_evidence&lt;/span&gt; &lt;span class="o"&gt;=&lt;/span&gt; &lt;span class="p"&gt;[&lt;/span&gt;&lt;span class="nf"&gt;normalize&lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="n"&gt;e&lt;/span&gt;&lt;span class="p"&gt;)&lt;/span&gt; &lt;span class="k"&gt;for&lt;/span&gt; &lt;span class="n"&gt;e&lt;/span&gt; &lt;span class="ow"&gt;in&lt;/span&gt; &lt;span class="n"&gt;evidence_list&lt;/span&gt;&lt;span class="p"&gt;]&lt;/span&gt;

    &lt;span class="c1"&gt;# Start with first two pieces of evidence
&lt;/span&gt;    &lt;span class="n"&gt;combined&lt;/span&gt; &lt;span class="o"&gt;=&lt;/span&gt; &lt;span class="n"&gt;alpha&lt;/span&gt;&lt;span class="o"&gt;*&lt;/span&gt;&lt;span class="n"&gt;normalized_evidence&lt;/span&gt;&lt;span class="p"&gt;[&lt;/span&gt;&lt;span class="mi"&gt;0&lt;/span&gt;&lt;span class="p"&gt;]&lt;/span&gt; &lt;span class="o"&gt;+&lt;/span&gt; &lt;span class="n"&gt;beta&lt;/span&gt;&lt;span class="o"&gt;*&lt;/span&gt;&lt;span class="n"&gt;normalized_evidence&lt;/span&gt;&lt;span class="p"&gt;[&lt;/span&gt;&lt;span class="mi"&gt;1&lt;/span&gt;&lt;span class="p"&gt;]&lt;/span&gt; &lt;span class="o"&gt;+&lt;/span&gt; &lt;span class="n"&gt;gamma&lt;/span&gt;&lt;span class="o"&gt;*&lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="n"&gt;normalized_evidence&lt;/span&gt;&lt;span class="p"&gt;[&lt;/span&gt;&lt;span class="mi"&gt;0&lt;/span&gt;&lt;span class="p"&gt;]&lt;/span&gt;&lt;span class="o"&gt;*&lt;/span&gt;&lt;span class="n"&gt;normalized_evidence&lt;/span&gt;&lt;span class="p"&gt;[&lt;/span&gt;&lt;span class="mi"&gt;1&lt;/span&gt;&lt;span class="p"&gt;])&lt;/span&gt;

    &lt;span class="c1"&gt;# Sequentially combine with remaining evidence
&lt;/span&gt;    &lt;span class="k"&gt;for&lt;/span&gt; &lt;span class="n"&gt;i&lt;/span&gt; &lt;span class="ow"&gt;in&lt;/span&gt; &lt;span class="nf"&gt;range&lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="mi"&gt;2&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt; &lt;span class="nf"&gt;len&lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="n"&gt;normalized_evidence&lt;/span&gt;&lt;span class="p"&gt;)):&lt;/span&gt;
        &lt;span class="n"&gt;combined&lt;/span&gt; &lt;span class="o"&gt;=&lt;/span&gt; &lt;span class="n"&gt;alpha&lt;/span&gt;&lt;span class="o"&gt;*&lt;/span&gt;&lt;span class="n"&gt;combined&lt;/span&gt; &lt;span class="o"&gt;+&lt;/span&gt; &lt;span class="n"&gt;beta&lt;/span&gt;&lt;span class="o"&gt;*&lt;/span&gt;&lt;span class="n"&gt;normalized_evidence&lt;/span&gt;&lt;span class="p"&gt;[&lt;/span&gt;&lt;span class="n"&gt;i&lt;/span&gt;&lt;span class="p"&gt;]&lt;/span&gt; &lt;span class="o"&gt;+&lt;/span&gt; &lt;span class="n"&gt;gamma&lt;/span&gt;&lt;span class="o"&gt;*&lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="n"&gt;combined&lt;/span&gt;&lt;span class="o"&gt;*&lt;/span&gt;&lt;span class="n"&gt;normalized_evidence&lt;/span&gt;&lt;span class="p"&gt;[&lt;/span&gt;&lt;span class="n"&gt;i&lt;/span&gt;&lt;span class="p"&gt;])&lt;/span&gt;

    &lt;span class="k"&gt;return&lt;/span&gt; &lt;span class="n"&gt;combined&lt;/span&gt;
&lt;/code&gt;&lt;/pre&gt;

&lt;/div&gt;



&lt;h3&gt;
  
  
  Step 3: Risk Probability Calculation
&lt;/h3&gt;



&lt;div class="highlight js-code-highlight"&gt;
&lt;pre class="highlight python"&gt;&lt;code&gt;&lt;span class="k"&gt;def&lt;/span&gt; &lt;span class="nf"&gt;calculate_risk_probabilities&lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="n"&gt;combined_score&lt;/span&gt;&lt;span class="p"&gt;):&lt;/span&gt;
    &lt;span class="sh"&gt;"""&lt;/span&gt;&lt;span class="s"&gt;
    Convert combined score into risk category probabilities
    &lt;/span&gt;&lt;span class="sh"&gt;"""&lt;/span&gt;
    &lt;span class="c1"&gt;# This could use a softmax distribution across categories
&lt;/span&gt;    &lt;span class="c1"&gt;# or a Bayesian approach based on historical data
&lt;/span&gt;    &lt;span class="n"&gt;risk_categories&lt;/span&gt; &lt;span class="o"&gt;=&lt;/span&gt; &lt;span class="p"&gt;[&lt;/span&gt;&lt;span class="sh"&gt;"&lt;/span&gt;&lt;span class="s"&gt;Very Very Low&lt;/span&gt;&lt;span class="sh"&gt;"&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt; &lt;span class="sh"&gt;"&lt;/span&gt;&lt;span class="s"&gt;Very Low&lt;/span&gt;&lt;span class="sh"&gt;"&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt; &lt;span class="sh"&gt;"&lt;/span&gt;&lt;span class="s"&gt;Low&lt;/span&gt;&lt;span class="sh"&gt;"&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt; 
                      &lt;span class="sh"&gt;"&lt;/span&gt;&lt;span class="s"&gt;Very Very Medium&lt;/span&gt;&lt;span class="sh"&gt;"&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt; &lt;span class="sh"&gt;"&lt;/span&gt;&lt;span class="s"&gt;Very Medium&lt;/span&gt;&lt;span class="sh"&gt;"&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt; &lt;span class="sh"&gt;"&lt;/span&gt;&lt;span class="s"&gt;Medium&lt;/span&gt;&lt;span class="sh"&gt;"&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt;
                      &lt;span class="sh"&gt;"&lt;/span&gt;&lt;span class="s"&gt;High Medium&lt;/span&gt;&lt;span class="sh"&gt;"&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt; &lt;span class="sh"&gt;"&lt;/span&gt;&lt;span class="s"&gt;High&lt;/span&gt;&lt;span class="sh"&gt;"&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt; &lt;span class="sh"&gt;"&lt;/span&gt;&lt;span class="s"&gt;Very High&lt;/span&gt;&lt;span class="sh"&gt;"&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt; &lt;span class="sh"&gt;"&lt;/span&gt;&lt;span class="s"&gt;Very Very High&lt;/span&gt;&lt;span class="sh"&gt;"&lt;/span&gt;&lt;span class="p"&gt;]&lt;/span&gt;

    &lt;span class="c1"&gt;# Generate probabilities (example using transformed sigmoid)
&lt;/span&gt;    &lt;span class="n"&gt;base_prob&lt;/span&gt; &lt;span class="o"&gt;=&lt;/span&gt; &lt;span class="nf"&gt;sigmoid_transform&lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="n"&gt;combined_score&lt;/span&gt;&lt;span class="p"&gt;)&lt;/span&gt;

    &lt;span class="c1"&gt;# Distribute probabilities across categories
&lt;/span&gt;    &lt;span class="c1"&gt;# (Implementation depends on specific distribution model)
&lt;/span&gt;    &lt;span class="k"&gt;return&lt;/span&gt; &lt;span class="n"&gt;category_probabilities&lt;/span&gt;
&lt;/code&gt;&lt;/pre&gt;

&lt;/div&gt;



&lt;h2&gt;
  
  
  Synthetic Data Generation
&lt;/h2&gt;

&lt;p&gt;For testing and validation, we can generate synthetic evidence data:&lt;br&gt;
&lt;/p&gt;

&lt;div class="highlight js-code-highlight"&gt;
&lt;pre class="highlight python"&gt;&lt;code&gt;&lt;span class="kn"&gt;import&lt;/span&gt; &lt;span class="n"&gt;numpy&lt;/span&gt; &lt;span class="k"&gt;as&lt;/span&gt; &lt;span class="n"&gt;np&lt;/span&gt;
&lt;span class="kn"&gt;import&lt;/span&gt; &lt;span class="n"&gt;pandas&lt;/span&gt; &lt;span class="k"&gt;as&lt;/span&gt; &lt;span class="n"&gt;pd&lt;/span&gt;

&lt;span class="k"&gt;def&lt;/span&gt; &lt;span class="nf"&gt;generate_synthetic_evidence&lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="n"&gt;num_samples&lt;/span&gt;&lt;span class="o"&gt;=&lt;/span&gt;&lt;span class="mi"&gt;1000&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt; &lt;span class="n"&gt;num_evidence_points&lt;/span&gt;&lt;span class="o"&gt;=&lt;/span&gt;&lt;span class="mi"&gt;50&lt;/span&gt;&lt;span class="p"&gt;):&lt;/span&gt;
    &lt;span class="sh"&gt;"""&lt;/span&gt;&lt;span class="s"&gt;
    Generate realistic synthetic evidence data
    &lt;/span&gt;&lt;span class="sh"&gt;"""&lt;/span&gt;
    &lt;span class="n"&gt;data&lt;/span&gt; &lt;span class="o"&gt;=&lt;/span&gt; &lt;span class="p"&gt;[]&lt;/span&gt;

    &lt;span class="k"&gt;for&lt;/span&gt; &lt;span class="n"&gt;_&lt;/span&gt; &lt;span class="ow"&gt;in&lt;/span&gt; &lt;span class="nf"&gt;range&lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="n"&gt;num_samples&lt;/span&gt;&lt;span class="p"&gt;):&lt;/span&gt;
        &lt;span class="c1"&gt;# Generate evidence with different patterns
&lt;/span&gt;        &lt;span class="n"&gt;pattern_type&lt;/span&gt; &lt;span class="o"&gt;=&lt;/span&gt; &lt;span class="n"&gt;np&lt;/span&gt;&lt;span class="p"&gt;.&lt;/span&gt;&lt;span class="n"&gt;random&lt;/span&gt;&lt;span class="p"&gt;.&lt;/span&gt;&lt;span class="nf"&gt;choice&lt;/span&gt;&lt;span class="p"&gt;([&lt;/span&gt;&lt;span class="sh"&gt;'&lt;/span&gt;&lt;span class="s"&gt;random&lt;/span&gt;&lt;span class="sh"&gt;'&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt; &lt;span class="sh"&gt;'&lt;/span&gt;&lt;span class="s"&gt;trending_up&lt;/span&gt;&lt;span class="sh"&gt;'&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt; &lt;span class="sh"&gt;'&lt;/span&gt;&lt;span class="s"&gt;trending_down&lt;/span&gt;&lt;span class="sh"&gt;'&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt; &lt;span class="sh"&gt;'&lt;/span&gt;&lt;span class="s"&gt;spiky&lt;/span&gt;&lt;span class="sh"&gt;'&lt;/span&gt;&lt;span class="p"&gt;])&lt;/span&gt;

        &lt;span class="k"&gt;if&lt;/span&gt; &lt;span class="n"&gt;pattern_type&lt;/span&gt; &lt;span class="o"&gt;==&lt;/span&gt; &lt;span class="sh"&gt;'&lt;/span&gt;&lt;span class="s"&gt;random&lt;/span&gt;&lt;span class="sh"&gt;'&lt;/span&gt;&lt;span class="p"&gt;:&lt;/span&gt;
            &lt;span class="n"&gt;evidence&lt;/span&gt; &lt;span class="o"&gt;=&lt;/span&gt; &lt;span class="n"&gt;np&lt;/span&gt;&lt;span class="p"&gt;.&lt;/span&gt;&lt;span class="n"&gt;random&lt;/span&gt;&lt;span class="p"&gt;.&lt;/span&gt;&lt;span class="nf"&gt;uniform&lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="mi"&gt;0&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt; &lt;span class="mi"&gt;1000&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt; &lt;span class="n"&gt;num_evidence_points&lt;/span&gt;&lt;span class="p"&gt;)&lt;/span&gt;
        &lt;span class="k"&gt;elif&lt;/span&gt; &lt;span class="n"&gt;pattern_type&lt;/span&gt; &lt;span class="o"&gt;==&lt;/span&gt; &lt;span class="sh"&gt;'&lt;/span&gt;&lt;span class="s"&gt;trending_up&lt;/span&gt;&lt;span class="sh"&gt;'&lt;/span&gt;&lt;span class="p"&gt;:&lt;/span&gt;
            &lt;span class="n"&gt;base&lt;/span&gt; &lt;span class="o"&gt;=&lt;/span&gt; &lt;span class="n"&gt;np&lt;/span&gt;&lt;span class="p"&gt;.&lt;/span&gt;&lt;span class="n"&gt;random&lt;/span&gt;&lt;span class="p"&gt;.&lt;/span&gt;&lt;span class="nf"&gt;uniform&lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="mi"&gt;0&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt; &lt;span class="mi"&gt;500&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt; &lt;span class="n"&gt;num_evidence_points&lt;/span&gt;&lt;span class="p"&gt;)&lt;/span&gt;
            &lt;span class="n"&gt;trend&lt;/span&gt; &lt;span class="o"&gt;=&lt;/span&gt; &lt;span class="n"&gt;np&lt;/span&gt;&lt;span class="p"&gt;.&lt;/span&gt;&lt;span class="nf"&gt;linspace&lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="mi"&gt;0&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt; &lt;span class="mi"&gt;500&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt; &lt;span class="n"&gt;num_evidence_points&lt;/span&gt;&lt;span class="p"&gt;)&lt;/span&gt;
            &lt;span class="n"&gt;evidence&lt;/span&gt; &lt;span class="o"&gt;=&lt;/span&gt; &lt;span class="n"&gt;base&lt;/span&gt; &lt;span class="o"&gt;+&lt;/span&gt; &lt;span class="n"&gt;trend&lt;/span&gt;
        &lt;span class="k"&gt;elif&lt;/span&gt; &lt;span class="n"&gt;pattern_type&lt;/span&gt; &lt;span class="o"&gt;==&lt;/span&gt; &lt;span class="sh"&gt;'&lt;/span&gt;&lt;span class="s"&gt;trending_down&lt;/span&gt;&lt;span class="sh"&gt;'&lt;/span&gt;&lt;span class="p"&gt;:&lt;/span&gt;
            &lt;span class="n"&gt;base&lt;/span&gt; &lt;span class="o"&gt;=&lt;/span&gt; &lt;span class="n"&gt;np&lt;/span&gt;&lt;span class="p"&gt;.&lt;/span&gt;&lt;span class="n"&gt;random&lt;/span&gt;&lt;span class="p"&gt;.&lt;/span&gt;&lt;span class="nf"&gt;uniform&lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="mi"&gt;0&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt; &lt;span class="mi"&gt;500&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt; &lt;span class="n"&gt;num_evidence_points&lt;/span&gt;&lt;span class="p"&gt;)&lt;/span&gt;
            &lt;span class="n"&gt;trend&lt;/span&gt; &lt;span class="o"&gt;=&lt;/span&gt; &lt;span class="n"&gt;np&lt;/span&gt;&lt;span class="p"&gt;.&lt;/span&gt;&lt;span class="nf"&gt;linspace&lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="mi"&gt;500&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt; &lt;span class="mi"&gt;0&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt; &lt;span class="n"&gt;num_evidence_points&lt;/span&gt;&lt;span class="p"&gt;)&lt;/span&gt;
            &lt;span class="n"&gt;evidence&lt;/span&gt; &lt;span class="o"&gt;=&lt;/span&gt; &lt;span class="n"&gt;base&lt;/span&gt; &lt;span class="o"&gt;+&lt;/span&gt; &lt;span class="n"&gt;trend&lt;/span&gt;
        &lt;span class="k"&gt;else&lt;/span&gt;&lt;span class="p"&gt;:&lt;/span&gt;  &lt;span class="c1"&gt;# spiky
&lt;/span&gt;            &lt;span class="n"&gt;evidence&lt;/span&gt; &lt;span class="o"&gt;=&lt;/span&gt; &lt;span class="n"&gt;np&lt;/span&gt;&lt;span class="p"&gt;.&lt;/span&gt;&lt;span class="n"&gt;random&lt;/span&gt;&lt;span class="p"&gt;.&lt;/span&gt;&lt;span class="nf"&gt;exponential&lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="mi"&gt;200&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt; &lt;span class="n"&gt;num_evidence_points&lt;/span&gt;&lt;span class="p"&gt;)&lt;/span&gt;
            &lt;span class="n"&gt;spikes&lt;/span&gt; &lt;span class="o"&gt;=&lt;/span&gt; &lt;span class="n"&gt;np&lt;/span&gt;&lt;span class="p"&gt;.&lt;/span&gt;&lt;span class="n"&gt;random&lt;/span&gt;&lt;span class="p"&gt;.&lt;/span&gt;&lt;span class="nf"&gt;choice&lt;/span&gt;&lt;span class="p"&gt;([&lt;/span&gt;&lt;span class="mi"&gt;0&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt; &lt;span class="mi"&gt;1&lt;/span&gt;&lt;span class="p"&gt;],&lt;/span&gt; &lt;span class="n"&gt;num_evidence_points&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt; &lt;span class="n"&gt;p&lt;/span&gt;&lt;span class="o"&gt;=&lt;/span&gt;&lt;span class="p"&gt;[&lt;/span&gt;&lt;span class="mf"&gt;0.9&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt; &lt;span class="mf"&gt;0.1&lt;/span&gt;&lt;span class="p"&gt;])&lt;/span&gt;
            &lt;span class="n"&gt;evidence&lt;/span&gt; &lt;span class="o"&gt;=&lt;/span&gt; &lt;span class="n"&gt;evidence&lt;/span&gt; &lt;span class="o"&gt;*&lt;/span&gt; &lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="mi"&gt;1&lt;/span&gt; &lt;span class="o"&gt;+&lt;/span&gt; &lt;span class="n"&gt;spikes&lt;/span&gt; &lt;span class="o"&gt;*&lt;/span&gt; &lt;span class="n"&gt;np&lt;/span&gt;&lt;span class="p"&gt;.&lt;/span&gt;&lt;span class="n"&gt;random&lt;/span&gt;&lt;span class="p"&gt;.&lt;/span&gt;&lt;span class="nf"&gt;uniform&lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="mi"&gt;1&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt; &lt;span class="mi"&gt;5&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt; &lt;span class="n"&gt;num_evidence_points&lt;/span&gt;&lt;span class="p"&gt;))&lt;/span&gt;

        &lt;span class="n"&gt;data&lt;/span&gt;&lt;span class="p"&gt;.&lt;/span&gt;&lt;span class="nf"&gt;append&lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="n"&gt;evidence&lt;/span&gt;&lt;span class="p"&gt;)&lt;/span&gt;

    &lt;span class="k"&gt;return&lt;/span&gt; &lt;span class="n"&gt;pd&lt;/span&gt;&lt;span class="p"&gt;.&lt;/span&gt;&lt;span class="nc"&gt;DataFrame&lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="n"&gt;data&lt;/span&gt;&lt;span class="p"&gt;)&lt;/span&gt;
&lt;/code&gt;&lt;/pre&gt;

&lt;/div&gt;



&lt;h2&gt;
  
  
  Real-World Applications
&lt;/h2&gt;

&lt;h3&gt;
  
  
  1. &lt;strong&gt;Financial Fraud Detection&lt;/strong&gt;
&lt;/h3&gt;

&lt;p&gt;Combine multiple transaction alerts (amount, frequency, location mismatch) into a unified risk score.&lt;/p&gt;

&lt;h3&gt;
  
  
  2. &lt;strong&gt;Healthcare Diagnostics&lt;/strong&gt;
&lt;/h3&gt;

&lt;p&gt;Fuse various test results and symptoms to assess disease probability.&lt;/p&gt;

&lt;h3&gt;
  
  
  3. &lt;strong&gt;Cybersecurity Threat Assessment&lt;/strong&gt;
&lt;/h3&gt;

&lt;p&gt;Combine network anomalies, failed login attempts, and suspicious file activities into a comprehensive threat level.&lt;/p&gt;

&lt;h3&gt;
  
  
  4. &lt;strong&gt;Quality Control in Manufacturing&lt;/strong&gt;
&lt;/h3&gt;

&lt;p&gt;Fuse multiple sensor readings from production lines to predict defect probability.&lt;/p&gt;

&lt;h2&gt;
  
  
  Advantages of Sequential Combination
&lt;/h2&gt;

&lt;ol&gt;
&lt;li&gt;
&lt;strong&gt;Incremental Updates&lt;/strong&gt;: New evidence can be added without reprocessing all historical data&lt;/li&gt;
&lt;li&gt;
&lt;strong&gt;Computational Efficiency&lt;/strong&gt;: O(n) complexity for n evidence points&lt;/li&gt;
&lt;li&gt;
&lt;strong&gt;Interpretability&lt;/strong&gt;: Each combination step can be logged and analyzed&lt;/li&gt;
&lt;li&gt;
&lt;strong&gt;Adaptability&lt;/strong&gt;: Weights can be adjusted based on evidence reliability&lt;/li&gt;
&lt;li&gt;
&lt;strong&gt;Memory Efficiency&lt;/strong&gt;: Only need to store the current combined value, not all historical evidence&lt;/li&gt;
&lt;/ol&gt;

&lt;h2&gt;
  
  
  Challenges and Considerations
&lt;/h2&gt;

&lt;ol&gt;
&lt;li&gt;
&lt;strong&gt;Order Sensitivity&lt;/strong&gt;: Sequential combination may be order-dependent&lt;/li&gt;
&lt;li&gt;
&lt;strong&gt;Weight Calibration&lt;/strong&gt;: Optimal α, β, γ values require careful tuning&lt;/li&gt;
&lt;li&gt;
&lt;strong&gt;Normalization Consistency&lt;/strong&gt;: Ensuring consistent scaling across different evidence types&lt;/li&gt;
&lt;li&gt;
&lt;strong&gt;Category Thresholds&lt;/strong&gt;: Defining clear boundaries between risk levels&lt;/li&gt;
&lt;/ol&gt;

&lt;h2&gt;
  
  
  Conclusion
&lt;/h2&gt;

&lt;p&gt;The sequential evidence fusion approach provides a robust, scalable framework for combining thousands of evidence points into coherent risk assessments. By normalizing results and distributing probabilities across granular risk categories (from "Very Very Low" to "Very Very High"), decision-makers gain nuanced insights that support better risk management decisions.&lt;/p&gt;

&lt;p&gt;Whether you're working with 100 or 100,000 evidence points in Excel, this methodology transforms raw data into actionable intelligence, enabling organizations to make informed decisions in uncertain environments.&lt;/p&gt;

&lt;p&gt;&lt;strong&gt;Key Takeaway&lt;/strong&gt;: The power of this approach lies not in any single piece of evidence, but in the sophisticated fusion of all available information, progressively refined through sequential combination to reveal the true underlying risk profile.&lt;/p&gt;

</description>
    </item>
    <item>
      <title>CSS</title>
      <dc:creator>Mujahida Joynab</dc:creator>
      <pubDate>Sat, 22 Nov 2025 12:08:39 +0000</pubDate>
      <link>https://dev.to/mujahida_joynab_64c7407d8/css-42ep</link>
      <guid>https://dev.to/mujahida_joynab_64c7407d8/css-42ep</guid>
      <description>&lt;p&gt;Font -&amp;gt; Google font&lt;br&gt;
Icon -&amp;gt; Font Awesome cdn &lt;br&gt;
For Responsiveness&lt;/p&gt;

&lt;p&gt;flex-wrap : wrap &lt;/p&gt;



&lt;h1&gt; Hello Banner &lt;/h1&gt;

&lt;p&gt; Lorem ipsum &lt;/p&gt;

</description>
      <category>css</category>
      <category>frontend</category>
      <category>html</category>
    </item>
  </channel>
</rss>
