Our team had to use signal processing techniques to find the direction of desired incoming signals at an antenna rejecting interference from other signals.
Symbol Based Modulation Classification using Combination of Fuzzy Clustering ...CSCJournals
Most of approaches for recognition and classification of modulation have been founded on modulated signal’s components. In this paper, we develop an algorithm using fuzzy clustering and consequently hierarchical clustering algorithms considering the constellation of the received signal to identify the modulation types of the communication signals automatically. The simulation that has been conducted shows high capability of this method for recognition of modulation levels in the presence of noise and also, this method is applicable to digital modulations of arbitrary size and dimensionality. In addition this classification finds the decision boundary of the signal which is critical information for bit detection.
Hybridization of Meta-heuristics for Optimizing Routing protocol in VANETsIJERA Editor
The goal of VANET is to establish a vehicular communication system which is reliable and fast which caters to
road safety and road safety. In VANET where network fragmentation is frequent with no central control, routing
becomes a challenging task. Planning an optimal routing plan for tuning parameter configuration of routing
protocol for setting up VANET is very crucial. This is done by defining an optimization problem where
hybridization of meta-heuristics is defined. The paper contributes the idea of combining meta-heuristic
algorithm to enhance the performance of individual search method for optimization problem.
Optimized Robot Path Planning Using Parallel Genetic Algorithm Based on Visib...IJERA Editor
An analysis is made for optimized path planning for mobile robot by using parallel genetic algorithm. The
parallel genetic algorithm (PGA) is applied on the visible midpoint approach to find shortest path for mobile
robot. The hybrid ofthese two algorithms provides a better optimized solution for smooth and shortest path for
mobile robot. In this problem, the visible midpoint approach is used to make the effectiveness for avoiding
local minima. It gives the optimum paths which are always consisting on free trajectories. But the
proposedhybrid parallel genetic algorithm converges very fast to obtain the shortest route from source to
destination due to the sharing of population. The total population is partitioned into a number subgroups to
perform the parallel GA. The master thread is the center of information exchange and making selection with
fitness evaluation.The cell to cell crossover makes the algorithm significantly good. The problem converges
quickly with in a less number of iteration.
Symbol Based Modulation Classification using Combination of Fuzzy Clustering ...CSCJournals
Most of approaches for recognition and classification of modulation have been founded on modulated signal’s components. In this paper, we develop an algorithm using fuzzy clustering and consequently hierarchical clustering algorithms considering the constellation of the received signal to identify the modulation types of the communication signals automatically. The simulation that has been conducted shows high capability of this method for recognition of modulation levels in the presence of noise and also, this method is applicable to digital modulations of arbitrary size and dimensionality. In addition this classification finds the decision boundary of the signal which is critical information for bit detection.
Hybridization of Meta-heuristics for Optimizing Routing protocol in VANETsIJERA Editor
The goal of VANET is to establish a vehicular communication system which is reliable and fast which caters to
road safety and road safety. In VANET where network fragmentation is frequent with no central control, routing
becomes a challenging task. Planning an optimal routing plan for tuning parameter configuration of routing
protocol for setting up VANET is very crucial. This is done by defining an optimization problem where
hybridization of meta-heuristics is defined. The paper contributes the idea of combining meta-heuristic
algorithm to enhance the performance of individual search method for optimization problem.
Optimized Robot Path Planning Using Parallel Genetic Algorithm Based on Visib...IJERA Editor
An analysis is made for optimized path planning for mobile robot by using parallel genetic algorithm. The
parallel genetic algorithm (PGA) is applied on the visible midpoint approach to find shortest path for mobile
robot. The hybrid ofthese two algorithms provides a better optimized solution for smooth and shortest path for
mobile robot. In this problem, the visible midpoint approach is used to make the effectiveness for avoiding
local minima. It gives the optimum paths which are always consisting on free trajectories. But the
proposedhybrid parallel genetic algorithm converges very fast to obtain the shortest route from source to
destination due to the sharing of population. The total population is partitioned into a number subgroups to
perform the parallel GA. The master thread is the center of information exchange and making selection with
fitness evaluation.The cell to cell crossover makes the algorithm significantly good. The problem converges
quickly with in a less number of iteration.
A COMPARISON BETWEEN SWARM INTELLIGENCE ALGORITHMS FOR ROUTING PROBLEMSecij
Travelling salesman problem (TSP) is a most popular combinatorial routing problem, belongs to the class of NP-hard problems. Many approacheshave been proposed for TSP.Among them, swarm intelligence (SI) algorithms can effectively achieve optimal tours with the minimum lengths and attempt to avoid trapping in local minima points. The transcendence of each SI is depended on the nature of the problem. In our studies, there has been yet no any article, which had compared the performance of SI algorithms for TSP perfectly. In this paper,four common SI algorithms are used to solve TSP, in order to compare the performance of SI algorithms for the TSP problem. These algorithms include genetic algorithm, particle swarm optimization, ant colony optimization, and artificial bee colony. For each SI, the various parameters and operators were tested, and the best values were selected for it. Experiments oversome benchmarks fromTSPLIBshow that
artificial bee colony algorithm is the best one among the fourSI-basedmethods to solverouting problems like TSP.
Hybrid multi objectives genetic algorithms and immigrants scheme for dynamic ...khalil IBRAHIM
the main concept of intelligent optimization techniques, artificial neural networks, and new genetic algorithms to solve the multi-objective multicast routing problems with shortest path (SP) problem that used in the addresses networks and improve all processes addressing in the wireless communications based on multi-objective optimization. The most important characteristics in mobile wireless networks is the topology dynamics and the network topology changes over time, the routing problem (SPRP) in mobile ad hoc networks (MANETs) turns out to be a dynamic optimization problem[13], the hybrid immigrants multiple-objective genetic algorithm (HIMOGAs) in the real- world are dynamic in nature, that has objective functions, constraints, and parameters, the dynamic optimization problems (DOPs) are a big challenges to evolutionary multi-objective, since any environmental change may affect the objective vector, constraints, and parameters, HIMOGA for the optimization goal is to track the moving of parameters and get a sequence of approximations solutions over time. The quantity of services (QoS) is supporting guarantee for all data traffic and getting the maximizing utilization for network, the QoS based on multicast routing offers significant challenges, and increases to use an efficient multicast routing protocol that will be able to check multicast routing and satisfying QoS constraints, The author propose to use HIMOGAs and SP algorithm to solve multicast problem that produces new generation wireless networks with immigrants schema to get high-quality solutions after each change and satisfying all objectives.
EFFECTIVE REDIRECTING OF THE MOBILE ROBOT IN A MESSED ENVIRONMENT BASED ON TH...ijfls
The use of fuzzy logic in redirecting mobile robot is based on two sets of received information. First set is the instantaneous distance of the robot from the obstacle and second set is the instantaneous information of the robot's position. For this purpose, the fuzzy rules base consists of forty-two bases, which is extracted based on the robot's distance from obstacles, and the target position relative to the instantaneous orientation of the robot. In the structure of fuzzy systems, minimal inference engine are considered. Also, Extended Kalman filter is used for localization in a noisy environment. Accordingly, the inputs of the fuzzy systems are determined based on the estimation of the localization process, the information of the obstacles center and the target position. Also, the linear acceleration and instantaneous orientation of the mobile robot are determined by the desired fuzzy structures which are applied to its kinematic model.
EFFECTIVE REDIRECTING OF THE MOBILE ROBOT IN A MESSED ENVIRONMENT BASED ON TH...Wireilla
The use of fuzzy logic in redirecting mobile robot is based on two sets of received information. First set is
the instantaneous distance of the robot from the obstacle and second set is the instantaneous information of
the robot's position. For this purpose, the fuzzy rules base consists of forty-two bases, which is extracted
based on the robot's distance from obstacles, and the target position relative to the instantaneous
orientation of the robot. In the structure of fuzzy systems, minimal inference engine are considered. Also,
Extended Kalman filter is used for localization in a noisy environment. Accordingly, the inputs of the fuzzy
systems are determined based on the estimation of the localization process, the information of the obstacles
center and the target position. Also, the linear acceleration and instantaneous orientation of the mobile
robot are determined by the desired fuzzy structures which are applied to its kinematic model.
Routing in Wireless Mesh Networks: Two Soft Computing Based Approachesijmnct
Due to dynamic network conditions, routing is the most critical part in WMNs and needs to be optimised.
The routing strategies developed for WMNs must be efficient to make it an operationally self configurable
network. Thus we need to resort to near shortest path evaluation. This lays down the requirement of some
soft computing approaches such that a near shortest path is available in an affordable computing time. This
paper proposes a Fuzzy Logic based integrated cost measure in terms of delay, throughput and jitter.
Based upon this distance (cost) between two adjacent nodes we evaluate minimal shortest path that updates
routing tables. We apply two recent soft computing approaches namely Big Bang Big Crunch (BB-BC) and
Biogeography Based Optimization (BBO) approaches to enumerate shortest or near short paths. BB-BC
theory is related with the evolution of the universe whereas BBO is inspired by dynamical equilibrium in
the number of species on an island. Both the algorithms have low computational time and high convergence
speed. Simulation results show that the proposed routing algorithms find the optimal shortest path taking
into account three most important parameters of network dynamics. It has been further observed that for
the shortest path problem BB-BC outperforms BBO in terms of speed and percent error between the
evaluated minimal path and the actual shortest path.
Multiple Ant Colony Optimizations for Stereo MatchingCSCJournals
The stereo matching problem, which obtains the correspondence between right and left images, can be cast as a search problem. The matching of all candidates in the same line forms a 2D optimization task and the two dimensional (2D) optimization is a NP-hard problem. There are two characteristics in stereo matching. Firstly, the local optimization process along each scan-line can be done concurrently; secondly, there are some relationship among adjacent scan-lines can be explored to promote the matching correctness. Although there are many methods, such as GCPs, GGCPs are proposed, but these so called GCPs maybe not be ground. The relationship among adjacent scan-lines is posteriori, that is to say the relationship can only be discovered after every optimization is finished. The Multiple Ant Colony Optimization(MACO) is efficient to solve large scale problem. It is a proper way to settle down the stereo matching task with constructed MACO, in which the master layer values the sub-solutions and propagate the reliability after every local optimization is finished. Besides, whether the ordering and uniqueness constraints should be considered during the optimization is discussed, and the proposed algorithm is proved to guarantee its convergence to find the optimal matched pairs.
Multi Object Tracking Methods Based on Particle Filter and HMMIJTET Journal
Abstract – For various application detection of objects movement in a video is an important process. Determination of path of object as time advances is a tedious step. Many proposal for tracking the multiple movement of object has been put forward using various sophisticated techniques. In this paper detail description of the recent object trackers based on particle filtering and Markov Models have been analyzed. The outcome of the analysis is computational efficiency, robustness and computational complexity.
To Get any Project for CSE, IT ECE, EEE Contact Me @ 09666155510, 09849539085 or mail us - ieeefinalsemprojects@gmail.com-Visit Our Website: www.finalyearprojects.org
Application of normalized cross correlation to image registrationeSAT Publishing House
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology.
Combining Neural Network and Firefly Algorithm to Predict Stock Price in Tehr...Editor IJCATR
In the present research, prediction of stock price index in Tehran stock exchange by using neural
networks and firefly algorithm in chaotic behavior of price index stock exchange are studied. Two data sets
are selected for neural network input. Various breaks of index and macro economic factors are considered
as independent variables. Also, firefly algorithm is used to [redict price index in next week. The results of
research show that combining neural networks and firefly optimization algorithm has better performance
than neural network to predict the price index. In addition, acceptable value of error-sequre means for
network error in test data show that there are chaotic mevements in behaviour of price index.
Multi-Robot Task Allocation using Meta-heuristic OptimizationMohamed Ghanem
Bachelor Defense Presentation,
The aim of the project is to design an algorithm that would successfully handle allocating the tasks in order to improve (maximize) the overall performance. The project involves the study of complex task allocation for a comprehensive understanding of the problem. Several popular techniques are discussed in the literature review, emphasizing on the works that utilize meta-heuristic methods. First the Tabu Search (TS) will be used to solve the task allocation problem for multi-robot systems then Genetic Algorithm (GA) also will be used to solve the same problems. Then a comparative study will be done between TS and GA in solving many test cases. A hybrid approach from the two algorithms will be also test to find out whether it's better or not, and to find when to use which algorithm and how to set its parameters.
A Path Planning Technique For Autonomous Mobile Robot Using Free-Configuratio...CSCJournals
This paper presents the implementation of a novel technique for sensor based path planning of autonomous mobile robots. The proposed method is based on finding free-configuration eigen spaces (FCE) in the robot actuation area. Using the FCE technique to find optimal paths for autonomous mobile robots, the underlying hypothesis is that in the low-dimensional manifolds of laser scanning data, there lies an eigenvector which corresponds to the free-configuration space of the higher order geometric representation of the environment. The vectorial combination of all these eigenvectors at discrete time scan frames manifests a trajectory, whose sum can be treated as a robot path or trajectory. The proposed algorithm was tested on two different test bed data, real data obtained from Navlab SLAMMOT and data obtained from the real-time robotics simulation program Player/Stage. Performance analysis of FCE technique was done with existing four path planning algorithms under certain working parameters, namely computation time needed to find a solution, the distance travelled and the amount of turning required by the autonomous mobile robot. This study will enable readers to identify the suitability of path planning algorithm under the working parameters, which needed to be optimized. All the techniques were tested in the real-time robotic software Player/Stage. Further analysis was done using MATLAB mathematical computation software.
A fast clustering based feature subset selection algorithm for high-dimension...IEEEFINALYEARPROJECTS
To Get any Project for CSE, IT ECE, EEE Contact Me @ 09849539085, 09966235788 or mail us - ieeefinalsemprojects@gmail.co¬m-Visit Our Website: www.finalyearprojects.org
Performance Analysis of the Sigmoid and Fibonacci Activation Functions in NGA...IOSRJVSP
Activation functions are used to transform the mixed inputs into their corresponding output counterparts. Commonly, activation functions are used as transfer functions in engineering and research. Artificial neural networks (ANN) are the preferred choice for most studies and comparisons of activation functions. The Sigmoid Activation Function is the most common and its popularity arise from the fact that it is easy to derive, its boundedness within the unit interval, and it has mathematical properties that work well with the approximation theory. On the other hand, not so common is the Fibonacci Activation Function with similar and perhaps better features than the Sigmoid. Algorithms have a broad range of applications making it plausible to suspect that different problems call for unique activation functions. The aim of this paper is to have a detailed of the role of the activation functions and then analyse the performance of two of them – the Sigmoid and the Fibonacci – in a non-ANN setup using the most basic artificially generated signals. Results show that the Fibonacci activation function performs better with the set of signals applied in the natural gradient algorithm.
Optimal Synthesis of Array Pattern for Concentric Circular Antenna Array Usin...IDES Editor
In this paper one optimization heuristic search
technique, Hybrid Evolutionary Programming (HEP) is
applied to the process of synthesizing three-ring Concentric
Circular Antenna Array (CCAA) focused on maximum
sidelobe-level reduction. This paper assumes non-uniform
excitations and uniform spacing of excitation elements in each
three-ring CCAA design. Experimental results reveal that the
design of non-uniformly excited CCAAs with optimal current
excitations using the method of HEP provides a considerable
sidelobe level reduction with respect to the uniform current
excitation with d=λ/2 element-to-element spacing. Among the
various CCAA designs, the design containing central element
and 4, 6 and 8 elements in three successive concentric rings
proves to be such global optimal design with global minimum
SLL (-40.22 dB) as determined by HEP.
A COMPARISON BETWEEN SWARM INTELLIGENCE ALGORITHMS FOR ROUTING PROBLEMSecij
Travelling salesman problem (TSP) is a most popular combinatorial routing problem, belongs to the class of NP-hard problems. Many approacheshave been proposed for TSP.Among them, swarm intelligence (SI) algorithms can effectively achieve optimal tours with the minimum lengths and attempt to avoid trapping in local minima points. The transcendence of each SI is depended on the nature of the problem. In our studies, there has been yet no any article, which had compared the performance of SI algorithms for TSP perfectly. In this paper,four common SI algorithms are used to solve TSP, in order to compare the performance of SI algorithms for the TSP problem. These algorithms include genetic algorithm, particle swarm optimization, ant colony optimization, and artificial bee colony. For each SI, the various parameters and operators were tested, and the best values were selected for it. Experiments oversome benchmarks fromTSPLIBshow that
artificial bee colony algorithm is the best one among the fourSI-basedmethods to solverouting problems like TSP.
Hybrid multi objectives genetic algorithms and immigrants scheme for dynamic ...khalil IBRAHIM
the main concept of intelligent optimization techniques, artificial neural networks, and new genetic algorithms to solve the multi-objective multicast routing problems with shortest path (SP) problem that used in the addresses networks and improve all processes addressing in the wireless communications based on multi-objective optimization. The most important characteristics in mobile wireless networks is the topology dynamics and the network topology changes over time, the routing problem (SPRP) in mobile ad hoc networks (MANETs) turns out to be a dynamic optimization problem[13], the hybrid immigrants multiple-objective genetic algorithm (HIMOGAs) in the real- world are dynamic in nature, that has objective functions, constraints, and parameters, the dynamic optimization problems (DOPs) are a big challenges to evolutionary multi-objective, since any environmental change may affect the objective vector, constraints, and parameters, HIMOGA for the optimization goal is to track the moving of parameters and get a sequence of approximations solutions over time. The quantity of services (QoS) is supporting guarantee for all data traffic and getting the maximizing utilization for network, the QoS based on multicast routing offers significant challenges, and increases to use an efficient multicast routing protocol that will be able to check multicast routing and satisfying QoS constraints, The author propose to use HIMOGAs and SP algorithm to solve multicast problem that produces new generation wireless networks with immigrants schema to get high-quality solutions after each change and satisfying all objectives.
EFFECTIVE REDIRECTING OF THE MOBILE ROBOT IN A MESSED ENVIRONMENT BASED ON TH...ijfls
The use of fuzzy logic in redirecting mobile robot is based on two sets of received information. First set is the instantaneous distance of the robot from the obstacle and second set is the instantaneous information of the robot's position. For this purpose, the fuzzy rules base consists of forty-two bases, which is extracted based on the robot's distance from obstacles, and the target position relative to the instantaneous orientation of the robot. In the structure of fuzzy systems, minimal inference engine are considered. Also, Extended Kalman filter is used for localization in a noisy environment. Accordingly, the inputs of the fuzzy systems are determined based on the estimation of the localization process, the information of the obstacles center and the target position. Also, the linear acceleration and instantaneous orientation of the mobile robot are determined by the desired fuzzy structures which are applied to its kinematic model.
EFFECTIVE REDIRECTING OF THE MOBILE ROBOT IN A MESSED ENVIRONMENT BASED ON TH...Wireilla
The use of fuzzy logic in redirecting mobile robot is based on two sets of received information. First set is
the instantaneous distance of the robot from the obstacle and second set is the instantaneous information of
the robot's position. For this purpose, the fuzzy rules base consists of forty-two bases, which is extracted
based on the robot's distance from obstacles, and the target position relative to the instantaneous
orientation of the robot. In the structure of fuzzy systems, minimal inference engine are considered. Also,
Extended Kalman filter is used for localization in a noisy environment. Accordingly, the inputs of the fuzzy
systems are determined based on the estimation of the localization process, the information of the obstacles
center and the target position. Also, the linear acceleration and instantaneous orientation of the mobile
robot are determined by the desired fuzzy structures which are applied to its kinematic model.
Routing in Wireless Mesh Networks: Two Soft Computing Based Approachesijmnct
Due to dynamic network conditions, routing is the most critical part in WMNs and needs to be optimised.
The routing strategies developed for WMNs must be efficient to make it an operationally self configurable
network. Thus we need to resort to near shortest path evaluation. This lays down the requirement of some
soft computing approaches such that a near shortest path is available in an affordable computing time. This
paper proposes a Fuzzy Logic based integrated cost measure in terms of delay, throughput and jitter.
Based upon this distance (cost) between two adjacent nodes we evaluate minimal shortest path that updates
routing tables. We apply two recent soft computing approaches namely Big Bang Big Crunch (BB-BC) and
Biogeography Based Optimization (BBO) approaches to enumerate shortest or near short paths. BB-BC
theory is related with the evolution of the universe whereas BBO is inspired by dynamical equilibrium in
the number of species on an island. Both the algorithms have low computational time and high convergence
speed. Simulation results show that the proposed routing algorithms find the optimal shortest path taking
into account three most important parameters of network dynamics. It has been further observed that for
the shortest path problem BB-BC outperforms BBO in terms of speed and percent error between the
evaluated minimal path and the actual shortest path.
Multiple Ant Colony Optimizations for Stereo MatchingCSCJournals
The stereo matching problem, which obtains the correspondence between right and left images, can be cast as a search problem. The matching of all candidates in the same line forms a 2D optimization task and the two dimensional (2D) optimization is a NP-hard problem. There are two characteristics in stereo matching. Firstly, the local optimization process along each scan-line can be done concurrently; secondly, there are some relationship among adjacent scan-lines can be explored to promote the matching correctness. Although there are many methods, such as GCPs, GGCPs are proposed, but these so called GCPs maybe not be ground. The relationship among adjacent scan-lines is posteriori, that is to say the relationship can only be discovered after every optimization is finished. The Multiple Ant Colony Optimization(MACO) is efficient to solve large scale problem. It is a proper way to settle down the stereo matching task with constructed MACO, in which the master layer values the sub-solutions and propagate the reliability after every local optimization is finished. Besides, whether the ordering and uniqueness constraints should be considered during the optimization is discussed, and the proposed algorithm is proved to guarantee its convergence to find the optimal matched pairs.
Multi Object Tracking Methods Based on Particle Filter and HMMIJTET Journal
Abstract – For various application detection of objects movement in a video is an important process. Determination of path of object as time advances is a tedious step. Many proposal for tracking the multiple movement of object has been put forward using various sophisticated techniques. In this paper detail description of the recent object trackers based on particle filtering and Markov Models have been analyzed. The outcome of the analysis is computational efficiency, robustness and computational complexity.
To Get any Project for CSE, IT ECE, EEE Contact Me @ 09666155510, 09849539085 or mail us - ieeefinalsemprojects@gmail.com-Visit Our Website: www.finalyearprojects.org
Application of normalized cross correlation to image registrationeSAT Publishing House
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology.
Combining Neural Network and Firefly Algorithm to Predict Stock Price in Tehr...Editor IJCATR
In the present research, prediction of stock price index in Tehran stock exchange by using neural
networks and firefly algorithm in chaotic behavior of price index stock exchange are studied. Two data sets
are selected for neural network input. Various breaks of index and macro economic factors are considered
as independent variables. Also, firefly algorithm is used to [redict price index in next week. The results of
research show that combining neural networks and firefly optimization algorithm has better performance
than neural network to predict the price index. In addition, acceptable value of error-sequre means for
network error in test data show that there are chaotic mevements in behaviour of price index.
Multi-Robot Task Allocation using Meta-heuristic OptimizationMohamed Ghanem
Bachelor Defense Presentation,
The aim of the project is to design an algorithm that would successfully handle allocating the tasks in order to improve (maximize) the overall performance. The project involves the study of complex task allocation for a comprehensive understanding of the problem. Several popular techniques are discussed in the literature review, emphasizing on the works that utilize meta-heuristic methods. First the Tabu Search (TS) will be used to solve the task allocation problem for multi-robot systems then Genetic Algorithm (GA) also will be used to solve the same problems. Then a comparative study will be done between TS and GA in solving many test cases. A hybrid approach from the two algorithms will be also test to find out whether it's better or not, and to find when to use which algorithm and how to set its parameters.
A Path Planning Technique For Autonomous Mobile Robot Using Free-Configuratio...CSCJournals
This paper presents the implementation of a novel technique for sensor based path planning of autonomous mobile robots. The proposed method is based on finding free-configuration eigen spaces (FCE) in the robot actuation area. Using the FCE technique to find optimal paths for autonomous mobile robots, the underlying hypothesis is that in the low-dimensional manifolds of laser scanning data, there lies an eigenvector which corresponds to the free-configuration space of the higher order geometric representation of the environment. The vectorial combination of all these eigenvectors at discrete time scan frames manifests a trajectory, whose sum can be treated as a robot path or trajectory. The proposed algorithm was tested on two different test bed data, real data obtained from Navlab SLAMMOT and data obtained from the real-time robotics simulation program Player/Stage. Performance analysis of FCE technique was done with existing four path planning algorithms under certain working parameters, namely computation time needed to find a solution, the distance travelled and the amount of turning required by the autonomous mobile robot. This study will enable readers to identify the suitability of path planning algorithm under the working parameters, which needed to be optimized. All the techniques were tested in the real-time robotic software Player/Stage. Further analysis was done using MATLAB mathematical computation software.
A fast clustering based feature subset selection algorithm for high-dimension...IEEEFINALYEARPROJECTS
To Get any Project for CSE, IT ECE, EEE Contact Me @ 09849539085, 09966235788 or mail us - ieeefinalsemprojects@gmail.co¬m-Visit Our Website: www.finalyearprojects.org
Performance Analysis of the Sigmoid and Fibonacci Activation Functions in NGA...IOSRJVSP
Activation functions are used to transform the mixed inputs into their corresponding output counterparts. Commonly, activation functions are used as transfer functions in engineering and research. Artificial neural networks (ANN) are the preferred choice for most studies and comparisons of activation functions. The Sigmoid Activation Function is the most common and its popularity arise from the fact that it is easy to derive, its boundedness within the unit interval, and it has mathematical properties that work well with the approximation theory. On the other hand, not so common is the Fibonacci Activation Function with similar and perhaps better features than the Sigmoid. Algorithms have a broad range of applications making it plausible to suspect that different problems call for unique activation functions. The aim of this paper is to have a detailed of the role of the activation functions and then analyse the performance of two of them – the Sigmoid and the Fibonacci – in a non-ANN setup using the most basic artificially generated signals. Results show that the Fibonacci activation function performs better with the set of signals applied in the natural gradient algorithm.
Optimal Synthesis of Array Pattern for Concentric Circular Antenna Array Usin...IDES Editor
In this paper one optimization heuristic search
technique, Hybrid Evolutionary Programming (HEP) is
applied to the process of synthesizing three-ring Concentric
Circular Antenna Array (CCAA) focused on maximum
sidelobe-level reduction. This paper assumes non-uniform
excitations and uniform spacing of excitation elements in each
three-ring CCAA design. Experimental results reveal that the
design of non-uniformly excited CCAAs with optimal current
excitations using the method of HEP provides a considerable
sidelobe level reduction with respect to the uniform current
excitation with d=λ/2 element-to-element spacing. Among the
various CCAA designs, the design containing central element
and 4, 6 and 8 elements in three successive concentric rings
proves to be such global optimal design with global minimum
SLL (-40.22 dB) as determined by HEP.
We illustrate unsupervised and supervised learning algorithms that accurately classify the lithological variations in the 3D seismic data. We demonstrate blind source separation techniques such as the principal components (PCA) and noise adjusted principal
components in conjunction with Kohonen Self organizing maps to produce superior unsupervised classification maps.
Further, we utilize the PCA space training in Maximum likelihood (ML) supervised classification. Results demonstrate that the ML supervised classification produces an improved classification of the facies in the 3D seismic dataset from the Anadarko basin in central Oklahoma.
A New Method Based on MDA to Enhance the Face Recognition PerformanceCSCJournals
A novel tensor based method is prepared to solve the supervised dimensionality reduction problem. In this paper a multilinear principal component analysis(MPCA) is utilized to reduce the tensor object dimension then a multilinear discriminant analysis(MDA), is applied to find the best subspaces. Because the number of possible subspace dimensions for any kind of tensor objects is extremely high, so testing all of them for finding the best one is not feasible. So this paper also presented a method to solve that problem, The main criterion of algorithm is not similar to Sequential mode truncation(SMT) and full projection is used to initialize the iterative solution and find the best dimension for MDA. This paper is saving the extra times that we should spend to find the best dimension. So the execution time will be decreasing so much. It should be noted that both of the algorithms work with tensor objects with the same order so the structure of the objects has been never broken. Therefore the performance of this method is getting better. The advantage of these algorithms is avoiding the curse of dimensionality and having a better performance in the cases with small sample sizes. Finally, some experiments on ORL and CMPU-PIE databases is provided.
In the recent years the development in communication systems requires the development of low cost, minimal weight, low profile antennas that are capable of maintaining high performance over a wide spectrum of frequencies. This technological trend has focused much effort into the design of a micro strip patch antennas. Nowadays Evolutionary Computation has its growth to extent. Generally electromagnetic optimization problems generally involve a large number of parameters. Synthesis of non-uniform linear antenna arrays is one of the most important electromagnetic optimization problems of the current interest.
Blind Source Separation of Super and Sub-Gaussian Signals with ABC AlgorithmIDES Editor
Recently, several techniques have been presented
for blind source separation using linear or non-linear mixture
models. The problem is to recover the original source signals
without knowing apriori information about the mixture model.
Accordingly, several statistic and information theory-based
objective functions are used in literature to estimate the
original signals without providing mixture model. Here,
swarm intelligence played a major role to estimate the
separating matrix. In our work, we have considered the recent
optimization algorithm, called Artificial Bee Colony (ABC)
algorithm which is used to generate the separating matrix in
an optimal way. Here, Employee and onlooker bee and scout
bee phases are used to generate the optimal separating matrix
with lesser iterations. Here, new solutions are generated
according to the three major considerations such as, 1) all
elements of the separating matrix should be changed according
to best solution, 2) individual element of the separating matrix
should be changed to converge to the best optimal solution, 3)
Random solution should be added. These three considerations
are implemented in ABC algorithm to improve the
performance in Blind Source Separation (BSS). The
experimentation has been carried out using the speech signals
and the super and sub-Gaussian signal to validate the
performance. The proposed technique was compared with
Genetic algorithm in signal separation. From the result, it
was observed that ABC technique has outperformed existing
GA technique by achieving better fitness values and lesser
Euclidean distance.
Direction of Arrival Estimation Based on MUSIC Algorithm Using Uniform and No...IJERA Editor
In signal processing, the direction of arrival (DOA) estimation denotes the direction from which a propagating wave arrives at a point, where a set of antennas is located. Using the array antenna has an advantage over the single antenna in achieving an improved performance by applying Multiple Signal Classification (MUSIC) algorithm. This paper focuses on estimating the DOA using uniform linear array (ULA) and non-uniform linear array (NLA)of antennas to analyze the performance factors that affect the accuracy and resolution of the system based on MUSIC algorithm. The direction of arrival estimation is simulated on a MATLAB platform with a set of input parameters such as array elements, signal to noise ratio, number of snapshots and number of signal sources. An extensive simulation has been conducted and the results show that the NLA with DOA estimation for co-prime array can achieve an accurate and efficient DOA estimation
Comparision of Clustering Algorithms usingNeural Network Classifier for Satel...IJERA Editor
This paper presents a hybrid clustering algorithm and feed-forward neural network classifier for land-cover mapping of trees, shade, building and road. It starts with the single step preprocessing procedure to make the image suitable for segmentation. The pre-processed image is segmented using the hybrid genetic-Artificial Bee Colony(ABC) algorithm that is developed by hybridizing the ABC and FCM to obtain the effective segmentation in satellite image and classified using neural network . The performance of the proposed hybrid algorithm is compared with the algorithms like, k-means, Fuzzy C means(FCM), Moving K-means, Artificial Bee Colony(ABC) algorithm, ABC-GA algorithm, Moving KFCM and KFCM algorithm.
Trend removal from raman spectra with local variance estimation and cubic spl...csijjournal
Trend removal is an important problem in most communication systems. Here, we show a proposed
algorithm for trend (background) removal from Raman Spectra by merging local variance estimation and
cubic spline interpolation methods. We found that Raman spectrum does not need a smoothing process to
remove trend from noisy signals. Employing this technique results in more speedy and noiseless systems
than other techniques that use wavelet transformation to suppress noise.
TREND REMOVAL FROM RAMAN SPECTRA WITH LOCAL VARIANCE ESTIMATION AND CUBIC SPL...csijjournal
Trend removal is an important problem in most communication systems. Here, we show a proposed algorithm for trend (background) removal from Raman Spectra by merging local variance estimation and cubic spline interpolation methods. We found that Raman spectrum does not need a smoothing process to remove trend from noisy signals. Employing this technique results in more speedy and noiseless systems than other techniques that use wavelet transformation to suppress noise
Trend Removal from Raman Spectra With Local Variance Estimation and Cubic Spl...csijjournal
Abstract
Trend removal is an important problem in most communication systems. Here, we show a proposed algorithm for trend (background) removal from Raman Spectra by merging local variance estimation and cubic spline interpolation methods. We found that Raman spectrum does not need a smoothing process to remove trend from noisy signals. Employing this technique results in more speedy and noiseless systems than other techniques that use wavelet transformation to suppress noise.
Keywords
Raman spectroscopy, Background correction method, Local variance, Cubic spline interpolation.
TREND REMOVAL FROM RAMAN SPECTRA WITH LOCAL VARIANCE ESTIMATION AND CUBIC SPL...csijjournal
Trend removal is an important problem in most communication systems. Here, we show a proposed algorithm for trend (background) removal from Raman Spectra by merging local variance estimation and cubic spline interpolation methods. We found that Raman spectrum does not need a smoothing process to remove trend from noisy signals. Employing this technique results in more speedy and noiseless systems than other techniques that use wavelet transformation to suppress noise.
This paper presented a compressive sensing (CS) calibration technique that simultaneously measures all the element excitations of a 2×2 active phased antenna array (APAA) instantaneously. The power patterns of the rectangular 2×2 APAA element are synchronized to orthogonally cross multiplicative sub-array system applying compressive sensing in achieving an array thinning along two 1-D sub-arrays for a fixed steered beam radiation. The far field radiation pattern direction of the 2×2 APAA is examined considering the mutual effect, complex excitation of the amplitude and phase of the antenna elements placed on the x and y axes. The unwanted array excitation with errors are calibrated using minimization vector as a standard basic pursuit problem in compressive sensing technique for the 2×2 APAA calibration. The elements amplitude and phase shift variation are compared with reference state 0 in order to evaluate the faulty error array elements. The performance evaluation of this proposed technique is measured and demonstrated to validate the effectiveness of the proposed antenna calibration technique.
Black-box modeling of nonlinear system using evolutionary neural NARX modelIJECEIAES
Nonlinear systems with uncertainty and disturbance are very difficult to model using mathematic approach. Therefore, a black-box modeling approach without any prior knowledge is necessary. There are some modeling approaches have been used to develop a black box model such as fuzzy logic, neural network, and evolution algorithms. In this paper, an evolutionary neural network by combining a neural network and a modified differential evolution algorithm is applied to model a nonlinear system. The feasibility and effectiveness of the proposed modeling are tested on a piezoelectric actuator SISO system and an experimental quadruple tank MIMO system.
Similar to Direction Finding - Antennas Project (20)
Robotics Simulation by Wireless Brains - ROBOKDC'15 ProjectSurya Chandra
Final project for the graduate course of robotics at Colorado School of Mines. Nuclear fuel rods are moved from specified locations in a pallet and is placed into an elevator by a robot . The elevator takes the rods to the reactor room. A second robot places each of the fuel rods into a specified slot of the reactor.
Forward Bit Error Correction - Wireless Communications Surya Chandra
As a part of my final project for wireless communications, I created a Matlab simulation for correcting the corrupted data bits (due to noise) at the receiver end using coding techniques, such as, redundancy check, hamming (7,4) code, interleaving and convolutional coding.
To output a solved wordoku puzzle from an input image in Matlab. The project involves image segmentation, extraction, pattern recognition, support vector regression and other image processing techniques.
Smart Bin – Advanced Control System Design ProjectSurya Chandra
To design a control system for an active dust bin (on wheels) that could track the motion of items thrown at it using cameras mounted in the room and catch them before they fall to the ground.
Augmented Reality Video Playlist - Computer Vision ProjectSurya Chandra
To create an augmented reality experience for the user where in a playlist of videos are projected onto everyday objects in the user’s environment allowing the selection and manipulation of any particular video using finger gestures.
Exploring Support Vector Regression - Signals and Systems ProjectSurya Chandra
Our team competed in a Kaggle competition to predict the bike share use as a part of their capital bike share program in Washington DC using a powerful function approximation technique called support vector regression.
Cosmetic shop management system project report.pdfKamal Acharya
Buying new cosmetic products is difficult. It can even be scary for those who have sensitive skin and are prone to skin trouble. The information needed to alleviate this problem is on the back of each product, but it's thought to interpret those ingredient lists unless you have a background in chemistry.
Instead of buying and hoping for the best, we can use data science to help us predict which products may be good fits for us. It includes various function programs to do the above mentioned tasks.
Data file handling has been effectively used in the program.
The automated cosmetic shop management system should deal with the automation of general workflow and administration process of the shop. The main processes of the system focus on customer's request where the system is able to search the most appropriate products and deliver it to the customers. It should help the employees to quickly identify the list of cosmetic product that have reached the minimum quantity and also keep a track of expired date for each cosmetic product. It should help the employees to find the rack number in which the product is placed.It is also Faster and more efficient way.
CFD Simulation of By-pass Flow in a HRSG module by R&R Consult.pptxR&R Consult
CFD analysis is incredibly effective at solving mysteries and improving the performance of complex systems!
Here's a great example: At a large natural gas-fired power plant, where they use waste heat to generate steam and energy, they were puzzled that their boiler wasn't producing as much steam as expected.
R&R and Tetra Engineering Group Inc. were asked to solve the issue with reduced steam production.
An inspection had shown that a significant amount of hot flue gas was bypassing the boiler tubes, where the heat was supposed to be transferred.
R&R Consult conducted a CFD analysis, which revealed that 6.3% of the flue gas was bypassing the boiler tubes without transferring heat. The analysis also showed that the flue gas was instead being directed along the sides of the boiler and between the modules that were supposed to capture the heat. This was the cause of the reduced performance.
Based on our results, Tetra Engineering installed covering plates to reduce the bypass flow. This improved the boiler's performance and increased electricity production.
It is always satisfying when we can help solve complex challenges like this. Do your systems also need a check-up or optimization? Give us a call!
Work done in cooperation with James Malloy and David Moelling from Tetra Engineering.
More examples of our work https://www.r-r-consult.dk/en/cases-en/
Overview of the fundamental roles in Hydropower generation and the components involved in wider Electrical Engineering.
This paper presents the design and construction of hydroelectric dams from the hydrologist’s survey of the valley before construction, all aspects and involved disciplines, fluid dynamics, structural engineering, generation and mains frequency regulation to the very transmission of power through the network in the United Kingdom.
Author: Robbie Edward Sayers
Collaborators and co editors: Charlie Sims and Connor Healey.
(C) 2024 Robbie E. Sayers
NO1 Uk best vashikaran specialist in delhi vashikaran baba near me online vas...Amil Baba Dawood bangali
Contact with Dawood Bhai Just call on +92322-6382012 and we'll help you. We'll solve all your problems within 12 to 24 hours and with 101% guarantee and with astrology systematic. If you want to take any personal or professional advice then also you can call us on +92322-6382012 , ONLINE LOVE PROBLEM & Other all types of Daily Life Problem's.Then CALL or WHATSAPP us on +92322-6382012 and Get all these problems solutions here by Amil Baba DAWOOD BANGALI
#vashikaranspecialist #astrologer #palmistry #amliyaat #taweez #manpasandshadi #horoscope #spiritual #lovelife #lovespell #marriagespell#aamilbabainpakistan #amilbabainkarachi #powerfullblackmagicspell #kalajadumantarspecialist #realamilbaba #AmilbabainPakistan #astrologerincanada #astrologerindubai #lovespellsmaster #kalajaduspecialist #lovespellsthatwork #aamilbabainlahore#blackmagicformarriage #aamilbaba #kalajadu #kalailam #taweez #wazifaexpert #jadumantar #vashikaranspecialist #astrologer #palmistry #amliyaat #taweez #manpasandshadi #horoscope #spiritual #lovelife #lovespell #marriagespell#aamilbabainpakistan #amilbabainkarachi #powerfullblackmagicspell #kalajadumantarspecialist #realamilbaba #AmilbabainPakistan #astrologerincanada #astrologerindubai #lovespellsmaster #kalajaduspecialist #lovespellsthatwork #aamilbabainlahore #blackmagicforlove #blackmagicformarriage #aamilbaba #kalajadu #kalailam #taweez #wazifaexpert #jadumantar #vashikaranspecialist #astrologer #palmistry #amliyaat #taweez #manpasandshadi #horoscope #spiritual #lovelife #lovespell #marriagespell#aamilbabainpakistan #amilbabainkarachi #powerfullblackmagicspell #kalajadumantarspecialist #realamilbaba #AmilbabainPakistan #astrologerincanada #astrologerindubai #lovespellsmaster #kalajaduspecialist #lovespellsthatwork #aamilbabainlahore #Amilbabainuk #amilbabainspain #amilbabaindubai #Amilbabainnorway #amilbabainkrachi #amilbabainlahore #amilbabaingujranwalan #amilbabainislamabad
Immunizing Image Classifiers Against Localized Adversary Attacksgerogepatton
This paper addresses the vulnerability of deep learning models, particularly convolutional neural networks
(CNN)s, to adversarial attacks and presents a proactive training technique designed to counter them. We
introduce a novel volumization algorithm, which transforms 2D images into 3D volumetric representations.
When combined with 3D convolution and deep curriculum learning optimization (CLO), itsignificantly improves
the immunity of models against localized universal attacks by up to 40%. We evaluate our proposed approach
using contemporary CNN architectures and the modified Canadian Institute for Advanced Research (CIFAR-10
and CIFAR-100) and ImageNet Large Scale Visual Recognition Challenge (ILSVRC12) datasets, showcasing
accuracy improvements over previous techniques. The results indicate that the combination of the volumetric
input and curriculum learning holds significant promise for mitigating adversarial attacks without necessitating
adversary training.
Hybrid optimization of pumped hydro system and solar- Engr. Abdul-Azeez.pdffxintegritypublishin
Advancements in technology unveil a myriad of electrical and electronic breakthroughs geared towards efficiently harnessing limited resources to meet human energy demands. The optimization of hybrid solar PV panels and pumped hydro energy supply systems plays a pivotal role in utilizing natural resources effectively. This initiative not only benefits humanity but also fosters environmental sustainability. The study investigated the design optimization of these hybrid systems, focusing on understanding solar radiation patterns, identifying geographical influences on solar radiation, formulating a mathematical model for system optimization, and determining the optimal configuration of PV panels and pumped hydro storage. Through a comparative analysis approach and eight weeks of data collection, the study addressed key research questions related to solar radiation patterns and optimal system design. The findings highlighted regions with heightened solar radiation levels, showcasing substantial potential for power generation and emphasizing the system's efficiency. Optimizing system design significantly boosted power generation, promoted renewable energy utilization, and enhanced energy storage capacity. The study underscored the benefits of optimizing hybrid solar PV panels and pumped hydro energy supply systems for sustainable energy usage. Optimizing the design of solar PV panels and pumped hydro energy supply systems as examined across diverse climatic conditions in a developing country, not only enhances power generation but also improves the integration of renewable energy sources and boosts energy storage capacities, particularly beneficial for less economically prosperous regions. Additionally, the study provides valuable insights for advancing energy research in economically viable areas. Recommendations included conducting site-specific assessments, utilizing advanced modeling tools, implementing regular maintenance protocols, and enhancing communication among system components.
Student information management system project report ii.pdfKamal Acharya
Our project explains about the student management. This project mainly explains the various actions related to student details. This project shows some ease in adding, editing and deleting the student details. It also provides a less time consuming process for viewing, adding, editing and deleting the marks of the students.
Saudi Arabia stands as a titan in the global energy landscape, renowned for its abundant oil and gas resources. It's the largest exporter of petroleum and holds some of the world's most significant reserves. Let's delve into the top 10 oil and gas projects shaping Saudi Arabia's energy future in 2024.
2.
The covariance matrix can then manipulated depending on the method to be used to
determine the directions of each signal.
3. Method 1: Eigen Beam
The eigen beam method uses a simple eigenvalue decomposition to determine the directions
of the incoming signals. The covariance matrix can be decomposed by
where are the eigenvalues and is a matrix composed of the eigenvalues associatedλJ V λ
with each vector. There will be one eigenvalue for each input signal, while the other
eigenvalues correspond to the noise, and the total number of eigenvalues is the number of
elements in the array. The largest eigenvalues correspond to the signals. New array factors
are calculated for each eigenvalue, with the weights of the array factor given by the
eigenvector for the eigenvalue.
This was done in Matlab for a fourelement uniform array with halfwavelength spacing. The
signal is a 1 V/m plane wave incident at 30° and 50°. This gives eigenvalues and vectors of
When turned into weights for an array factor, the results are
2
4.
The eigen beam method is clearly very resistant to noise. Changing the noise variance had
almost no change on the array factor.
4. Method 2: Periodogram
The periodogram uses the main beam of the array to determine the location of the signal.The
main beam is steered using beam steering across the desired angles. The received signal will
be the strongest when the main beam is aligned with it. This will give a peak in the power
received. The plot of the output power versus angle is a periodogram. The equations for the
periodogram are given below:
R is the same correlation matrix computed above. A gives the array steering vector. The
graph below shows an example that was produced in matlab. There are three different signal
shown here. The red line has has the signal incident at 30 and 30 degrees. The nulls are
distinct in this case as the incident angles are far enough apart. The other two singal show
that as the angles of the incident signals becomes closer and closer the direction of the signal
is in accurate. The blue signal has the incoming signal at 10 and 30 degrees. The black line
has the signal incoming at 20 and 30 degrees, but it appears as if there is only a single signal
incoming at an angle of 25 degrees. This smearing of the signal is due to the beamwidth of
the main being large and not precise.
Figure 3: System with noise variance of .01
4
10.
MEM is fairly resistant to noise. The peaks are not as sharp with the increased noise, but they
are still all readily identifiable.
8. Method 6:Pisarenko Harmonic Decomposition (PHD)
The pisarenko Harmonic decomposition uses the smallest eigenvector to minimize the mean
squared error of the array output. The weights of the system are normalized to 1. Using the
equation below the following graph is obtained. It can be seen that the peaks of the incoming
signals are very sharp, but there are some erroneous peaks at other angles. The equation for
the PHD method is given below
where is the eigenvector associated with the smallest noise eigenvalue. This method is alsoe1
highly variable to the sampling rate. Sampling at different rates has dramatic effects on the
results, and these sampling issues are likely the cause of the extra peaks.
Figure 11: System with noise variance of .01
10
13.
%Signal Vector V/m
S1 = (S1V{data});
% Steering Vector
A = [
exp(j*k*x1*sin(theta'));
exp(j*k*x2*sin(theta'));
exp(j*k*x3*sin(theta'));
exp(j*k*x4*sin(theta')) ];
% Noise
noise_var = .01;
N = sqrt(noise_var) * randn(size(A,1),size(S1,1));
X1 = A * S1; % Output of the antenna array without noise
X = X1 + N; % Output of the antenna array with noise
Rn = noise_var * eye(size(A,1)); % Noise Covariance Matrix
Rs = (1/size(X1,1))*(X1*X1'); % Signal Covariance Matrix
Rxx = Rs + Rn; % Signal+Noise Covariance Matrix
%Display the data index being used
disp('For Data ');
disp(data);
[V,D] = eig(Rxx); % Eigen Decomposition
%Eigen vectors to polar form
[PHASE,AMPLITUDE]= cart2pol(real(V),imag(V));
EIGENVALUES = eig(D);
%Printing the Eigen values for current data for reference
EIGENVALUES
AMPLITUDE
PHASE
%% EIGEN BEAMS
%%%%%%%%%% PLOTS%%%%%%%%%%%%%%%
th = linspace(pi/2,pi/2,100);% Sampling theta
color = ['r','b','g','c'];
for loop=1:size(A,1)
figure(data)
% Each eigen vector used as weights for antenna array elements
% Starting with the largest eigen value
w = V(:,size(A,1)+1loop);
%Array Factor corresponding to that eigen weights
AF = w(1)* exp(j*k*x1*sin(th)) + ...
13