High performance intrusion detection using modified k mean & naïve bayeseSAT Journals
Abstract
Internet Technology is growing at exponential rate day by day, making data security of computer systems more complex and critical. There has been multiple methodology implemented for the same in recent time as detailed in [1], [3]. Availability of larger bandwidth has made the multiple large computer server network connected worldwide and thus increasing the load on the necessity to secure data and Intrusion detection system (IDS) is one of the most efficient technique to maintain security of computer system. The proposed system is designed in such a way that are helpful in identifying malicious behavior and improper use of computer system. In this report we proposed a hybrid technique for intrusion detection using data mining algorithms. Our main objective is to do complete analysis of intrusion detection Dataset to test the implemented system.In This report we will propose a new methodology in which Modified k-mean is used for clustering whereas Naïve Bayes for the classification. These two data mining techniques will be used for Intrusion detection in large horizontally distributed database.
Keywords: Intrusion Detection, Modified K-Mean, Naïve Bays
High performance intrusion detection using modified k mean & naïve bayeseSAT Journals
Abstract
Internet Technology is growing at exponential rate day by day, making data security of computer systems more complex and critical. There has been multiple methodology implemented for the same in recent time as detailed in [1], [3]. Availability of larger bandwidth has made the multiple large computer server network connected worldwide and thus increasing the load on the necessity to secure data and Intrusion detection system (IDS) is one of the most efficient technique to maintain security of computer system. The proposed system is designed in such a way that are helpful in identifying malicious behavior and improper use of computer system. In this report we proposed a hybrid technique for intrusion detection using data mining algorithms. Our main objective is to do complete analysis of intrusion detection Dataset to test the implemented system.In This report we will propose a new methodology in which Modified k-mean is used for clustering whereas Naïve Bayes for the classification. These two data mining techniques will be used for Intrusion detection in large horizontally distributed database.
Keywords: Intrusion Detection, Modified K-Mean, Naïve Bays
High performance intrusion detection using modified k mean & naïve bayeseSAT Journals
Abstract
Internet Technology is growing at exponential rate day by day, making data security of computer systems more complex and critical. There has been multiple methodology implemented for the same in recent time as detailed in [1], [3]. Availability of larger bandwidth has made the multiple large computer server network connected worldwide and thus increasing the load on the necessity to secure data and Intrusion detection system (IDS) is one of the most efficient technique to maintain security of computer system. The proposed system is designed in such a way that are helpful in identifying malicious behavior and improper use of computer system. In this report we proposed a hybrid technique for intrusion detection using data mining algorithms. Our main objective is to do complete analysis of intrusion detection Dataset to test the implemented system.In This report we will propose a new methodology in which Modified k-mean is used for clustering whereas Naïve Bayes for the classification. These two data mining techniques will be used for Intrusion detection in large horizontally distributed database.
Keywords: Intrusion Detection, Modified K-Mean, Naïve Bays
High performance intrusion detection using modified k mean & naïve bayeseSAT Journals
Abstract
Internet Technology is growing at exponential rate day by day, making data security of computer systems more complex and critical. There has been multiple methodology implemented for the same in recent time as detailed in [1], [3]. Availability of larger bandwidth has made the multiple large computer server network connected worldwide and thus increasing the load on the necessity to secure data and Intrusion detection system (IDS) is one of the most efficient technique to maintain security of computer system. The proposed system is designed in such a way that are helpful in identifying malicious behavior and improper use of computer system. In this report we proposed a hybrid technique for intrusion detection using data mining algorithms. Our main objective is to do complete analysis of intrusion detection Dataset to test the implemented system.In This report we will propose a new methodology in which Modified k-mean is used for clustering whereas Naïve Bayes for the classification. These two data mining techniques will be used for Intrusion detection in large horizontally distributed database.
Keywords: Intrusion Detection, Modified K-Mean, Naïve Bays
Wireless communication without pre shared secrets using spread spectrum techn...eSAT Journals
Abstract
The wireless communication using spread spectrum relies on the assumption that some secret is shared among source and
destination node before communication or transmission has started. This problem is called the circular dependency problem
(CDP). This CDP exists in large networks, where nodes frequently join and leaves the network. In this work we have introduced
an efficient and reliable mechanism called Advanced Encryption Standard (AES) Algorithm, to overcome circular dependency
problem (CDP). This is an efficient algorithm to make successful transmission of data without pre-sharing any secret key. We
have evaluated this by simulation in Matrix Laboratory (MATLAB).
Keywords: -Spread spectrum, CDP, AES and MATLAB.
Bio-inspired algorithm for decisioning wireless access point installation IJECEIAES
This paper presents the bio-inspired algorithms for decisioning wireless access point (AP) installation. In order to achieve the desired coverage capability of APs, the bio-inspired algorithms are applied for robust competition and optimization. The main objective is to determine the optimal number of APs with the high coverage capability in the concerning area using the genetic and ant colony optimization algorithms. Received signal strength indicator (RSSI) and line-of-sight (LoS) gradient approach are the most important parameters for AP installation depending on the AP signal strength. Practical experiments are tested on the embedded system using Xilinx Kria KR260 and Raspberry Pi Zero 2W boards at the tested room size about 16 m wide and 40 m long inside the building. Xilinx Kria KR260 board is used to calculate the number of AP installation and localization compared to Xcode. Then, Raspberry Pi Zero 2W board is the representation of wireless AP for measuring the signal in the testing area. Experiment results show that maximum received signals strength is equal to -35 dBm at 6 m and there are six APs installation with high coverage area and maximum received signal strength at the area of 16×40 m 2 .
Artificial Neural Network Based Graphical User Interface for Estimation of Fa...ijsrd.com
This paper addresses the problem of estimation of fabrication time in Rig construction projects through application of Artificial Neural Network (ANNs) as this is the most crucial activity for successful project management planning. ANN is a non-linear, data driven, self adaptive approach as opposed to the traditional model based methods, also fast becoming popular in forecasting where relationship between input and output is not known but vast collection of data is available. Around 960 data regarding fabrication activity has been collected from ABG Shipyard Ltd., Dahej. 3 input parameters have been considered for estimation of output as fabrication time. 11 Feed Forward Back Propagation neural networks with different network architectures were made. Network N10 was able to predict the output with MSE 1.35337e-2. Coding was done for the Graphical User Interface (GUI) so that the GUI runs, simulates network N10, and displays the fabrication time for different combination of inputs.
How to Prepare for Juniper JN0-480 Certification.pdfNWEXAM
Start Here--- https://bit.ly/3TGoe50 ---Get complete detail on JN0-480 exam guide to crack Juniper Networks Certified Specialist Data Center. You can collect all information on JN0-480 tutorial, practice test, books, study material, exam questions, and syllabus. Firm your knowledge on Juniper Networks Certified Specialist Data Center and get ready to crack JN0-480 certification. Explore all information on JN0-480 exam with number of questions, passing percentage and time duration to complete test.
Synthesis and Refinement of Artificial HVAC Sensor Data Intended for Supervis...IES VE
IES' David McCabe presented at the 9th International Conference Improving Energy Efficiency in Commercial Buildings and Smart Communities (IEECB&SC’16) in Frankfurt on 16th March 2016.
This presentation was in support of a paper published by IES R&D in conjunction with the EINSTEIN project. The paper can be viewed here: http://www.iesve.com/corporate/media-center/white-papers/general/hvac-afdd-jun2016.pdf
The cable harness tester has an important role in bringing in the quality and reliability of electrical cable assemblies that are used in many industries, such as aerospace, automotive, defence, and manufacturing. This is one of the most important functions of cable harness assembly as it helps in finding defects, ensuring the connectivity is right, and testing the on-field performance of the harnesses.
Techniques to optimize the pagerank algorithm usually fall in two categories. One is to try reducing the work per iteration, and the other is to try reducing the number of iterations. These goals are often at odds with one another. Skipping computation on vertices which have already converged has the potential to save iteration time. Skipping in-identical vertices, with the same in-links, helps reduce duplicate computations and thus could help reduce iteration time. Road networks often have chains which can be short-circuited before pagerank computation to improve performance. Final ranks of chain nodes can be easily calculated. This could reduce both the iteration time, and the number of iterations. If a graph has no dangling nodes, pagerank of each strongly connected component can be computed in topological order. This could help reduce the iteration time, no. of iterations, and also enable multi-iteration concurrency in pagerank computation. The combination of all of the above methods is the STICD algorithm. [sticd] For dynamic graphs, unchanged components whose ranks are unaffected can be skipped altogether.
More Related Content
Similar to Geometry prediction of the antenna design using machine learning method
Wireless communication without pre shared secrets using spread spectrum techn...eSAT Journals
Abstract
The wireless communication using spread spectrum relies on the assumption that some secret is shared among source and
destination node before communication or transmission has started. This problem is called the circular dependency problem
(CDP). This CDP exists in large networks, where nodes frequently join and leaves the network. In this work we have introduced
an efficient and reliable mechanism called Advanced Encryption Standard (AES) Algorithm, to overcome circular dependency
problem (CDP). This is an efficient algorithm to make successful transmission of data without pre-sharing any secret key. We
have evaluated this by simulation in Matrix Laboratory (MATLAB).
Keywords: -Spread spectrum, CDP, AES and MATLAB.
Bio-inspired algorithm for decisioning wireless access point installation IJECEIAES
This paper presents the bio-inspired algorithms for decisioning wireless access point (AP) installation. In order to achieve the desired coverage capability of APs, the bio-inspired algorithms are applied for robust competition and optimization. The main objective is to determine the optimal number of APs with the high coverage capability in the concerning area using the genetic and ant colony optimization algorithms. Received signal strength indicator (RSSI) and line-of-sight (LoS) gradient approach are the most important parameters for AP installation depending on the AP signal strength. Practical experiments are tested on the embedded system using Xilinx Kria KR260 and Raspberry Pi Zero 2W boards at the tested room size about 16 m wide and 40 m long inside the building. Xilinx Kria KR260 board is used to calculate the number of AP installation and localization compared to Xcode. Then, Raspberry Pi Zero 2W board is the representation of wireless AP for measuring the signal in the testing area. Experiment results show that maximum received signals strength is equal to -35 dBm at 6 m and there are six APs installation with high coverage area and maximum received signal strength at the area of 16×40 m 2 .
Artificial Neural Network Based Graphical User Interface for Estimation of Fa...ijsrd.com
This paper addresses the problem of estimation of fabrication time in Rig construction projects through application of Artificial Neural Network (ANNs) as this is the most crucial activity for successful project management planning. ANN is a non-linear, data driven, self adaptive approach as opposed to the traditional model based methods, also fast becoming popular in forecasting where relationship between input and output is not known but vast collection of data is available. Around 960 data regarding fabrication activity has been collected from ABG Shipyard Ltd., Dahej. 3 input parameters have been considered for estimation of output as fabrication time. 11 Feed Forward Back Propagation neural networks with different network architectures were made. Network N10 was able to predict the output with MSE 1.35337e-2. Coding was done for the Graphical User Interface (GUI) so that the GUI runs, simulates network N10, and displays the fabrication time for different combination of inputs.
How to Prepare for Juniper JN0-480 Certification.pdfNWEXAM
Start Here--- https://bit.ly/3TGoe50 ---Get complete detail on JN0-480 exam guide to crack Juniper Networks Certified Specialist Data Center. You can collect all information on JN0-480 tutorial, practice test, books, study material, exam questions, and syllabus. Firm your knowledge on Juniper Networks Certified Specialist Data Center and get ready to crack JN0-480 certification. Explore all information on JN0-480 exam with number of questions, passing percentage and time duration to complete test.
Synthesis and Refinement of Artificial HVAC Sensor Data Intended for Supervis...IES VE
IES' David McCabe presented at the 9th International Conference Improving Energy Efficiency in Commercial Buildings and Smart Communities (IEECB&SC’16) in Frankfurt on 16th March 2016.
This presentation was in support of a paper published by IES R&D in conjunction with the EINSTEIN project. The paper can be viewed here: http://www.iesve.com/corporate/media-center/white-papers/general/hvac-afdd-jun2016.pdf
The cable harness tester has an important role in bringing in the quality and reliability of electrical cable assemblies that are used in many industries, such as aerospace, automotive, defence, and manufacturing. This is one of the most important functions of cable harness assembly as it helps in finding defects, ensuring the connectivity is right, and testing the on-field performance of the harnesses.
Techniques to optimize the pagerank algorithm usually fall in two categories. One is to try reducing the work per iteration, and the other is to try reducing the number of iterations. These goals are often at odds with one another. Skipping computation on vertices which have already converged has the potential to save iteration time. Skipping in-identical vertices, with the same in-links, helps reduce duplicate computations and thus could help reduce iteration time. Road networks often have chains which can be short-circuited before pagerank computation to improve performance. Final ranks of chain nodes can be easily calculated. This could reduce both the iteration time, and the number of iterations. If a graph has no dangling nodes, pagerank of each strongly connected component can be computed in topological order. This could help reduce the iteration time, no. of iterations, and also enable multi-iteration concurrency in pagerank computation. The combination of all of the above methods is the STICD algorithm. [sticd] For dynamic graphs, unchanged components whose ranks are unaffected can be skipped altogether.
Opendatabay - Open Data Marketplace.pptxOpendatabay
Opendatabay.com unlocks the power of data for everyone. Open Data Marketplace fosters a collaborative hub for data enthusiasts to explore, share, and contribute to a vast collection of datasets.
First ever open hub for data enthusiasts to collaborate and innovate. A platform to explore, share, and contribute to a vast collection of datasets. Through robust quality control and innovative technologies like blockchain verification, opendatabay ensures the authenticity and reliability of datasets, empowering users to make data-driven decisions with confidence. Leverage cutting-edge AI technologies to enhance the data exploration, analysis, and discovery experience.
From intelligent search and recommendations to automated data productisation and quotation, Opendatabay AI-driven features streamline the data workflow. Finding the data you need shouldn't be a complex. Opendatabay simplifies the data acquisition process with an intuitive interface and robust search tools. Effortlessly explore, discover, and access the data you need, allowing you to focus on extracting valuable insights. Opendatabay breaks new ground with a dedicated, AI-generated, synthetic datasets.
Leverage these privacy-preserving datasets for training and testing AI models without compromising sensitive information. Opendatabay prioritizes transparency by providing detailed metadata, provenance information, and usage guidelines for each dataset, ensuring users have a comprehensive understanding of the data they're working with. By leveraging a powerful combination of distributed ledger technology and rigorous third-party audits Opendatabay ensures the authenticity and reliability of every dataset. Security is at the core of Opendatabay. Marketplace implements stringent security measures, including encryption, access controls, and regular vulnerability assessments, to safeguard your data and protect your privacy.
Adjusting primitives for graph : SHORT REPORT / NOTESSubhajit Sahu
Graph algorithms, like PageRank Compressed Sparse Row (CSR) is an adjacency-list based graph representation that is
Multiply with different modes (map)
1. Performance of sequential execution based vs OpenMP based vector multiply.
2. Comparing various launch configs for CUDA based vector multiply.
Sum with different storage types (reduce)
1. Performance of vector element sum using float vs bfloat16 as the storage type.
Sum with different modes (reduce)
1. Performance of sequential execution based vs OpenMP based vector element sum.
2. Performance of memcpy vs in-place based CUDA based vector element sum.
3. Comparing various launch configs for CUDA based vector element sum (memcpy).
4. Comparing various launch configs for CUDA based vector element sum (in-place).
Sum with in-place strategies of CUDA mode (reduce)
1. Comparing various launch configs for CUDA based vector element sum (in-place).
Explore our comprehensive data analysis project presentation on predicting product ad campaign performance. Learn how data-driven insights can optimize your marketing strategies and enhance campaign effectiveness. Perfect for professionals and students looking to understand the power of data analysis in advertising. for more details visit: https://bostoninstituteofanalytics.org/data-science-and-artificial-intelligence/
Geometry prediction of the antenna design using machine learning method
1. GEOMETRY PREDICTION OF THE
ANTENNA DESIGN USING MACHINE
LEARNING METHOD
Agusriandi
Eko Setijadi, S.T., M.T., Ph.D.
Dr. Ir. Achmad Affandi, DEA
agusriandi595@gmail.com
INDONESIA, 11 December 2023
4. Digital, Global, Integrity
Literature Review
Principle of Predicting
The principle of predicting is a method used in
antenna design to predict the performance of
an antenna system before it is built. This is
done by using mathematical models and
simulations to predict the antenna's radiation
pattern, gain, and other important parameters.
Applications in Antenna Design
The principle of predicting is used extensively in antenna
design for wireless communication systems. By using this
method, engineers can design antennas that meet the
specific requirements of a particular system, such as
frequency range, bandwidth, and gain. This helps to ensure
that the antenna system performs optimally and provides
reliable communication.
5. Digital, Global, Integrity
THERE IS A NEED FOR NEW
METHODS THAT CAN PRODUCE
PREDICTIONS FOR THE DESIGN
AND OPTIMIZATION OF ANTENNA
BY UTILIZING ML
7. Digital, Global, Integrity
Experiment
• substrate = FR-4
• dielectric constant = 4.5
• thickness = 1.5 mm
• Frequency = 13 GHz
• Width = 6.253 mm
• Length = 4.788 mm
• Feed lines = 3.5 mm
8. Digital, Global, Integrity
Dataset Preparation
The success of a machine learning model in antenna
design depends largely on the quality of the dataset
used to train it. Here are some steps to prepare the
dataset:
• Collect data on antenna designs and their
corresponding performance metrics, such as gain
and radiation pattern.
• Preprocess the data by normalizing or
standardizing the input features and output metrics
to ensure they are comparable and have similar
ranges.
• Split the dataset into training, validation, and test
sets. The training set is used to train the model,
the validation set is used to tune the
hyperparameters and prevent overfitting, and the
test set is used to evaluate the final performance
of the model.
9. Digital, Global, Integrity
Data Collection
Collect data on existing antenna
designs and their performance
characteristics.
Data Preprocessing
Clean and format the collected
data to ensure it is suitable for use
in the machine learning model.
Feature Selection
Identify the most relevant features
from the preprocessed data to
use in the machine learning
model.
Training Model
10. Digital, Global, Integrity
Testing and Validation
Testing
Testing involves measuring the performance of the
designed antenna in a controlled environment. This can
be done using specialized equipment such as anechoic
chambers or network analyzers. The data collected from
testing is used to validate the antenna design and make
necessary adjustments.
Validation
Validation involves testing the designed antenna in
real-world scenarios to ensure that it meets the
required specifications and performs optimally. This
can be done using simulation software or by deploying
the antenna in a real-world environment. The data
collected from validation is used to fine-tune the
antenna design and ensure that it performs as
expected.
11. Digital, Global, Integrity
Results and
Analysis
Simulation Results
Our simulations show that the antenna
designs generated using machine
learning algorithms outperform
traditional designs by up to 20%.
Optimization Results
Our machine learning algorithm was
able to optimize antenna designs for
both size and performance, resulting in
smaller and more efficient antennas.
Performance Analysis
Our analysis of antenna performance data
shows that the machine learning-
generated designs have a more stable
and consistent performance across
different operating conditions.
13. Digital, Global, Integrity
s11 = s
paramater
sL = substrate
length
L = Length patch
fw = feed width
w = width patch
The number of data rows collected 243 rows from several times
the Sweep parameters
Generate Dataset
Assalamu’alaikum wr.wb..
Good afternoon everyone
Before we begin our presentation let me introduce myself.. My name is Agusriandi
In this time, I’m going to share you about
I will begin... Outline ... Fist of all
Let’s move on to background.. Engineers use computer-aided design software and real-world testing to optimise the antenna design for the best performance.
However, numerical methods provide effective results by using a combination of mathematical operations. This process has to be repeated every time a small change is made to the geometry. This is time consuming.. The other hands, The major problem of ML methods are accuracy and effecitivenss
The ML methods and algorithms used to predict antenna geometry included linear regression, decision trees (random forests), polynomial regression, neural networks (deep learning) and support vector machines (SVMs).
Therefore, THERE IS A NEED FOR NEW METHODS THAT CAN PRODUCE PREDICTIONS FOR THE DESIGN AND OPTIMIZATION OF ANTENNA BY UTILIZING ML
in this study, the SVM was recommended due to its advantageous properties, which often converge to the global minimum rather than getting stuck in local minima when dealing with highly non-linear problems.
The step of the methodology such as ecperiment, dataset
in the experimental step,
We set the properties of the design antenna as
The next step... Dataset preparation included : collect data
The training medel step, Here are some steps and others if possible
The testing and validation step ...
The Validation involves testing the designed antenna in real-world scenarios to ensure that it meets the required specifications and performs optimally.
Testing
Testing involves measuring the performance of the designed antenna in a controlled environment
In this slide,
I will show the results and discussion of this research, where
The Top Figure is parameter values
The bottom figure is result of simulation
The right figure is S11 parameter
The Left figure show dataset form parameter sweep in CST Suite Studio
The right figure show set of the parameter sweep
The Figure show the result of training model using SVM algorithm. The result prediction is fifteen point six eight
The figure show comparison of result from expriments and simulation of ML. where red line is experiment and blue line is simulation ML
I’d like to conclude my presentation.., this study has confirmed the effectiveness of Machine Learning (ML) in designing a simple microstrip patch antenna. Despite the small amount of data collected from the simulator. A correlation coefficient of 0.986 (zero point nine eight six) was obtained using the ML, namely rectangular patch antennas operating at a frequency of 13 GHz. The ML approach provides a superior support for the design of antennas with a higher degree of accuracy and efficiency compared to other methods