Security
Hello, friends so welcome back to another article in this article we are going to take a look at how to install Wazuh agent on Windows systems. The installation process is pretty straight forward and easy. If you haven't read about what Wazuh is and what are the
Python
Hey! Everyone I hope y'all are doing great in your life. so today we will be further continuing to discuss more built-in Python String Functions. If you haven't read the first part do check it out first over here: Python String Functions Index() The index() function/
Python
Hey! Everyone I hope y'all are doing great in your life. so today we will be talking about built-in Python String Functions. What is a Function? A function is a block of organized, reusable code that is used to perform a single, related action. Functions provide better modularity
Security
Wazuh is a scalable multi-platform, open-source host-based intrusion detection (HIDs) system. It was born as folk of strong correlation and analysis engine of Ossec. Wazuh has become a more comprehensive solution by integrating with Elastic Stack and OpenSCAP. Wazuh has a log analysis, file integrity checking, Windows Registry monitoring, rootkit
Security
Hello, friends, I hope you are doing great learning new stuff and working on your skills. In this article, I will be continuing the previous article that I wrote related to the Open-Source SIEM solution. I will be talking about How to Setup Wazuh Open Source SIEM. In this part,
AI
Alpha Beta Pruning: In Minimax Procedure, it seems as the static evaluator must be used on each leaf node. Fortunately, there is a procedure that reduces both the tree branches that must be generated and the number of evaluations. This procedure is called Alpha Beta pruning which “prunes” the tree
AI
Adversarial Search: Up until now all the searches that we have studied there were only one person or agent searching the solution space to find the goal or the solution. In many applications, there might be multiple agents or persons searching for solutions in the same solution space. Such scenarios
AI
We will be covering: * Best-first Search * Greedy Best First Search Algorithm * A* The best first search considers all the open nodes so far and selects the best amongst them. The following sequence of diagrams will show you how a best-first search procedure works in a search tree. • We start with
AI
So far we have looked at uninformed and informed searches. Both have their advantages and disadvantages. But one thing that lacks in both is that whenever they find a solution they immediately stop. They never consider that there might be more than one solution to the problem and the solution
AI
Heuristically Informed Searches: So far we have looked into procedures that search the search space in an uninformed manner. Such procedures are usually costly with respect to either time, space or both. We now focus on a few techniques that search the solution space in an informed manner using something
AI
The algorithm we studied in the previous lecture was a backtracking algorithm to search for a goal in a given graph. There are some other graph search algorithms which are more flexible. • Depth First Search • Breadth-First Search • Best First Search (will be discussed later) Depth First Search: In addition, to
AI
Historically many people link intelligence with the capability to solve a problem. Problem-solving is one of the factors that demonstrate intelligence. The classical approach that is used is “hit and trial” that check for various solutions to that problem. We use this approach to solve small problems. For example: Consider