Applicability of feed-forward and recurrent neural networks to Boolean function complexity modeling

Expert Systems with Applications

Volumn 34, Issue 4, 2008, Pages 2436-2443

  Beg, Azam ^a   Chandana Prasad, P W ^b   Beg, Ajmal ^c  

^a UNITED ARAB EMIRATES UNIVERSITY   (United Arab Emirates)

^b MULTIMEDIA UNIVERSITY   (Malaysia)

^c SAP Australia Brisbane ^*  (Australia)

Author keywords

Bias; Biological sequence analysis; Classifier design; Feed forward neural network; Machine learning; Motif; Pattern recognition; Recurrent neural network; Sub cellular localization

Indexed keywords

BOOLEAN FUNCTIONS; LEARNING SYSTEMS; MATHEMATICAL MODELS; PATTERN RECOGNITION; RECURRENT NEURAL NETWORKS;

BIOLOGICAL SEQUENCE ANALYSIS; CLASSIFIER DESIGN; SUB-CELLULAR LOCALIZATION;

FEEDFORWARD NEURAL NETWORKS;

EID: 38649115638     PISSN: 09574174     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.eswa.2007.04.010     Document Type: Article

References (30)

1. Assi A., Prasad P.W.C., and Beg A. Modeling the complexity of digital circuits using neural networks. WSEAS Transactions on Circuits and Systems (2006) 810-820
2. Assi A., Prasad P.W.C., Mills B., and El-Chouemi A. Empirical analysis and mathematical representation of the path length complexity in binary decision diagrams. Journal of Computer Science 2 3 (2005) 236-244
3. Bhanja, S., Lingasubramanian, K., & Ranganathan, N. (2005). Estimation of switching activity in sequential circuits using dynamic Bayesian networks. In Proceedings of VLSI design (pp. 586-591).
4. Boden, M. (2006). A guide to recurrent neural networks and backpropagation. .
5. BrainMaker. User's guide and reference manual. 7th ed. (1998), California Scientific Software Press
6. Breuer M.A., and Friedman A.D. Diagnosis and reliable design of digital systems (1976), Computer Science Press
7. Bryant R.E. Graph-based algorithm for Boolean function manipulation. IEEE Transactions on Computers 35 (1986) 677-691
8. Caudill M. AI expert: Neural network primer (1990), Miller Freeman Publications
9. Cho, K. (1988). Test pattern generation for combinational and sequential MOS circuits by symbolic F&T simulation. PhD thesis. Carnegie Mellon University.
10. Coudert, O., Berthec, C., & Madre, J. (1989). Verification of sequential machines using Boolean function vectors. In IMEC-IFIP international workshop on applied formal methods for correct VLSI design.
11. Dunne P.E., and van der Hoeke W. Representation and complexity in Boolean games. Proceedings of the 9th European conference on logics in artificial intelligence (2004), Springer-Verlag 347-350
12. Epitropakis M.G., and Vrahatis M.N. Timely communications: Root finding and approximation approaches through neural networks. ACM SIGSAM Bulletin 39 4 (2005)
13. Franco, L. (2005). Role of function complexity and network size in the generalization ability of feedforward networks. In Lecture Notes in Computer Science. Computational intelligence and bioinspired systems: eighth international workshop on artificial neural networks. IWANN 2005. v3512 (pp. 1-8).
14. Franco, L., & Anthony, M. (2004). On a generalization complexity measure for Boolean functions, IEEE Conference on Neural Networks. In Proceedings on 2004 IEEE international joint conference on neural networks (pp. 973-978).
15. Graves, A., Fernández S., Gomez F., & Schmidhuber J. (2006). Connectionist temporal classification: labeling unsegmented sequence data with recurrent neural networks. In Proceedings of the 23rd international conference on machine learning, ICML '06, June 2006.
16. Hansen M., Yalcin H., and Hayes J.P. Unveiling the ISCAS-85 Benchmarks: A Case Study in Reverse Engineering. IEEE Transactions on Design and Test 16 (1999) 72-80
17. Jeff, (2004). What's a Z-Score and Why Use it in Usability Testing? (website).
18. Mahk, S., Wang, A, Brayton, R., & Sangiovanni-Viicentelli, A. (1988). Logic verification using binary decision diagrams in a logic synthesis environment. In Proceedings in international conference on CAD (pp. 6-9).
19. Masters T. Signal and image processing with neural networks (1994), John Wiley & Sons, Inc.
20. McGeer, P., & Brayton, R. (1989). Efficient algorithms for computing the longest viable path in a combinational network. In Proceedings of the 26th design automation conference (pp. 561-567).
21. Medsker L., and Jain L. Recurrent neural networks: Design and applications (1999), CRC Press
22. Moore G.E. Progress in digital integrated electronics. IEEE IEDM (1975) 11-13
23. Muroga S., Kambayashi Y., Lai H., and Culliney J. The transduction method-design of logic networks based on permissible functions. IEEE Transactions on Computers 38 (1989) 1404-1424
24. Nemani M., and Najm F.N. High-level power estimation and the area complexity of Boolean functions. Proceeding of IEEE international symposium on low power electronics and design (1996) 329-334
25. Nemani M., and Najm F.N. High-level area and power estimation for VLSI circuits. IEEE Transaction on Computer Aided Design of Integrated Circuits and Systems 18 6 (1999) 697-713
26. Ramalingam, N., & Bhanja, S. (2005). Causal probabilistic input dependency learning for switching model in VLSI circuits. In Proceedings of the ACM great lakes symposium on VLSI (pp. 112-115).
27. Somenzi, F. (2003). CUDD: CU Decision Diagram Package. .
28. Triola M. Elementary stastictics. 6th ed. (1994), Addison-Wesley Publishing Co.
29. Wolfe G., and Vemuri R. Extraction and use of neural network models in automated synthesis of operational amplifiers. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems 22 2 (2003) 198-212
30. Yale K. Preparing the right data for training neural networks. IEEE Spectrum 34 3 (1997) 64-66