CFP last date
20 May 2024
Reseach Article

The Implication of Deep Neural Networks in Solving Optimization Problems for Network Security

by Shabbir Hassan
International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 176 - Number 20
Year of Publication: 2020
Authors: Shabbir Hassan
10.5120/ijca2020920154

Shabbir Hassan . The Implication of Deep Neural Networks in Solving Optimization Problems for Network Security. International Journal of Computer Applications. 176, 20 ( May 2020), 6-13. DOI=10.5120/ijca2020920154

@article{ 10.5120/ijca2020920154,
author = { Shabbir Hassan },
title = { The Implication of Deep Neural Networks in Solving Optimization Problems for Network Security },
journal = { International Journal of Computer Applications },
issue_date = { May 2020 },
volume = { 176 },
number = { 20 },
month = { May },
year = { 2020 },
issn = { 0975-8887 },
pages = { 6-13 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume176/number20/31313-2020920154/ },
doi = { 10.5120/ijca2020920154 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-07T00:43:01.097313+05:30
%A Shabbir Hassan
%T The Implication of Deep Neural Networks in Solving Optimization Problems for Network Security
%J International Journal of Computer Applications
%@ 0975-8887
%V 176
%N 20
%P 6-13
%D 2020
%I Foundation of Computer Science (FCS), NY, USA
Abstract

Optimization which implies minimization and maximization of some objective functions often becomes heuristics, as all the problems are not just in the form of linear or polynomial. To optimize problems we may apply heuristics method or any other type of approximation method that can be employed. On the application of derivatives and partial derivatives, these evolutionary algorithms liberalize the objective functions and their restrictions at a specific point. The objective function approximation method of (NLO) Non-linear optimization which used to resolve the optimization problems efficiently. This study paper proposes the critical use of artificial neural networks to strategically optimize these problems so that to apply other possible techniques or methods if it could not be optimized directly. We have enforced the conversion of problems into polynomials so that the solution of Optimization problems (OP) can be calculated accurately.

References
  1. Ríos-Mercado, Roger Z., and Conrado Borraz-Sánchez. "Optimization problems in natural gas transportation systems: A state-of-the-art review." Applied Energy 147 (2015): 536-555.
  2. Wang, Yong, et al. "Two-echelon logistics distribution region partitioning problem based on a hybrid particle swarm optimization–genetic algorithm." Expert Systems with Applications 42.12 (2015): 5019-5031.
  3. Salari, Majid, Mohammad Reihaneh, and Mohammad S. Sabbagh. "Combining ant colony optimization algorithm and dynamic programming technique for solving the covering salesman problem." Computers & Industrial Engineering 83 (2015): 244-251.
  4. Zheng, Xiao-long, and Ling Wang. "A multi-agent optimization algorithm for resource constrained project scheduling problem." Expert Systems with Applications 42.15-16 (2015): 6039-6049.
  5. Lanza-Gutierrez, Jose M., and Juan A. Gomez-Pulido. "Assuming multiobjective metaheuristics to solve a three-objective optimisation problem for relay node deployment in wireless sensor networks." Applied Soft Computing 30 (2015): 675-687.
  6. Ploskas, Nikolaos, and Nikolaos Samaras. "Efficient GPU-based implementations of simplex type algorithms." Applied Mathematics and Computation 250 (2015): 552-570.
  7. Kuhn, H. W. "A. V7. Tucker,"Nonlinear Programming,"." Proc. Second Symp. on Mathematical Statistics and Probability, Univ. of Calif. 1951.
  8. Wang, Yong. "The hybrid genetic algorithm with two local optimization strategies for traveling salesman problem." Computers & Industrial Engineering 70 (2014): 124-133.
  9. Li, Lin, Zhonghai Yu, and Yang Chen. "Evacuation dynamic and exit optimization of a supermarket based on particle swarm optimization." Physica A: Statistical Mechanics and its Applications 416 (2014): 157-172.
  10. Chen, Xiaohui, et al. "A ranging model based on BP neural network." Intelligent Automation & Soft Computing 22.2 (2016): 325-329.
  11. Choudhary, Priyankar, Vibhor Kant, and Pragya Dwivedi. "A Particle Swarm Optimization Approach to Multi Criteria Recommender System Utilizing Effective Similarity Measures." Proceedings of the 9th International Conference on Machine Learning and Computing. 2017.
  12. Jona, J., and N. Nagaveni. "A hybrid swarm optimization approach for feature set reduction in digital mammograms." WSEAS Trans. Inf. Sci. Appl 9.11 (2012): 340-349.
  13. Rohani, Abbas, Morteza Taki, and Masoumeh Abdollahpour. "A novel soft computing model (Gaussian process regression with K-fold cross validation) for daily and monthly solar radiation forecasting (Part: I)." Renewable Energy 115 (2018): 411-422.
  14. Zhang, Yuchen, and Lin Xiao. "Stochastic primal-dual coordinate method for regularized empirical risk minimization." The Journal of Machine Learning Research 18.1 (2017): 2939-2980.
  15. Choi, Jihun, Kang Min Yoo, and Sang-goo Lee. "Learning to compose task-specific tree structures." Thirty-Second AAAI Conference on Artificial Intelligence. 2018.
  16. Chen, Pin-Yu, et al. "Ead: elastic-net attacks to deep neural networks via adversarial examples." Thirty-second AAAI conference on artificial intelligence. 2018.
  17. Madry, Aleksander, et al. "Towards deep learning models resistant to adversarial attacks." arXiv preprint arXiv:1706.06083 (2017).
  18. Papernot, Nicolas, et al. "Distillation as a defense to adversarial perturbations against deep neural networks." 2016 IEEE Symposium on Security and Privacy (SP). IEEE, 2016.
  19. Papernot, Nicolas, et al. "Distillation as a defense to adversarial perturbations against deep neural networks." 2016 IEEE Symposium on Security and Privacy (SP). IEEE, 2016.
  20. Frank, Stephen, Ingrida Steponavice, and Steffen Rebennack. "Optimal power flow: a bibliographic survey II." Energy Systems 3.3 (2012): 259-289.
  21. Ma, Jiaqi, et al. "Parsimonious shooting heuristic for trajectory design of connected automated traffic part II: computational issues and optimization." Transportation Research Part B: Methodological 95 (2017): 421-441.
  22. Lin, Shen, and Brian W. Kernighan. "An effective heuristic algorithm for the traveling-salesman problem." Operations research 21.2 (1973): 498-516.
  23. Pouchet, Louis-Noël, et al. "Iterative optimization in the polyhedral model: Part II, multidimensional time." ACM SIGPLAN Notices 43.6 (2008): 90-100.
  24. Sun, Haoran, et al. "Learning to optimize: Training deep neural networks for wireless resource management." 2017 IEEE 18th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC). IEEE, 2017.
  25. Snoek, Jasper, et al. "Scalable bayesian optimization using deep neural networks." International conference on machine learning. 2015.
  26. Snoek, Jasper, et al. "Scalable bayesian optimization using deep neural networks." International conference on machine learning. 2015.
  27. Lorenzo, Pablo Ribalta, et al. "Particle swarm optimization for hyper-parameter selection in deep neural networks." Proceedings of the genetic and evolutionary computation conference. 2017.
  28. Kraus, Mathias, Stefan Feuerriegel, and Asil Oztekin. "Deep learning in business analytics and operations research: Models, applications and managerial implications." arXivpreprint arXiv:1806.10897 (2018).
  29. Kraus, Mathias, Stefan Feuerriegel, and Asil Oztekin. "Deep learning in business analytics and operations research: Models, applications and managerial implications." arXivpreprint arXiv:1806.10897 (2018).
  30. Nguyen, Anh, Jason Yosinski, and Jeff Clune. "Deep neural networks are easily fooled: High confidence predictions for unrecognizable images." Proceedings of the IEEE conference on computer vision and pattern recognition. 2015.
  31. Kudugunta, Sneha, and Emilio Ferrara. "Deep neural networks for bot detection." Information Sciences 467 (2018): 312-322.
  32. Yun, Chulhee, Suvrit Sra, and Ali Jadbabaie. "Global optimality conditions for deep neural networks." arXiv preprint arXiv:1707.02444 (2017).
  33. Li, Housen, et al. "NETT: Solving inverse problems with deep neural networks." Inverse Problems (2020).
  34. Samek, Wojciech, et al. "Evaluating the visualization of what a deep neural network has learned." IEEE transactions on neural networks and learning systems 28.11 (2016): 2660-2673.
  35. Nguyen, Anh, Jason Yosinski, and Jeff Clune. "Deep neural networks are easily fooled: High confidence predictions for unrecognizable images." Proceedings of the IEEE conference on computer vision and pattern recognition. 2015.
  36. Yosinski, Jason, et al. "How transferable are features in deep neural networks?." Advances in neural information processing systems. 2014.
  37. Adler, Jonas, and Ozan Öktem. "Solving ill-posed inverse problems using iterative deep neural networks." Inverse Problems 33.12 (2017): 124007.
  38. Maghrebi, Houssem, Thibault Portigliatti, and Emmanuel Prouff. "Breaking cryptographic implementations using deep learning techniques." International Conference on Security, Privacy, and Applied Cryptography Engineering. Springer, Cham, 2016.
  39. Xie, Pengtao, et al. "Crypto-nets: Neural networks over encrypted data." arXiv preprint arXiv:1412.6181 (2019).
  40. Abadi, Martín, and David G. Andersen. "Learning to protect communications with adversarial neural cryptography." arXiv preprint arXiv:1610.06918 (2016).
  41. Berman, Daniel S., et al. "A survey of deep learning methods for cyber security." Information 10.4 (2019): 122.
  42. Sagduyu, Yalin E., Yi Shi, and Tugba Erpek. "IoT network security from the perspective of adversarial deep learning." 2019 16th Annual IEEE International Conference on Sensing, Communication, and Networking (SECON). IEEE, 2019.
  43. Bae, Ho, et al. "Security and privacy issues in deep learning." arXiv preprint arXiv:1807.11655 (2018).
  44. Mariot, Luca, and Alberto Leporati. "Heuristic search by particle swarm optimization of boolean functions for cryptographic applications." Proceedings of the Companion Publication of the 2015 Annual Conference on Genetic and Evolutionary Computation. 2015.
  45. Hassan, Shabbir, and Mohammad Ubaidullah Bokhari. "Computing in Cryptography." 2016 3rd International Conference on Computing for Sustainable Global Development (INDIACom). IEEE, 2016.
  46. Bokhari, M. U., and Shabbir Hassan. "A comparative study on lightweight cryptography." Cyber Security. Springer, Singapore, 2018. 69-79.
  47. Prof. M. U. Bokhari , Shabbir Hassan, 2020, Design of a Lightweight Stream Cipher: BOKHARI 256, International Journal of Engineering Research & Technology (IJERT) Volume 09, Issue 03 (March 2020).
  48. Shabbir Hassan, Prof. M. U. Bokhari, “Analysis and Design of LFSR Based Cryptographic Algorithm” in UGC Approved Journal Journal of Advances and Scholarly Researches in Allied Education (JASRAE) in Vol. 16, Issue No. 9, June-2019, ISSN 2230-7540 SCOPUS index..
  49. Shabbir Hassan, Prof. M. U. Bokhari, “Design of Pseudo Random Number Generator using Linear Feedback Shift Register” in UGC CARE Approved Journal of International Journal of Engineering and Advanced Technology (IJEAT) ISSN: 2249 – 8958, Volume-9 Issue-2, December, 2019 in SCOPUS index.
  50. AUTHORS PROFILE
  51. Shabbir Hassan Sun Certified Java Programmer (SCJP) currently working as Assistant Professor at Centre for Distance Education, Aligarh Muslim University, Aligarh. He holds Master in Computer Science and Applications (MCA) and currently pursuing Ph.D. at Department of Computer Science, Aligarh Muslim University. His thrust area is “Analysis and Design of Lightweight Stream Cipher” and area of interest includes Applied Mathematics, Analysis and Design of Algorithms, Dynamic Programming, Network Se
Index Terms

Computer Science
Information Sciences

Keywords

Deep leering neural network (DNN) Neural network model Optimization problems (OP) Non-linear optimization (NLO) Particle Swarm Optimization (PSO) Method of Approximation (MAP) Unprotected AES implementation.