Matlab lecture 3 – commands, the m files, data types, bitwise op, set@taj
•
0 likes•111 views
Matlab lecture 3 – commands, the m files, data types, bitwise op, set@taj . This lecture is from my class lectures in IIT-JU. . Find me: Website: https://www.tajimiitju.blogspot.com Linked in: https://www.linkedin.com/in/tajimiitju Researchgate: https://www.researchgate.net/profile/Tajim_Md_Niamat_Ullah_Akhund Youtube: https://www.youtube.com/tajimiitju?sub_confirmation=1 Slideshare: https://www.slideshare.net/TajimMdNiamatUllahAk Facebook: https://www.facebook.com/tajim.mohammad Gitlab: https://gitlab.com/users/tajimiitju Google+: plus.google.com/+tajimiitju Email: tajim.mohammad.3@gmail.com Twitter: https://twitter.com/Tajim53
Report
Share
Report
Share
Recommended
Matlab lecture 4 loops@taj
Matlab lecture 4 loops@taj
.
This lecture is from my class lectures in IIT-JU.
.
Find me:
Website: https://www.tajimiitju.blogspot.com
Linked in: https://www.linkedin.com/in/tajimiitju
Researchgate: https://www.researchgate.net/profile/Tajim_Md_Niamat_Ullah_Akhund
Youtube: https://www.youtube.com/tajimiitju?sub_confirmation=1
Slideshare: https://www.slideshare.net/TajimMdNiamatUllahAk
Facebook: https://www.facebook.com/tajim.mohammad
Gitlab: https://gitlab.com/users/tajimiitju
Google+: plus.google.com/+tajimiitju
Email: tajim.mohammad.3@gmail.com
Twitter: https://twitter.com/Tajim53
Matlab lecture 2 matlab basic syntax & variables @taj
This document provides an overview of MATLAB basics including:
- MATLAB syntax and variables - commands are executed immediately and results returned
- Common operators like % for comments and ; to suppress output
- Special variables like ans, eps, i, Inf, NaN, pi
- Defining and naming variables - they must be assigned before use
- Creating vectors and matrices - row vectors use spaces/commas, column uses semicolons
- Basic math operations on vectors and matrices
Matlab lecture 1 - installation of matlab, introduction and course outline@taj
Matlab lecture 1 - installation of matlab, introduction and course outline@tajTajim Md. Niamat Ullah Akhund
Matlab lecture 1 installation of matlab, introduction and course outline@taj
.
This lecture is from my class lectures in IIT-JU.
.
Find me:
Website: https://www.tajimiitju.blogspot.com
Linked in: https://www.linkedin.com/in/tajimiitju
Researchgate: https://www.researchgate.net/profile/Tajim_Md_Niamat_Ullah_Akhund
Youtube: https://www.youtube.com/tajimiitju?sub_confirmation=1
Slideshare: https://www.slideshare.net/TajimMdNiamatUllahAk
Facebook: https://www.facebook.com/tajim.mohammad
Gitlab: https://gitlab.com/users/tajimiitju
Google+: plus.google.com/+tajimiitju
Email: tajim.mohammad.3@gmail.com
Twitter: https://twitter.com/Tajim53
Day 1 Chapter 1 Unit 1
This document introduces algorithms and their design. It defines an algorithm as a sequence of unambiguous instructions to solve a problem within a finite time. It discusses algorithm notation, features, and examples for finding the greatest common divisor and prime numbers. The document outlines the algorithm design process of understanding the problem, deciding on a representation, designing a model, proving correctness, analyzing efficiency, coding it, and classifying algorithms. It also covers important problem types like sorting, searching, and graphs, and fundamental data structures like arrays, linked lists, stacks, queues, trees, and graphs.
growth rates
The document discusses different categories of algorithm growth rates:
1) Constant time procedures have running times that do not increase with input size and are O(1). Examples include car and cons.
2) Linear growth procedures have running times that increase linearly with input size, scaling as Θ(n). Examples include elementary addition and procedures that perform a constant action on each list element.
3) Quadratic growth procedures have running times scaling as Θ(n2), where comparing all elements of a length n list to each other results in n(n-1) comparisons.
4) Exponential growth procedures have running times multiplying by some constant factor w when input size n increases by 1, scaling as wn
brf to mathml
This project uses the ANTLR tool to convert .brf files containing MathML ASCII code into pure MathML. ANTLR generates several files by taking the NB.g4 grammar file as a parameter. The project also explores using optical character recognition to convert Braille images to text, with one tool able to convert images and PDFs to text files with 95% accuracy using pre-trained data files for languages like English, Dutch, and Spanish. The process for adding new language data files is described.
Semantic scaffolds for pseudocode to-code generation (2020)
They propose a method for program generation based on semantic scaffolds, lightweight structures representing the high-level semantic and syntactic composition of a program. By first searching over plausible scaffolds then using these as constraints for a beam search over programs, we achieve better coverage of the search space when compared with existing
techniques. We apply our hierarchical search method to the SPoC dataset for pseudocodeto- code generation, in which we are given line-level natural language pseudocode annotations
and aim to produce a program satisfying execution-based test cases. By using semantic scaffolds during inference, we achieve a 10% absolute improvement in top-100 accuracy
over the previous state-of-the-art. Additionally, we require only 11 candidates to reach the top-3000 performance of the previous best approach when tested against unseen problems, demonstrating a substantial improvement in efficiency.
Solving Nonograms In Parallel
This document summarizes a group project to parallelize the solving of Nonograms puzzles.
The group explored several approaches to parallelization including optimizing code structure to take advantage of SIMD instructions, improving memory access, and implementing various MPI versions for distributed processing. Evaluation showed the MPI version with dynamic scheduling and asynchronous communication achieved the best speedup of around 5x on 10 cores. Further optimization of load balancing and addressing data dependencies could provide additional gains but parallelizing the inherently sequential nature of the problem proves challenging.
Recommended
Matlab lecture 4 loops@taj
Matlab lecture 4 loops@taj
.
This lecture is from my class lectures in IIT-JU.
.
Find me:
Website: https://www.tajimiitju.blogspot.com
Linked in: https://www.linkedin.com/in/tajimiitju
Researchgate: https://www.researchgate.net/profile/Tajim_Md_Niamat_Ullah_Akhund
Youtube: https://www.youtube.com/tajimiitju?sub_confirmation=1
Slideshare: https://www.slideshare.net/TajimMdNiamatUllahAk
Facebook: https://www.facebook.com/tajim.mohammad
Gitlab: https://gitlab.com/users/tajimiitju
Google+: plus.google.com/+tajimiitju
Email: tajim.mohammad.3@gmail.com
Twitter: https://twitter.com/Tajim53
Matlab lecture 2 matlab basic syntax & variables @taj
This document provides an overview of MATLAB basics including:
- MATLAB syntax and variables - commands are executed immediately and results returned
- Common operators like % for comments and ; to suppress output
- Special variables like ans, eps, i, Inf, NaN, pi
- Defining and naming variables - they must be assigned before use
- Creating vectors and matrices - row vectors use spaces/commas, column uses semicolons
- Basic math operations on vectors and matrices
Matlab lecture 1 - installation of matlab, introduction and course outline@taj
Matlab lecture 1 - installation of matlab, introduction and course outline@tajTajim Md. Niamat Ullah Akhund
Matlab lecture 1 installation of matlab, introduction and course outline@taj
.
This lecture is from my class lectures in IIT-JU.
.
Find me:
Website: https://www.tajimiitju.blogspot.com
Linked in: https://www.linkedin.com/in/tajimiitju
Researchgate: https://www.researchgate.net/profile/Tajim_Md_Niamat_Ullah_Akhund
Youtube: https://www.youtube.com/tajimiitju?sub_confirmation=1
Slideshare: https://www.slideshare.net/TajimMdNiamatUllahAk
Facebook: https://www.facebook.com/tajim.mohammad
Gitlab: https://gitlab.com/users/tajimiitju
Google+: plus.google.com/+tajimiitju
Email: tajim.mohammad.3@gmail.com
Twitter: https://twitter.com/Tajim53
Day 1 Chapter 1 Unit 1
This document introduces algorithms and their design. It defines an algorithm as a sequence of unambiguous instructions to solve a problem within a finite time. It discusses algorithm notation, features, and examples for finding the greatest common divisor and prime numbers. The document outlines the algorithm design process of understanding the problem, deciding on a representation, designing a model, proving correctness, analyzing efficiency, coding it, and classifying algorithms. It also covers important problem types like sorting, searching, and graphs, and fundamental data structures like arrays, linked lists, stacks, queues, trees, and graphs.
growth rates
The document discusses different categories of algorithm growth rates:
1) Constant time procedures have running times that do not increase with input size and are O(1). Examples include car and cons.
2) Linear growth procedures have running times that increase linearly with input size, scaling as Θ(n). Examples include elementary addition and procedures that perform a constant action on each list element.
3) Quadratic growth procedures have running times scaling as Θ(n2), where comparing all elements of a length n list to each other results in n(n-1) comparisons.
4) Exponential growth procedures have running times multiplying by some constant factor w when input size n increases by 1, scaling as wn
brf to mathml
This project uses the ANTLR tool to convert .brf files containing MathML ASCII code into pure MathML. ANTLR generates several files by taking the NB.g4 grammar file as a parameter. The project also explores using optical character recognition to convert Braille images to text, with one tool able to convert images and PDFs to text files with 95% accuracy using pre-trained data files for languages like English, Dutch, and Spanish. The process for adding new language data files is described.
Semantic scaffolds for pseudocode to-code generation (2020)
They propose a method for program generation based on semantic scaffolds, lightweight structures representing the high-level semantic and syntactic composition of a program. By first searching over plausible scaffolds then using these as constraints for a beam search over programs, we achieve better coverage of the search space when compared with existing
techniques. We apply our hierarchical search method to the SPoC dataset for pseudocodeto- code generation, in which we are given line-level natural language pseudocode annotations
and aim to produce a program satisfying execution-based test cases. By using semantic scaffolds during inference, we achieve a 10% absolute improvement in top-100 accuracy
over the previous state-of-the-art. Additionally, we require only 11 candidates to reach the top-3000 performance of the previous best approach when tested against unseen problems, demonstrating a substantial improvement in efficiency.
Solving Nonograms In Parallel
This document summarizes a group project to parallelize the solving of Nonograms puzzles.
The group explored several approaches to parallelization including optimizing code structure to take advantage of SIMD instructions, improving memory access, and implementing various MPI versions for distributed processing. Evaluation showed the MPI version with dynamic scheduling and asynchronous communication achieved the best speedup of around 5x on 10 cores. Further optimization of load balancing and addressing data dependencies could provide additional gains but parallelizing the inherently sequential nature of the problem proves challenging.
Numerical methods and programming Tutorial
This document provides an overview of the course "Numerical Methods and Programming". The course covers numerical computation topics like number systems, errors, interpolation, differentiation, integration, and solving equations. It focuses on applying algorithmic approaches in C language to numerical problems like Lagrange interpolation, Newton's formulas, trapezoidal integration, and solving linear systems. The course also covers initial value ordinary differential equations, C language basics, and implementing numerical problems in C. It lists 17 relevant textbooks.
GRAPHICAL STRUCTURES in our lives
## En
1. What is a GRAPH?
2. The computer handles
3. Speeding up operations using graphs
## Ja
1. グラフ構造とは
2. コンピュータ上でグラフを表す
3. グラフを用いて高速に計算する
Presentation on Bakery Algorithm
The document presents information about the Bakery algorithm, which is a mutual exclusion algorithm designed by Leslie Lamport to prevent concurrent threads from entering critical sections of code at the same time. It works by having each process receive a number before entering the critical section, and the process with the lowest number gains access first. If two processes have the same number, the process with the lower ID will enter first. Real-life examples are provided to illustrate how the algorithm handles processes with the same ticket number or different ticket numbers. The conclusion states that the Bakery algorithm assumes sequential consistency and requires special handling to work on modern hardware.
Date and time on the internet
The document discusses issues with representing dates and times on the internet and proposes standards to address these issues. It notes that the Temporal project aims to provide a modern date and time API that addresses longstanding weaknesses of the Date object. It discusses challenges like representing time zones and calendars in persisted data and proposes a generalized format with optional extensions to represent this information standardized by the IETF. It seeks feedback on next steps to update standards like RFC 3339 while keeping other groups informed and involved in the process.
Model and Design
This document discusses functional and imperative models of program design. It covers features of the functional model like recursion, tail recursion, and correctness proofs. The imperative model uses variables, assignments, and control structures. Proof rules are presented for loops, goto statements, functions, and procedures. Problem solving techniques like greedy algorithms are also discussed, applying concepts to problems like the knapsack problem and Huffman coding. Specific algorithms for these problems are outlined.
Day 2 Chapter 1 Unit 1
This document introduces various types of algorithms and problems. It discusses sorting, searching, string processing, graph problems, combinatorial problems, geometric problems, and numerical problems. For each problem type, it provides examples of applications and classic problems. It emphasizes that different algorithms have different time complexities and notes challenges in solving combinatorial and numerical problems exactly.
Bakery algorithm in operating system
The document provides an introduction to the Bakery algorithm for solving critical sections in operating systems. It discusses:
1. The Bakery algorithm assigns each process a ticket number before entering the critical section, and the lowest number proceeds first. If numbers are equal, the lower process ID goes first.
2. It requires data structures to store choosing flags and ticket numbers for each process. Processes set their choosing flag, get the next highest ticket number, then enter the critical section.
3. An example shows two processes with different ticket numbers, and another with the same number where the lower ID process enters first.
MATLAB Simulation for Master Thesis
PRIMARY NOTIONS IN MATLAB PROJECTS
FUNCTIONS OF SIMSCAPE MULTIBODY IN MATLAB
MAJOR USES OF SIMRF IN MATLAB SIMULINK
Revision test of unit
This document contains a revision test on Unit 3 of Scratch programming concepts. It includes 5 multiple choice questions testing knowledge of sprites, scripts, stages, relational operators, and loops. There are also 5 true/false statements to mark and 3 short answer questions defining a flowchart with an example, conditional structures, and how to create a variable in Scratch.
Algorithm and Data Structure - Queue
This material aims to enable students to:
1) Understanding queue concept
2) Understanding enqueue, dequeue, front, rear operation in a queue
3) Understanding working of queue
4) Knowing of queue application
Lecture6
The document discusses stacks and their implementation using various data structures. It is divided into 4 sections that cover basic stack operations, implementing a stack as a linked list, a C language implementation, and the stack Abstract Data Type (ADT). Each section defines the data structures and algorithms used to implement stacks through pseudocode and programming examples.
Collatz Conjecture Research
This document outlines a project that uses C programming language to test the Collatz conjecture on extremely large numbers. The conjecture states that repeatedly applying the functions of 3n+1 for odd numbers and n/2 for even numbers will eventually reach 1. The project involves understanding C programming, creating pseudocode for the conjecture, turning it into source code, testing it, and recording findings. Due to the immense size of the numbers, a mechanism of dividing them into parts and working on the parts simultaneously was developed to apply to the code and conjecture in further investigation.
hot sell nike jordan,air max,polo,lacoste,gucci,coach,dg,af.
This short document contains two numbers: xxxl and 38. Both numbers have the measurement 9.5 listed after them.
MATLAB/Simulink test02
This Simulink model contains a transfer function block, subtract block, gain block, and step scope block connected in a loop. The transfer function block has an input of s+1 and output of s+12. A step input is fed into the transfer function block and the output is viewed on the step scope.
AI Lecture 7 (uncertainty)
This document discusses uncertainty and probability theory. It begins by explaining sources of uncertainty for autonomous agents from limited sensors and an unknown future. It then covers representing uncertainty with probabilities and Bayes' rule for updating beliefs. Examples show inferring diagnoses from symptoms using conditional probabilities. Independence is described as reducing the information needed for joint distributions. The document emphasizes probability theory and Bayesian reasoning for handling uncertainty.
AI Lecture 6 (logical agents)
The document discusses logical agents and knowledge-based agents. It covers topics including propositional logic, knowledge bases, logical inference, and different proof methods. Propositional logic is introduced as the simplest logic using symbols and truth tables. Knowledge bases contain representations of facts about the world in some formal language. Logical inference allows agents to derive new facts by applying inference rules without understanding meaning. Different proof methods for logical inference like model checking and natural deduction are also discussed.
AI Lecture 5 (game playing)
This document discusses game playing as an area of artificial intelligence research. It provides examples of how search algorithms like minimax and alpha-beta pruning have been used to develop computer programs that can play games like chess at a grandmaster level. Specifically, it mentions how IBM's Deep Blue program was able to defeat world chess champion Garry Kasparov through brute force search methods combined with these algorithms. The document then provides details on minimax search and how static board evaluation functions allow searches to estimate values beyond search depths.
AI Lecture 4 (informed search and exploration)
This document discusses informed search strategies and local search algorithms for optimization problems. It covers best-first search, greedy search, A* search, heuristic functions, hill-climbing search, and escaping local optima. Specifically, it provides examples of applying greedy search, A* search, and hill-climbing to solve the 8-puzzle problem and discusses the drawbacks of hill-climbing getting stuck at local maxima.
AI Lecture 3 (solving problems by searching)
The document discusses problem solving by searching. It describes problem solving agents and how they formulate goals and problems, search for solutions, and execute solutions. Tree search algorithms like breadth-first search, uniform-cost search, and depth-first search are described. Example problems discussed include the 8-puzzle, 8-queens, and route finding problems. The strategies of different uninformed search algorithms are explained.
AI Lecture 2 (intelligent agents)
This document discusses intelligent agents and their environments. It covers:
1) Intelligent agents are entities that perceive their environment through sensors and act upon the environment through actuators. They map percept sequences to actions.
2) A rational agent should select actions that are expected to maximize its performance measure given the percept sequence and its prior knowledge. Performance measures evaluate how well the agent solves its task.
3) Agent environments can have different properties such as being fully or partially observable, deterministic or stochastic, episodic or sequential, static or dynamic, discrete or continuous, and single-agent or multi-agent. The simplest is fully observable, deterministic, etc. but most real environments are more complex.
AI Lecture 1 (introduction)
This document provides an overview of an artificial intelligence course titled CSE 412 taught in fall 2018. It introduces topics that will be covered like what AI is, the foundations and history of AI, the state of the art in AI, philosophical foundations, and logic programming using Prolog. The instructor is Tajim Md. Niamat Ullah Akhund and the document outlines the major sections and contents to be covered in the course.
Course outline (cse 412 - artificial intelligence)
This document outlines the course details for the Artificial Intelligence course CSE 412 offered in the spring 2019 semester at Daffodil International University. The 3-credit course provides an introduction to the basic principles and applications of AI through topics like problem solving, game playing, logical agents, uncertainty, and natural language processing. Students will be assessed based on class attendance, assignments, tests, presentations, and exams. Grades use a letter system from A+ to F and are based on numerical scores. The course will be taught through required classes, tests, and assignments.
More Related Content
What's hot
Numerical methods and programming Tutorial
This document provides an overview of the course "Numerical Methods and Programming". The course covers numerical computation topics like number systems, errors, interpolation, differentiation, integration, and solving equations. It focuses on applying algorithmic approaches in C language to numerical problems like Lagrange interpolation, Newton's formulas, trapezoidal integration, and solving linear systems. The course also covers initial value ordinary differential equations, C language basics, and implementing numerical problems in C. It lists 17 relevant textbooks.
GRAPHICAL STRUCTURES in our lives
## En
1. What is a GRAPH?
2. The computer handles
3. Speeding up operations using graphs
## Ja
1. グラフ構造とは
2. コンピュータ上でグラフを表す
3. グラフを用いて高速に計算する
Presentation on Bakery Algorithm
The document presents information about the Bakery algorithm, which is a mutual exclusion algorithm designed by Leslie Lamport to prevent concurrent threads from entering critical sections of code at the same time. It works by having each process receive a number before entering the critical section, and the process with the lowest number gains access first. If two processes have the same number, the process with the lower ID will enter first. Real-life examples are provided to illustrate how the algorithm handles processes with the same ticket number or different ticket numbers. The conclusion states that the Bakery algorithm assumes sequential consistency and requires special handling to work on modern hardware.
Date and time on the internet
The document discusses issues with representing dates and times on the internet and proposes standards to address these issues. It notes that the Temporal project aims to provide a modern date and time API that addresses longstanding weaknesses of the Date object. It discusses challenges like representing time zones and calendars in persisted data and proposes a generalized format with optional extensions to represent this information standardized by the IETF. It seeks feedback on next steps to update standards like RFC 3339 while keeping other groups informed and involved in the process.
Model and Design
This document discusses functional and imperative models of program design. It covers features of the functional model like recursion, tail recursion, and correctness proofs. The imperative model uses variables, assignments, and control structures. Proof rules are presented for loops, goto statements, functions, and procedures. Problem solving techniques like greedy algorithms are also discussed, applying concepts to problems like the knapsack problem and Huffman coding. Specific algorithms for these problems are outlined.
Day 2 Chapter 1 Unit 1
This document introduces various types of algorithms and problems. It discusses sorting, searching, string processing, graph problems, combinatorial problems, geometric problems, and numerical problems. For each problem type, it provides examples of applications and classic problems. It emphasizes that different algorithms have different time complexities and notes challenges in solving combinatorial and numerical problems exactly.
Bakery algorithm in operating system
The document provides an introduction to the Bakery algorithm for solving critical sections in operating systems. It discusses:
1. The Bakery algorithm assigns each process a ticket number before entering the critical section, and the lowest number proceeds first. If numbers are equal, the lower process ID goes first.
2. It requires data structures to store choosing flags and ticket numbers for each process. Processes set their choosing flag, get the next highest ticket number, then enter the critical section.
3. An example shows two processes with different ticket numbers, and another with the same number where the lower ID process enters first.
MATLAB Simulation for Master Thesis
PRIMARY NOTIONS IN MATLAB PROJECTS
FUNCTIONS OF SIMSCAPE MULTIBODY IN MATLAB
MAJOR USES OF SIMRF IN MATLAB SIMULINK
Revision test of unit
This document contains a revision test on Unit 3 of Scratch programming concepts. It includes 5 multiple choice questions testing knowledge of sprites, scripts, stages, relational operators, and loops. There are also 5 true/false statements to mark and 3 short answer questions defining a flowchart with an example, conditional structures, and how to create a variable in Scratch.
Algorithm and Data Structure - Queue
This material aims to enable students to:
1) Understanding queue concept
2) Understanding enqueue, dequeue, front, rear operation in a queue
3) Understanding working of queue
4) Knowing of queue application
Lecture6
The document discusses stacks and their implementation using various data structures. It is divided into 4 sections that cover basic stack operations, implementing a stack as a linked list, a C language implementation, and the stack Abstract Data Type (ADT). Each section defines the data structures and algorithms used to implement stacks through pseudocode and programming examples.
Collatz Conjecture Research
This document outlines a project that uses C programming language to test the Collatz conjecture on extremely large numbers. The conjecture states that repeatedly applying the functions of 3n+1 for odd numbers and n/2 for even numbers will eventually reach 1. The project involves understanding C programming, creating pseudocode for the conjecture, turning it into source code, testing it, and recording findings. Due to the immense size of the numbers, a mechanism of dividing them into parts and working on the parts simultaneously was developed to apply to the code and conjecture in further investigation.
hot sell nike jordan,air max,polo,lacoste,gucci,coach,dg,af.
This short document contains two numbers: xxxl and 38. Both numbers have the measurement 9.5 listed after them.
MATLAB/Simulink test02
This Simulink model contains a transfer function block, subtract block, gain block, and step scope block connected in a loop. The transfer function block has an input of s+1 and output of s+12. A step input is fed into the transfer function block and the output is viewed on the step scope.
What's hot (14)
hot sell nike jordan,air max,polo,lacoste,gucci,coach,dg,af.
hot sell nike jordan,air max,polo,lacoste,gucci,coach,dg,af.
More from Tajim Md. Niamat Ullah Akhund
AI Lecture 7 (uncertainty)
This document discusses uncertainty and probability theory. It begins by explaining sources of uncertainty for autonomous agents from limited sensors and an unknown future. It then covers representing uncertainty with probabilities and Bayes' rule for updating beliefs. Examples show inferring diagnoses from symptoms using conditional probabilities. Independence is described as reducing the information needed for joint distributions. The document emphasizes probability theory and Bayesian reasoning for handling uncertainty.
AI Lecture 6 (logical agents)
The document discusses logical agents and knowledge-based agents. It covers topics including propositional logic, knowledge bases, logical inference, and different proof methods. Propositional logic is introduced as the simplest logic using symbols and truth tables. Knowledge bases contain representations of facts about the world in some formal language. Logical inference allows agents to derive new facts by applying inference rules without understanding meaning. Different proof methods for logical inference like model checking and natural deduction are also discussed.
AI Lecture 5 (game playing)
This document discusses game playing as an area of artificial intelligence research. It provides examples of how search algorithms like minimax and alpha-beta pruning have been used to develop computer programs that can play games like chess at a grandmaster level. Specifically, it mentions how IBM's Deep Blue program was able to defeat world chess champion Garry Kasparov through brute force search methods combined with these algorithms. The document then provides details on minimax search and how static board evaluation functions allow searches to estimate values beyond search depths.
AI Lecture 4 (informed search and exploration)
This document discusses informed search strategies and local search algorithms for optimization problems. It covers best-first search, greedy search, A* search, heuristic functions, hill-climbing search, and escaping local optima. Specifically, it provides examples of applying greedy search, A* search, and hill-climbing to solve the 8-puzzle problem and discusses the drawbacks of hill-climbing getting stuck at local maxima.
AI Lecture 3 (solving problems by searching)
The document discusses problem solving by searching. It describes problem solving agents and how they formulate goals and problems, search for solutions, and execute solutions. Tree search algorithms like breadth-first search, uniform-cost search, and depth-first search are described. Example problems discussed include the 8-puzzle, 8-queens, and route finding problems. The strategies of different uninformed search algorithms are explained.
AI Lecture 2 (intelligent agents)
This document discusses intelligent agents and their environments. It covers:
1) Intelligent agents are entities that perceive their environment through sensors and act upon the environment through actuators. They map percept sequences to actions.
2) A rational agent should select actions that are expected to maximize its performance measure given the percept sequence and its prior knowledge. Performance measures evaluate how well the agent solves its task.
3) Agent environments can have different properties such as being fully or partially observable, deterministic or stochastic, episodic or sequential, static or dynamic, discrete or continuous, and single-agent or multi-agent. The simplest is fully observable, deterministic, etc. but most real environments are more complex.
AI Lecture 1 (introduction)
This document provides an overview of an artificial intelligence course titled CSE 412 taught in fall 2018. It introduces topics that will be covered like what AI is, the foundations and history of AI, the state of the art in AI, philosophical foundations, and logic programming using Prolog. The instructor is Tajim Md. Niamat Ullah Akhund and the document outlines the major sections and contents to be covered in the course.
Course outline (cse 412 - artificial intelligence)
This document outlines the course details for the Artificial Intelligence course CSE 412 offered in the spring 2019 semester at Daffodil International University. The 3-credit course provides an introduction to the basic principles and applications of AI through topics like problem solving, game playing, logical agents, uncertainty, and natural language processing. Students will be assessed based on class attendance, assignments, tests, presentations, and exams. Grades use a letter system from A+ to F and are based on numerical scores. The course will be taught through required classes, tests, and assignments.
Artificial intelligence LAB 1 overview & intelligent systems
The document provides an overview of an AI lab course plan that includes both software and hardware implementations of artificial intelligence. The software portion covers topics like data preparation, supervised and unsupervised learning techniques, and natural language processing. The hardware portion involves building robots that can be controlled in various ways, including through Android apps, line following, RFID recognition, obstacle avoidance, and gestures or voice.
Matlab lecture 9 – simpson 1,3 and trapezoidal method@taj
Matlab lecture 9 – simpson 1,3 and trapezoidal method@taj
.
This lecture is from my class lectures in IIT-JU.
.
Find me:
Website: https://www.tajimiitju.blogspot.com
Linked in: https://www.linkedin.com/in/tajimiitju
Researchgate: https://www.researchgate.net/profile/Tajim_Md_Niamat_Ullah_Akhund
Youtube: https://www.youtube.com/tajimiitju?sub_confirmation=1
Slideshare: https://www.slideshare.net/TajimMdNiamatUllahAk
Facebook: https://www.facebook.com/tajim.mohammad
Gitlab: https://gitlab.com/users/tajimiitju
Google+: plus.google.com/+tajimiitju
Email: tajim.mohammad.3@gmail.com
Twitter: https://twitter.com/Tajim53
Matlab lecture 8 – newton's forward and backword interpolation@taj copy
Matlab lecture 8 – newton's forward and backword interpolation@taj copyTajim Md. Niamat Ullah Akhund
Matlab lecture 8 – newton's forward and backword interpolation@taj copy
.
This lecture is from my class lectures in IIT-JU.
.
Find me:
Website: https://www.tajimiitju.blogspot.com
Linked in: https://www.linkedin.com/in/tajimiitju
Researchgate: https://www.researchgate.net/profile/Tajim_Md_Niamat_Ullah_Akhund
Youtube: https://www.youtube.com/tajimiitju?sub_confirmation=1
Slideshare: https://www.slideshare.net/TajimMdNiamatUllahAk
Facebook: https://www.facebook.com/tajim.mohammad
Gitlab: https://gitlab.com/users/tajimiitju
Google+: plus.google.com/+tajimiitju
Email: tajim.mohammad.3@gmail.com
Twitter: https://twitter.com/Tajim53Matlab lecture 7 – regula falsi or false position method@taj
Matlab lecture 7 – regula falsi or false position method@taj
.
This lecture is from my class lectures in IIT-JU.
.
Find me:
Website: https://www.tajimiitju.blogspot.com
Linked in: https://www.linkedin.com/in/tajimiitju
Researchgate: https://www.researchgate.net/profile/Tajim_Md_Niamat_Ullah_Akhund
Youtube: https://www.youtube.com/tajimiitju?sub_confirmation=1
Slideshare: https://www.slideshare.net/TajimMdNiamatUllahAk
Facebook: https://www.facebook.com/tajim.mohammad
Gitlab: https://gitlab.com/users/tajimiitju
Google+: plus.google.com/+tajimiitju
Email: tajim.mohammad.3@gmail.com
Twitter: https://twitter.com/Tajim53
Matlab lecture 6 – newton raphson method@taj copy
This document discusses using the Newton Raphson method in MATLAB to find the roots of nonlinear equations. It begins with an introduction to the Newton Raphson method and its use in solving equations that are too complex for algebraic methods. The objectives and theory behind the Newton Raphson method are then outlined. Examples are provided and the MATLAB code presented to find the roots of sample equations graphically and via the console output. The document walks through applying the Newton Raphson method in MATLAB to several equations.
Matlab lecture 5 bisection method@taj
Matlab lecture 5 bisection method@taj
.
This lecture is from my class lectures in IIT-JU.
.
Find me:
Website: https://www.tajimiitju.blogspot.com
Linked in: https://www.linkedin.com/in/tajimiitju
Researchgate: https://www.researchgate.net/profile/Tajim_Md_Niamat_Ullah_Akhund
Youtube: https://www.youtube.com/tajimiitju?sub_confirmation=1
Slideshare: https://www.slideshare.net/TajimMdNiamatUllahAk
Facebook: https://www.facebook.com/tajim.mohammad
Gitlab: https://gitlab.com/users/tajimiitju
Google+: plus.google.com/+tajimiitju
Email: tajim.mohammad.3@gmail.com
Twitter: https://twitter.com/Tajim53
Circuit lab 10 verification of norton's theorem@taj
Circuit lab 10 verification of norton s theorem@taj
.
This lecture is from my class lectures in IIT-JU.
.
Find me:
Website: https://www.tajimiitju.blogspot.com
Linked in: https://www.linkedin.com/in/tajimiitju
Researchgate: https://www.researchgate.net/profile/Tajim_Md_Niamat_Ullah_Akhund
Youtube: https://www.youtube.com/tajimiitju?sub_confirmation=1
Slideshare: https://www.slideshare.net/TajimMdNiamatUllahAk
Facebook: https://www.facebook.com/tajim.mohammad
Gitlab: https://gitlab.com/users/tajimiitju
Google+: plus.google.com/+tajimiitju
Email: tajim.mohammad.3@gmail.com
Twitter: https://twitter.com/Tajim53
Circuit lab 9 verification of maximum power transfer theorem@taj
Circuit lab 9 verification of maximum power transfer theorem
.
This lecture is from my class lectures in IIT-JU.
.
Find me:
Website: https://www.tajimiitju.blogspot.com
Linked in: https://www.linkedin.com/in/tajimiitju
Researchgate: https://www.researchgate.net/profile/Tajim_Md_Niamat_Ullah_Akhund
Youtube: https://www.youtube.com/tajimiitju?sub_confirmation=1
Slideshare: https://www.slideshare.net/TajimMdNiamatUllahAk
Facebook: https://www.facebook.com/tajim.mohammad
Gitlab: https://gitlab.com/users/tajimiitju
Google+: plus.google.com/+tajimiitju
Email: tajim.mohammad.3@gmail.com
Twitter: https://twitter.com/Tajim53
Circuit lab 8 verification of thevenin's theorem@taj
Circuit lab 8 verification of thevenin's theorem@taj
.
This lecture is from my class lectures in IIT-JU.
.
Find me:
Website: https://www.tajimiitju.blogspot.com
Linked in: https://www.linkedin.com/in/tajimiitju
Researchgate: https://www.researchgate.net/profile/Tajim_Md_Niamat_Ullah_Akhund
Youtube: https://www.youtube.com/tajimiitju?sub_confirmation=1
Slideshare: https://www.slideshare.net/TajimMdNiamatUllahAk
Facebook: https://www.facebook.com/tajim.mohammad
Gitlab: https://gitlab.com/users/tajimiitju
Google+: plus.google.com/+tajimiitju
Email: tajim.mohammad.3@gmail.com
Twitter: https://twitter.com/Tajim53
Circuit lab 7 verification of superposition theorem@taj
This document describes an electronics lab experiment to verify the Superposition Theorem. The objective is to be familiar with the theorem and verify its applicability. The theory states that in a linear bilateral network with multiple power sources, the current at any point is the sum of currents from each source considered separately. The procedure involves constructing a circuit with two power sources, measuring the total current, then measuring the current from each source individually and verifying their sum. Equipment includes power supplies, a multimeter, breadboard, resistors and wires. A lab report on the experiment is required.
Circuit lab 6 kirchoff’s current law (kcl)@taj
Circuit lab 6 kirchoff’s current law (kcl)@taj
.
This lecture is from my class lectures in IIT-JU.
.
Find me:
Website: https://www.tajimiitju.blogspot.com
Linked in: https://www.linkedin.com/in/tajimiitju
Researchgate: https://www.researchgate.net/profile/Tajim_Md_Niamat_Ullah_Akhund
Youtube: https://www.youtube.com/tajimiitju?sub_confirmation=1
Slideshare: https://www.slideshare.net/TajimMdNiamatUllahAk
Facebook: https://www.facebook.com/tajim.mohammad
Gitlab: https://gitlab.com/users/tajimiitju
Google+: plus.google.com/+tajimiitju
Email: tajim.mohammad.3@gmail.com
Twitter: https://twitter.com/Tajim53
Circuit lab 5 kirchoff’s voltage law (kvl)@taj
Circuit lab 5 kirchoff’s voltage law (kvl)@taj
.
This lecture is from my class lectures in IIT-JU.
.
Find me:
Website: https://www.tajimiitju.blogspot.com
Linked in: https://www.linkedin.com/in/tajimiitju
Researchgate: https://www.researchgate.net/profile/Tajim_Md_Niamat_Ullah_Akhund
Youtube: https://www.youtube.com/tajimiitju?sub_confirmation=1
Slideshare: https://www.slideshare.net/TajimMdNiamatUllahAk
Facebook: https://www.facebook.com/tajim.mohammad
Gitlab: https://gitlab.com/users/tajimiitju
Google+: plus.google.com/+tajimiitju
Email: tajim.mohammad.3@gmail.com
Twitter: https://twitter.com/Tajim53
More from Tajim Md. Niamat Ullah Akhund (20)
Course outline (cse 412 - artificial intelligence)
Course outline (cse 412 - artificial intelligence)
Artificial intelligence LAB 1 overview & intelligent systems
Artificial intelligence LAB 1 overview & intelligent systems
Matlab lecture 9 – simpson 1,3 and trapezoidal method@taj
Matlab lecture 9 – simpson 1,3 and trapezoidal method@taj
Matlab lecture 8 – newton's forward and backword interpolation@taj copy
Matlab lecture 8 – newton's forward and backword interpolation@taj copy
Matlab lecture 7 – regula falsi or false position method@taj
Matlab lecture 7 – regula falsi or false position method@taj
Circuit lab 10 verification of norton's theorem@taj
Circuit lab 10 verification of norton's theorem@taj
Circuit lab 9 verification of maximum power transfer theorem@taj
Circuit lab 9 verification of maximum power transfer theorem@taj
Circuit lab 8 verification of thevenin's theorem@taj
Circuit lab 8 verification of thevenin's theorem@taj
Circuit lab 7 verification of superposition theorem@taj
Circuit lab 7 verification of superposition theorem@taj
Recently uploaded
International Conference on NLP, Artificial Intelligence, Machine Learning an...
International Conference on NLP, Artificial Intelligence, Machine Learning and Applications (NLAIM 2024) offers a premier global platform for exchanging insights and findings in the theory, methodology, and applications of NLP, Artificial Intelligence, Machine Learning, and their applications. The conference seeks substantial contributions across all key domains of NLP, Artificial Intelligence, Machine Learning, and their practical applications, aiming to foster both theoretical advancements and real-world implementations. With a focus on facilitating collaboration between researchers and practitioners from academia and industry, the conference serves as a nexus for sharing the latest developments in the field.
CHINA’S GEO-ECONOMIC OUTREACH IN CENTRAL ASIAN COUNTRIES AND FUTURE PROSPECT
The rivalry between prominent international actors for dominance over Central Asia's hydrocarbon
reserves and the ancient silk trade route, along with China's diplomatic endeavours in the area, has been
referred to as the "New Great Game." This research centres on the power struggle, considering
geopolitical, geostrategic, and geoeconomic variables. Topics including trade, political hegemony, oil
politics, and conventional and nontraditional security are all explored and explained by the researcher.
Using Mackinder's Heartland, Spykman Rimland, and Hegemonic Stability theories, examines China's role
in Central Asia. This study adheres to the empirical epistemological method and has taken care of
objectivity. This study analyze primary and secondary research documents critically to elaborate role of
china’s geo economic outreach in central Asian countries and its future prospect. China is thriving in trade,
pipeline politics, and winning states, according to this study, thanks to important instruments like the
Shanghai Cooperation Organisation and the Belt and Road Economic Initiative. According to this study,
China is seeing significant success in commerce, pipeline politics, and gaining influence on other
governments. This success may be attributed to the effective utilisation of key tools such as the Shanghai
Cooperation Organisation and the Belt and Road Economic Initiative.
A SYSTEMATIC RISK ASSESSMENT APPROACH FOR SECURING THE SMART IRRIGATION SYSTEMS
The smart irrigation system represents an innovative approach to optimize water usage in agricultural and landscaping practices. The integration of cutting-edge technologies, including sensors, actuators, and data analysis, empowers this system to provide accurate monitoring and control of irrigation processes by leveraging real-time environmental conditions. The main objective of a smart irrigation system is to optimize water efficiency, minimize expenses, and foster the adoption of sustainable water management methods. This paper conducts a systematic risk assessment by exploring the key components/assets and their functionalities in the smart irrigation system. The crucial role of sensors in gathering data on soil moisture, weather patterns, and plant well-being is emphasized in this system. These sensors enable intelligent decision-making in irrigation scheduling and water distribution, leading to enhanced water efficiency and sustainable water management practices. Actuators enable automated control of irrigation devices, ensuring precise and targeted water delivery to plants. Additionally, the paper addresses the potential threat and vulnerabilities associated with smart irrigation systems. It discusses limitations of the system, such as power constraints and computational capabilities, and calculates the potential security risks. The paper suggests possible risk treatment methods for effective secure system operation. In conclusion, the paper emphasizes the significant benefits of implementing smart irrigation systems, including improved water conservation, increased crop yield, and reduced environmental impact. Additionally, based on the security analysis conducted, the paper recommends the implementation of countermeasures and security approaches to address vulnerabilities and ensure the integrity and reliability of the system. By incorporating these measures, smart irrigation technology can revolutionize water management practices in agriculture, promoting sustainability, resource efficiency, and safeguarding against potential security threats.
Electric vehicle and photovoltaic advanced roles in enhancing the financial p...
Climate change's impact on the planet forced the United Nations and governments to promote green energies and electric transportation. The deployments of photovoltaic (PV) and electric vehicle (EV) systems gained stronger momentum due to their numerous advantages over fossil fuel types. The advantages go beyond sustainability to reach financial support and stability. The work in this paper introduces the hybrid system between PV and EV to support industrial and commercial plants. This paper covers the theoretical framework of the proposed hybrid system including the required equation to complete the cost analysis when PV and EV are present. In addition, the proposed design diagram which sets the priorities and requirements of the system is presented. The proposed approach allows setup to advance their power stability, especially during power outages. The presented information supports researchers and plant owners to complete the necessary analysis while promoting the deployment of clean energy. The result of a case study that represents a dairy milk farmer supports the theoretical works and highlights its advanced benefits to existing plants. The short return on investment of the proposed approach supports the paper's novelty approach for the sustainable electrical system. In addition, the proposed system allows for an isolated power setup without the need for a transmission line which enhances the safety of the electrical network
IEEE Aerospace and Electronic Systems Society as a Graduate Student Member
IEEE Aerospace and Electronic Systems Society as a Graduate Student Member
KuberTENes Birthday Bash Guadalajara - K8sGPT first impressions
K8sGPT is a tool that analyzes and diagnoses Kubernetes clusters. This presentation was used to share the requirements and dependencies to deploy K8sGPT in a local environment.
Modelagem de um CSTR com reação endotermica.pdf
Modelagem em função de transferencia. CSTR não-linear.
Presentation of IEEE Slovenia CIS (Computational Intelligence Society) Chapte...
Presentation of IEEE Slovenia CIS (Computational Intelligence Society) Chapte...University of Maribor
Slides from talk presenting:
Aleš Zamuda: Presentation of IEEE Slovenia CIS (Computational Intelligence Society) Chapter and Networking.
Presentation at IcETRAN 2024 session:
"Inter-Society Networking Panel GRSS/MTT-S/CIS
Panel Session: Promoting Connection and Cooperation"
IEEE Slovenia GRSS
IEEE Serbia and Montenegro MTT-S
IEEE Slovenia CIS
11TH INTERNATIONAL CONFERENCE ON ELECTRICAL, ELECTRONIC AND COMPUTING ENGINEERING
3-6 June 2024, Niš, SerbiaDEEP LEARNING FOR SMART GRID INTRUSION DETECTION: A HYBRID CNN-LSTM-BASED MODEL
As digital technology becomes more deeply embedded in power systems, protecting the communication
networks of Smart Grids (SG) has emerged as a critical concern. Distributed Network Protocol 3 (DNP3)
represents a multi-tiered application layer protocol extensively utilized in Supervisory Control and Data
Acquisition (SCADA)-based smart grids to facilitate real-time data gathering and control functionalities.
Robust Intrusion Detection Systems (IDS) are necessary for early threat detection and mitigation because
of the interconnection of these networks, which makes them vulnerable to a variety of cyberattacks. To
solve this issue, this paper develops a hybrid Deep Learning (DL) model specifically designed for intrusion
detection in smart grids. The proposed approach is a combination of the Convolutional Neural Network
(CNN) and the Long-Short-Term Memory algorithms (LSTM). We employed a recent intrusion detection
dataset (DNP3), which focuses on unauthorized commands and Denial of Service (DoS) cyberattacks, to
train and test our model. The results of our experiments show that our CNN-LSTM method is much better
at finding smart grid intrusions than other deep learning algorithms used for classification. In addition,
our proposed approach improves accuracy, precision, recall, and F1 score, achieving a high detection
accuracy rate of 99.50%.
bank management system in java and mysql report1.pdf
truth is high but higher still is truth full living
6th International Conference on Machine Learning & Applications (CMLA 2024)
6th International Conference on Machine Learning & Applications (CMLA 2024) will provide an excellent international forum for sharing knowledge and results in theory, methodology and applications of on Machine Learning & Applications.
Recently uploaded (20)
International Conference on NLP, Artificial Intelligence, Machine Learning an...
International Conference on NLP, Artificial Intelligence, Machine Learning an...
BPV-GUI-01-Guide-for-ASME-Review-Teams-(General)-10-10-2023.pdf
BPV-GUI-01-Guide-for-ASME-Review-Teams-(General)-10-10-2023.pdf
CHINA’S GEO-ECONOMIC OUTREACH IN CENTRAL ASIAN COUNTRIES AND FUTURE PROSPECT
CHINA’S GEO-ECONOMIC OUTREACH IN CENTRAL ASIAN COUNTRIES AND FUTURE PROSPECT
A SYSTEMATIC RISK ASSESSMENT APPROACH FOR SECURING THE SMART IRRIGATION SYSTEMS
A SYSTEMATIC RISK ASSESSMENT APPROACH FOR SECURING THE SMART IRRIGATION SYSTEMS
Electric vehicle and photovoltaic advanced roles in enhancing the financial p...
Electric vehicle and photovoltaic advanced roles in enhancing the financial p...
IEEE Aerospace and Electronic Systems Society as a Graduate Student Member
IEEE Aerospace and Electronic Systems Society as a Graduate Student Member
KuberTENes Birthday Bash Guadalajara - K8sGPT first impressions
KuberTENes Birthday Bash Guadalajara - K8sGPT first impressions
Presentation of IEEE Slovenia CIS (Computational Intelligence Society) Chapte...
Presentation of IEEE Slovenia CIS (Computational Intelligence Society) Chapte...
DEEP LEARNING FOR SMART GRID INTRUSION DETECTION: A HYBRID CNN-LSTM-BASED MODEL
DEEP LEARNING FOR SMART GRID INTRUSION DETECTION: A HYBRID CNN-LSTM-BASED MODEL
bank management system in java and mysql report1.pdf
bank management system in java and mysql report1.pdf
6th International Conference on Machine Learning & Applications (CMLA 2024)
6th International Conference on Machine Learning & Applications (CMLA 2024)
2. Operations Strategy in a Global Environment.ppt
2. Operations Strategy in a Global Environment.ppt
Matlab lecture 3 – commands, the m files, data types, bitwise op, set@taj
- 1. IT-2210 : Computational mathematics LAB with MATLAB 4/10/2017MATLAB by Tajim 1
- 2. Lecture 3: MATLAB – Commands, The M Files, Data Types, Bitwise Operations And Set Operations. 4/10/2017MATLAB by Tajim 2
- 10. 4/10/2017MATLAB by Tajim 10
- 11. 4/10/2017MATLAB by Tajim 11
- 12. 4/10/2017MATLAB by Tajim 12
- 13. 4/10/2017MATLAB by Tajim 13
- 14. 4/10/2017MATLAB by Tajim 14
- 15. 4/10/2017MATLAB by Tajim 15
- 16. MATLAB by Tajim 16 Example of determination output
- 17. 4/10/2017MATLAB by Tajim 17
- 18. 4/10/2017MATLAB by Tajim 18
- 19. 4/10/2017MATLAB by Tajim 19
- 20. 4/10/2017MATLAB by Tajim 20
- 21. 4/10/2017MATLAB by Tajim 21 End of LECTURE Three Thank You . Resources: Tutorials point and MSK sir’s lecture.