Code for Computer Science

Jaya Algorithm || JAYA OPTIMIZATION ALGORITHM   Jaya: An Advanced Optimization Algorithm. Video Timestamp's: Basic Introduction: 00:00 JAYA Algorithm Example: 00:55 JAYA Algorithm Application Areas: 05:07 JAYA Algorithm Mathematical Model: 05:25 JAYA Algorithm Pseudocode: 07:56 JAYA Algorithm is very simple and new optimization algorithm used for solving constrained and unconstrained optimization problems. It is Simple, Unique and Powerful Optimization Algorithm. JAYA algorithm is introduced by R.V. Rao in 2016. JAYA is a SANSKRIT word it means VICTORY. That's why this algorithm always tries to get closer to the source (i.e., reaching the BEST Solution) and at the same time tries to avoid the WORST Solution. All values at the end of iteration are maintained and these values become the INPUT to the next iteration. JAYA Algorithm is simpler than TLBO (Teaching Learning Based Optimization) algorithm. Author also compared this algorithm with latest approaches and found JAYA a...

Constrained Engineering Optimization Problems In this video, we applied different Metaheuristic Optimization Algorithms on 3 different Constrained Engineering Design Optimization Problems E01, E02 and E03. E01: Welded beam design problem. E02: Speed Reducer design optimization problem. E03: Tension/Compression spring design optimization problem. All constrained engineering optimization problems have different Objective function, Decision variables and Constraints. We did not try to optimize SSA parameters, for each problem constraints are directly handled [it means IF Solution can not satisfy the constraints – we will consider it Infeasible Solution]. Three engineering problems are solved using Sparrow Search Algorithm (SSA). We also compared the results with respect to 3 Metaheuristic Algorithms: Particle Swarm Optimization Algorithm (PSO), Grey Wolf Optimization Algorithm (GWO) and Teaching Leaning Based Optimization Algorithm (TLBO). When we compared SSA with other algorithms, the p...

Metaheuristic Optimization Algorithms in Big Data, Web Mining and Text Clustering. Metaheuristic optimization algorithms are best swarm intelligence methods and widely used today in Big Data, Web Mining AND Text clustering. Using metaheuristic optimization algorithms we can solve complex Machine Learning problems.  Clustering: Clustering is a common text mining technique. We can used clustering technique for the representation of Dataset that contain similarities between objects. We can use clustering in Web mining, Image Processing, Sentiment Analysis, Data Clustering, Text document clustering, and Text classification. Clustering technique is classified into 3 classes: 1.) Overlapping 2.) Partitioning 3.) Hierarchical  In Partitioning Process we can use metaheuristic optimization approaches. Partitioning process is used for the transformation of any given problem into optimization problem. Partitioning process is based on either minimization or maximization. Partitioning meth...

Bacterial Foraging Optimization Algorithm (BFOA)  Bacterial Foraging Optimization Algorithm is a recently developed nature-inspired optimization algorithm, which is based on the foraging behavior of Escherichia coli or E. coli bacteria. Bacterial Foraging Optimization Algorithm Advantages: 1.) Used to solve Engineering Problems. 2.) Used to Solve complex real world Optimization Problems. About Escherichia coli or E. coli bacteria. Escherichia coli or E. coli bacteria lives in our intestine and they are also found in the gut of some animals. Most of the Escherichia coli or E. coli bacteria are harmless. But some can cause Diarrhoea, if you eat contaminated food or drink fouled water. Escherichia coli or E. coli bacteria is mainly associated with Food positioning, Urinary Tract Infection (UTI) - approximate 75%-95% UTI are caused by Escherichia coli or E. coli bacteria. Escherichia coli or E. coli bacteria causes certain symptom's: Vomiting's, Confusion, Diarrhoea, Abdominal Cram...

