<p>Fractional-Order Bioconvection in Trihybrid Nanofluids Flowing Over a Rotating Disk: A Hybrid Neural Network With Genetic Algorithm Method for Entropy Generation Minimization</p> : Minimizing entropy generation in complex fluid systems is a primary concern for improving thermodynamic efficiency. This paper investigates bioconvection in a Carreau-Yasuda trihybrid nanofluid over a spinning disk, where fluid memory is modeled using fractional-order derivatives. We provide an analytical energy-based stability framework for the proposed model. Given the high computational cost associated with solving fractional partial differential equations, we propose a Hybrid Neural Network surrogate model combined with a Genetic Algorithm. The Hybrid Neural Network, trained on data obtained via the Finite Difference Method, accurately predicts Nusselt numbers and entropy generation, while the Genetic Algorithm navigates the response surface to identify Pareto-optimal solutions. A deep cas...
Posts
Fractional-Order Bioconvection in Trihybrid Nanofluids Flowing Over a Rotating Disk: A Hybrid Neural Network With Genetic Algorithm Method for Entropy Generation Minimization
- Get link
- X
- Other Apps
<p>Fractional-Order Bioconvection in Trihybrid Nanofluids Flowing Over a Rotating Disk: A Hybrid Neural Network With Genetic Algorithm Method for Entropy Generation Minimization</p> : Minimizing entropy generation in complex fluid systems is a primary concern for improving thermodynamic efficiency. This paper investigates bioconvection in a Carreau-Yasuda trihybrid nanofluid over a spinning disk, where fluid memory is modeled using fractional-order derivatives. We provide an analytical energy-based stability framework for the proposed model. Given the high computational cost associated with solving fractional partial differential equations, we propose a Hybrid Neural Network surrogate model combined with a Genetic Algorithm. The Hybrid Neural Network, trained on data obtained via the Finite Difference Method, accurately predicts Nusselt numbers and entropy generation, while the Genetic Algorithm navigates the response surface to identify Pareto-optimal solutions. A deep cas...
Understanding the Efficacy of Over-Parameterization in Neural Networks
- Get link
- X
- Other Apps
Understanding the Efficacy of Over-Parameterization in Neural Networks Understanding the Efficacy of Over-Parameterization in Neural Networks: Mechanisms, Theories, and Practical Implications Introduction Deep neural networks (DNNs) have become the cornerstone of modern artificial intelligence, driving advancements in computer vision, natural language processing, and myriad other domains. A key, albeit counter-intuitive, property of contemporary DNNs is their immense over-parameterization: these models often contain orders of magnitude more parameters than the number of training examples, yet they generalize remarkably well to unseen data. This phenomenon stands in stark contrast to classical statistical learning theory, which posits that models with excessive complexity relative to the available data are prone to overfitting and poor generalization. Intriguingly, empirical evidence shows that increasing the number of parameters in DNNs can lead ...
Generalization in Extreme Over-Parameterization: Reconciling Expressivity, Efficiency, Robustness, and Fairness in Modern Neural Networks
- Get link
- X
- Other Apps
Generalization in Extreme Over-Parameterization Generalization in Extreme Over-Parameterization: Reconciling Expressivity, Efficiency, Robustness, and Fairness in Modern Neural Networks Introduction The advent of deep learning has been marked by an unprecedented proliferation of over-parameterized models—neural networks whose parameter counts far exceed the number of training data points. This paradigm shift, initially counterintuitive given classical statistical wisdom, has yielded models of remarkable expressivity and performance. Far from being a liability, extreme over-parameterization—when properly harnessed via training dynamics, regularization, and architectural design—not only enables adaptation to complex data structures but also assists models in escaping spurious local minima, achieving state-of-the-art results on challenging tasks (Liu et al., 2021; Xu et al., 2018; Li & Lin, 2024). However, the very properties that empower these...
Neural Network Generalization in the Over-Parameterization Regime: Mechanisms, Benefits, and Limitations
- Get link
- X
- Other Apps
Neural Network Generalization in the Over-Parameterization Regime: Mechanisms, Benefits, and Limitations Neural Network Generalization in the Over-Parameterization Regime: Mechanisms, Benefits, and Limitations Introduction Over the past decade, deep neural networks (DNNs) have risen to prominence across a range of machine learning applications, achieving remarkable performance in domains such as computer vision, natural language processing, and reinforcement learning. A striking and counter-intuitive feature of modern DNNs is their propensity for over-parameterization: models often contain many more parameters than training samples, far exceeding the classical regime where statistical learning theory would predict rampant overfitting and poor generalization. Yet, these highly over-parameterized models not only fit the training data perfectly but also display outstanding generalization to unseen test data—often improving as the number of paramete...
Heuristic Computation and the Discovery of Mersenne Primes
- Get link
- X
- Other Apps
Heuristic Computation and the Discovery of Mersenne Primes Heuristic Computation and the Discovery of Mersenne Primes “Where Strategy Meets Infinity: The Quest for Mersenne Primes” Introduction: The Dance of Numbers and Heuristics Mersenne primes are not just numbers—they are milestones in the vast landscape of mathematics. Defined by the formula: \[ M_p = 2^p - 1 \] where \( p \) is itself prime, these giants challenge our computational limits and inspire new methods of discovery. But why are these primes so elusive? As \( p \) grows, the numbers become astronomically large, making brute-force testing impossible. This is where heuristic computation steps in—guiding us with smart, experience-driven strategies. “In the infinite sea of numbers, heuristics are our compass.” Let’s explore how heuristics and algorithms intertwine to unveil these mathematical treasures. 1. Mersenne Primes — Giants of Number Theory Definition: Numbers of the form \( M_p = 2^p - 1 \...
Branches of Mathematics — An Era, A Need, A Vision
- Get link
- X
- Other Apps
Branches of Mathematics — An Era, A Need, A Vision Branches of Mathematics — An Era, A Need, A Vision “From Counting Bones to Quantum Codes: How Mathematics Grew With Us” Introduction: When Numbers Became Thought Mathematics is not just a subject—it is the deep structure of human understanding. It is how we measured our world, predicted the stars, built civilizations, and now, decode the fabric of the universe. But mathematics wasn’t born complete. It evolved—branch by branch, era by era—guided by human needs, intuition, and imagination. Each mathematical branch emerged in response to a question: “How many?”, “How far?”, “How fast?”, “What if?”, and finally, “Why?” Let us walk through this evolutionary timeline, and explore how each branch of mathematics wasn’t just a discovery—it was a moment of human transformation. 1. Arithmetic — The Language of Counting Origin: Prehistoric era (~35,000 BCE) Need: Counting objects, tr...
Ramanujan’s Pi: A Legacy That Computes Beyond Time
- Get link
- X
- Other Apps
Ramanujan’s Pi: A Legacy That Computes Beyond Time Ramanujan’s Pi: A Legacy That Computes Beyond Time In the Quiet Corridors of Mathematical History Few names echo with the depth and mystery of Srinivasa Ramanujan. Born in 1887 in southern India, he carried within him a universe of intuition—one that would later reshape how we understand numbers, patterns, and the very fabric of mathematical truth. Among his many contributions, one stands out for its elegance and enduring impact: his formulas for calculating π (pi). Not just approximations, but astonishingly efficient infinite series that converge with breathtaking speed. These weren’t derived from textbooks or formal training—they emerged from a mind that saw mathematics as a living language. Why Pi? Why Ramanujan? Pi is more than a constant. It’s a symbol of continuity, curvature, and the infinite. For centuries, mathematicians chipped away at its digits, seeking p...
Popular posts from this blog
Free Field Operator: Building Quantum Fields
Free Field Operator: Building Quantum Fields How Quantum Fields Evolve Without Interactions 🎯 Our Goal We aim to construct the free scalar field operator \( A(x,t) \), which describes a quantum field with no interactions—just free particles moving across space-time. 🧠 Starting Expression This is the mathematical formula for our field \( A(x,t) \): \[ A(x, t) = \frac{1}{(2\pi)^{3/2}} \int_{\mathbb{R}^3} \frac{1}{\sqrt{k_0}} \left[ e^{i(k \cdot x - k_0 t)} a(k) + e^{-i(k \cdot x - k_0 t)} a^\dagger(k) \right] \, dk \] x: Spatial position t: Time k: Momentum vector k₀ = √(k² + m²): Relativistic energy of the particle a(k): Operator that removes a particle (annihilation) a†(k): Operator that adds a particle (creation) 🧩 What Does This Mean? The field is made up of wave patterns (Fourier modes) linked to momentum \( k \). It behaves like a system that decides when and where ...
Understanding the Laplacian of 1/r and the Dirac Delta Function Mathematical Foundations & SageMath Insights
Unmasking the Laplacian: How Mathematics, Physics & AI Use This Powerful Operator Unveiling the Laplacian's Secrets: A Look at 1/r with SageMath Engage & Explore! Before we dive into the math, ask yourself: What does it mean when a function explodes to infinity at a point? Leave your thoughts in the comments below. We'll revisit this after exploring the Dirac delta function! Why Is the Laplacian of \( \frac{1}{r} \) Important? The function \( \frac{1}{r} \) frequently appears in physics to describe potentials like gravity and electrostatics, which depend inversely on distance. Understanding its Laplacian reveals the nature of sources concentrated at singular points. Mathematical Foundation: What Is the Laplacian and a Harmonic Function? The Laplacian operat...
Heuristic Computation and the Discovery of Mersenne Primes
Heuristic Computation and the Discovery of Mersenne Primes Heuristic Computation and the Discovery of Mersenne Primes “Where Strategy Meets Infinity: The Quest for Mersenne Primes” Introduction: The Dance of Numbers and Heuristics Mersenne primes are not just numbers—they are milestones in the vast landscape of mathematics. Defined by the formula: \[ M_p = 2^p - 1 \] where \( p \) is itself prime, these giants challenge our computational limits and inspire new methods of discovery. But why are these primes so elusive? As \( p \) grows, the numbers become astronomically large, making brute-force testing impossible. This is where heuristic computation steps in—guiding us with smart, experience-driven strategies. “In the infinite sea of numbers, heuristics are our compass.” Let’s explore how heuristics and algorithms intertwine to unveil these mathematical treasures. 1. Mersenne Primes — Giants of Number Theory Definition: Numbers of the form \( M_p = 2^p - 1 \...