Mohd Asyraf Mansor

Work place: School of Mathematical Sciences, Universiti Sains Malaysia, 11800, Pulau Pinang, Malaysia

E-mail: asyrafalvez@live.com

Website:

Research Interests: Neural Networks, Computer Networks, Data Structures and Algorithms, Algorithm Design, Programming Language Theory

Biography

Mohd Asyraf Mansor was born in Sarawak, Malaysia in 1990. He obtained his MSc (2014) and BSc(Ed) (2013) from Universiti Sains Malaysia. He is currently pursuing Ph.D degree at School of Mathematical Science, Universiti Sains Malaysia. His current research interests include evolutionary algorithm, satisfiability problem, neural networks, logic programming and heuristic method.

Author Articles
Bezier Curves Satisfiability Model in Enhanced Hopfield Network

By Mohd Shareduwan M. Kasihmuddin Mohd Asyraf Mansor Saratha Sathasivam

DOI: https://doi.org/10.5815/ijisa.2016.12.02, Pub. Date: 8 Dec. 2016

Bezier curve is one of the most pragmatic curves that has vast application in computer aided geometry design. Unlike other normal curves, any Bezier curve model must follow the properties of Bezier curve. In our paper, we proposed the reconstruction of Bezier models by implementing satisfiability problem in Hopfield neural network as Bezier properties verification technique. We represent our logic construction to 2-satisfiability (2SAT) clauses in order to represent the properties of the Bezier curve model. The developed Bezier model will be integrated with Hopfield neural network in order to detect the existence of any non-Bezier curve. Microsoft Visual C++ 2013 is used as a platform for training, testing and validating of our proposed design. Hence, the performance of our proposed technique is evaluated based on global Bezier model and computation time. It has been observed that most of the model produced by HNN-2SAT are Bezier curve models.

[...] Read more.
Enhanced Hopfield Network for Pattern Satisfiability Optimization

By Mohd Asyraf Mansor Mohd Shareduwan M. Kasihmuddin Saratha Sathasivam

DOI: https://doi.org/10.5815/ijisa.2016.11.04, Pub. Date: 8 Nov. 2016

Highly-interconnected Hopfield network with Content Addressable Memory (CAM) are shown to be extremely effective in constraint optimization problem. The emergent of the Hopfield network has producing a prolific amount of research. Recently, 3 Satisfiability (3-SAT) has becoming a tool to represent a variety combinatorial problems. Incorporated with 3-SAT, Hopfield neural network (HNN-3SAT) can be used to optimize pattern satisfiability (Pattern-SAT) problem. Hence, we proposed the HNN-3SAT with Hyperbolic Tangent activation function and the conventional McCulloch-Pitts function. The aim of this study is to investigate the accuracy of the pattern generated by our proposed algorithms. Microsoft Visual C++ 2013 is used as a platform for training, testing and validating our Pattern-SAT design. The detailed performance of HNN-3SAT of our proposed algorithms in doing Pattern-SAT will be discussed based on global pattern-SAT and running time. The result obtained from the simulation demonstrate the effectiveness of HNN-3SAT in doing Pattern-SAT.

[...] Read more.
Accelerating Activation Function for 3-Satisfiability Logic Programming

By Mohd Asyraf Mansor Saratha Sathasivam

DOI: https://doi.org/10.5815/ijisa.2016.10.05, Pub. Date: 8 Oct. 2016

This paper presents the technique for accelerating 3-Satisfiability (3-SAT) logic programming in Hopfield neural network. The core impetus for this work is to integrate activation function for doing 3-SAT logic programming in Hopfield neural network as a single hybrid network. In logic programming, the activation function can be used as a dynamic post optimization paradigm to transform the activation level of a unit (neuron) into an output signal. In this paper, we proposed Hyperbolic tangent activation function and Elliot symmetric activation function. Next, we compare the performance of proposed activation functions with a conventional function, namely McCulloch-Pitts function. In this study, we evaluate the performances between these functions through computer simulations. Microsoft Visual C++ 2013 was used as a platform for training, validating and testing of the network. We restrict our analysis to 3-Satisfiability (3-SAT) clauses. Moreover, evaluations are made between these activation functions to see the robustness via aspects of global solutions, global Hamming distance, and CPU time.

[...] Read more.
VLSI Circuit Configuration Using Satisfiability Logic in Hopfield Network

By Mohd Asyraf Mansor Mohd Shareduwan M. Kasihmuddin Saratha Sathasivam

DOI: https://doi.org/10.5815/ijisa.2016.09.03, Pub. Date: 8 Sep. 2016

Very large scale integration (VLSI) circuit comprises of integrated circuit (IC) with transistors in a single chip, widely used in many sophisticated electronic devices. In our paper, we proposed VLSI circuit design by implementing satisfiability problem in Hopfield neural network as circuit verification technique. We restrict our logic construction to 2-Satisfiability (2-SAT) and 3-Satisfiability (3-SAT) clauses in order to suit with the transistor configuration in VLSI circuit. In addition, we developed VLSI circuit based on Hopfield neural network in order to detect any possible error earlier than the manual circuit design. Microsoft Visual C++ 2013 is used as a platform for training, testing and validating of our proposed design. Hence, the performance of our proposed technique evaluated based on global VLSI configuration, circuit accuracy and the runtime. It has been observed that the VLSI circuits (HNN-2SAT and HNN-3SAT circuit) developed by proposed design are better than the conventional circuit due to the early error detection in our circuit.

[...] Read more.
Other Articles