Video Timestamp's: Introduction: 00:00 Economic Load dispatch Cost Calculation: 00:37 Particle Swarm Optimization Parameter: 01:50 PSO Initialization: 02:19 PSO Main Loop: 03:25 Output : 06:06 Conclusion: 06:33 Economic Load Dispatch Problem (EDP) Economic Load Dispatch Problem using Lambda Iteration Method learn how we can solve Economic Load Dispatch Problem using Lambda Iteration Method  Step-by-Step with Numerical Example. This is a simple Economic load dispatch of Real power with Example.  Transmission losses are not considered.   Economic Dispatch Solution By Lambda-Iteration Method. Topics Covered in this video:  Power System Types​ Load Center, Power Plants.​ Economic Dispatch Problem?​ Economic Dispatch Problem: Equality and Inequality Constraints. ​ Economic Dispatch Problem Objective.​ Economic Dispatch Problem Step-by-Step Explanation with Numerical Example​

 Local Directional Pattern How to Calculate Local Directional Pattern (LDP) Code? With Example |Kirsch Compass Mask| ~xRay Pixy Click here - >  WATCH NOW What are Local Directional Patterns? LDP = Local Directional Pattern. Local Directional Pattern is a descriptor i.e., used for Face Recognition.  What is Descriptor?  Descriptors rely on Gradient-based or intensity variation approaches detect Local Features (e.g.,  Edges, Blobs and Regions).  BLOB = Binary Large Object (i.e., the region of the image). Descriptors such as HOG, SIFT, SURF (rely on local gradient computation).  Binary Descriptors such as BRISK, ORB or FREAK (rely on local intensity differences). Local Directional Pattern ( LDP) Assign code for each pixel in the image.  Local Directional Pattern ( LDP) encoded image is divided into regions. How LDP Calculate?  For Each pixel in the image LDP computes an 8-bit binary code. 8-bit binary pattern is calculated by involving the lo...

In this video, you will learn how we can solve Economic Load Dispatch Problem using Lambda Iteration Method  Step-by-Step with Numerical Example. This is a simple Economic load dispatch of Real power with Example.  Transmission losses are not considered.   Economic Dispatch Solution By Lambda-Iteration Method. Topics Covered in this video:  Power System Types​ Load Center, Power Plants.​ Economic Dispatch Problem?​ Economic Dispatch Problem: Equality and Inequality Constraints. ​ Economic Dispatch Problem Objective.​ Economic Dispatch Problem Step-by-Step Explanation with Numerical Example​ Particle Swarm Optimization Algorithm for Solving Economic Load Dispatch Problem

Butterfly Optimization Algorithm (B.O.A) Butterfly optimization algorithm : a novel approach for global optimization It is a novel optimization technique that mimics the food foraging behavior of butterflies. Keywords Butterfly optimization algorithm ·Global optimization ·Nature inspired ·Metaheuristic ·Benchmark testfunctions ·Engineering design problem Butterfly are Flying Insects. About Butterfly Butterfly Features: Small Head, 2 compound eyes. Butterfly basically feed on Nectar from flowers. Adult Butterfly consume only liquid [nectar from flowers]. They use their Antenna to sense air from wind and fragrance. Butterfly can fly only when their temperature is 27℃ or 81℉.  Largest butterfly in the world: Queen Alexandra Birdwing. Butterflies also derive nourishment from rotting fruits, dung, decaying flesh, dissolved minerals in the dirt/ sand. Butterfly Lifecycle An Adult Butterfly lay eggs on the food plant. From Eggs to Larva [Larva consume plant leaves]. When metamorphosis compl...

Moth Flame Optimization Algorithm (MFOA) is inspired by moth's behavior in nature. Moth Flame Optimization Algorithm is a nature-inspired population-based algorithm used to solve real-life optimization problems. Video timestamps Introduction: 00:00 About Moths: 00:30 Moth Flame Optimization Algorithm (MFOA): 01:20 MFOA Mathematical Model: 02:50 Moth Flame Optimization Algorithm Steps: 04:19 Moth Flame Optimization Algorithm Assumptions: 05:15 Moth Flame Optimization Algorithm Example: 06:43 Conclusion: 08:28 Topics Covered in this video What is a moth-flame optimization algorithm? The mathematical model for moth flame optimization algorithm. How moth-flame optimization algorithm works? Certain features about moth-flame optimization algorithm. Certain Assumptions about moth-flame optimization algorithm. Moth-flame optimization algorithm Application areas. How to solve moth-flame optimization algorithm? Moth Flame Optimization Algorithm Applications Forecast the electricity consumpt...

