ASPG Menu
search

American Scientific Publishing Group

verified Journal

Neutrosophic and Information Fusion

ISSN
Online: 2836-7863
Frequency

Continuous publication

Publication Model

Open access journal. All articles are freely available online with no APC.

Neutrosophic and Information Fusion

Volume 3 / Issue 2 ( 5 Articles)

Full Length Article DOI: https://doi.org/10.54216/NIF.030205

The Effect of Changing Convolutional Neural Nets Parameters on EEG Signals Recognition Ratio

Brain Computer Interface (BCI), especially systems for recognizing brain signals using EEG (Electroencephalography), is one of the important research topics that arouse the interest of many researchers currently. Convolutional Neural Nets (CNN) is one of the most important deep learning classifiers used in this recognition process, but the parameters of this classifier have not yet been precisely defined so that it gives the highest recognition rate and the lowest possible training and recognition time. This research proposes a system for recognizing EEG signals using the CNN network, while studying the effect of changing the parameters of this network on the recognition rate, training time, and recognition time of brain signals, as a result the proposed recognition system was achieved 76.38 % recognition rate, And the reduction of classifier training time (3 seconds) by using Common Spatial Pattern (CSP) in the preprocessing of IV2b dataset, and a recognition rate of 76.533% was reached by adding a layer to the proposed classifier.
Khaled Moaz
visibility 2551
download 2946
Full Length Article DOI: https://doi.org/10.54216/NIF.030204

On a Novel Simulation of a Control Technique for Power Oscillation Damping and Applications

This research presents a novel simulation model of adaptive control to make a control process by using MIT rule adjustment mechanism, to power oscillation damping in the SMIB system and to measure its possible effects on the response of the damper by changing its parameters according to an external disturbance using Simulink. The results showed that the use of MRAC technique maintains the response of the damper when changing the transfer function due to external disturbance.
Talal Markabi
visibility 2282
download 3132
Full Length Article DOI: https://doi.org/10.54216/NIF.030203

On the Stability Analysis of the Fisher Equation Based on Some Numerical Galerkin Techniques

We studied the stability of the steady state solutions for Fisher Equation in two cases, the First one with constant amplitude and we show that the steady state solution u1=1 is always stable under any condition, but the other two solutions u1=0 and u1 (x)=A cos (nπX)are conditionally stable. In the Second case, we studied the steady state solutions for various amplitude by using two Methods. The First is analytically by direct Method and the second is numerical method using Galerkin technique which shows the same results, that is the steady state solution u1=1 is always stable under any conditions, but the other two solutions u1=0 and u1 (x)=A cos (nπX) are conditionally stable.
Murat Ozcek
visibility 2299
download 3035
Full Length Article DOI: https://doi.org/10.54216/NIF.030202

On the Effect of the Layers' Number of Deep Neural Network for Improving the Reward of a Reinforcement Learning Robot

The Q learning algorithm in reinforcement learning is one of the algorithms that allows the robot to learn the surrounding environment without the need for prior training samples with the principle of reward and punishment for the robot through interaction with the environment. Increasing the number of hidden layers of the deep neural network used and adjusting some of the higher parameters in it can increase the reward of the robot and thus obtain the best path to achieve the goal.
Talal Markabi, Bahaa Mansoura
visibility 2358
download 2893
Full Length Article DOI: https://doi.org/10.54216/NIF.030201

Finding the complete List of Different K-Brackets for the Projective Plane PG (2, 8)

A k-arc in a plane PG (2, q) is a set of k point such that every line in the plane intersect it in at most two points and there is a line intersect it in exactly two points. A k-arc is complete if there is no k+1-arc containing it. This thesis is concerned with studies a k-arcs, k=4, 5,…., 10 and classification of protectively distinct k-arcs and distinct arcs under collineation. We prove by using computer program that the only complete k-arcs is for, k= 6, 10.
Khaled Moaz
visibility 2680
download 3955