Knapsack Problem using Greedy Method Algorithm Design Techniques Divide and Conquer Greedy Method Dynamic Programming Back Tracing Branch and Bound Divide and Conquer:  Many algorithms are recursive in structure. To solve any problem, they call themselves recursively again and again [one or more times]. Three steps are followed by divide and conquer algorithms. 1.) Divide the problem into the number of sub-problems. 2.) Conquer the sub-problems by solving them recursively. 3.) Combine the solution to the sub-problems into the solution for the original problem. The greedy method  is the Straight design technique. It can be applied to a wide variety of problems. Obtain a subset that satisfies the same constraints.  Feasible Solution: If any subset satisfies these constraints.  Our GOAL: Find a feasible solution that either Maximize or Minimize the given Objective Function. A feasible solution that does this is known as OPTIMAL SOLUTION.   A feasible Solution...

 Optimization Engineering - Metaheuristic Optimization Algorithms Optimization plays a very important role in science and engineering. Optimization aim is to find out the minimum or maximum value using any objective function or cost function. In optimization different Metaheuristic Algorithms are used to solve complex problems in various fields such as Engineering Problems, Medical Problems, Computer Problems, and different real-life problems that can not be solved using classical methods. Metaheuristic optimization algorithms are classified into two main categories as Single-based optimization algorithms and Population-based optimization algorithms.  Single-based Meta-heuristic algorithms are also known as Trajectory Algorithms. Single-based metaheuristic algorithms provide the single solution in every iteration. Single-based Metaheuristic algorithm examples: Tabu Search, Guided Local Search, Iterated Local Search, Stochastic Local Search, Iterated Local Search, Variable ne...

Water Cycle Algorithm (WCA)  A number of metaheuristic algorithms have been developed to solve various constraints optimization problems. Because according to the No Free Lunch theorem no algorithm alone can not solve various real-world problems. Different problems exist in real life that is complex in nature and hard to solve. Water Cycle Optimization Algorithm is inspired by nature. The water cycle algorithm is a nature-inspired metaheuristics algorithm. Water Cycle Algorithm is basically inspired by the water cycle process in nature. In this video, you will learn how the water cycle algorithm is working step-by-step with examples and its mathematical Model. Water Cycle Algorithm is a metaheuristic optimization method used to solve different constraints-based problems and real-life engineering design problems. Water Cycle is also known as Hydrological Cycle. Water Cycle represents the continuous movement of water below and above the earth's surface. Most Precipitation: Occur as ...

C++ Program to Calculate Area of Rectangle using Objects and Classes. Calculate Area of Rectangle: Area = Length * width Program Output: Source Code  #include<iostream> #include<conio.h> using namespace std; class rectangle { private: int a, b; public: void setdata(int x, int y)  { a = x; b = y; } void area() { int area = a*b; cout<<"\n Area of Rectangle = " <<area; } }; int main() { rectangle r1, r2; //objects r1.setdata(15,40);  //object r1 called setdate() cout<<"\nFor First Rectangle "; r1.area(); // object r1 calls area() r2.setdata(30,60);  //object r1 called setdate() cout<<"\nFor First Rectangle "; r2.area(); // object r1 calls area() getch(); return 0; }

 Programming in C Language: Pointers Define Pointer. A pointer is a variable that stores a memory address. Like all other variables, it also has a name, has to be declared, and occupies some spaces in the memory.  Why Pointer is called Pointer?  It is called a pointer because it points to a particular location in memory by sorting the address of that location. Pointer General Syntax of Declaration data-type * Pointername; Here, Pointername = Name of pointer variable Astric * preceding this name informs the compiler that the variable is declared as a pointer.  Data type = Base type of pointer. For example:          int * iptr;          float * fptr; here iptr is a pointer that should point to a variable of type int. Pointers are also variables so, the compiler will reserve space for t hem and they will also have some address. All pointers irrespective of their base type will occupy the same space in memory since all of...