EMOTIONALLY INTELLIGENT ALGORITHMS DEALING SOME PRACTICAL COMBINATORIAL PROBLEMS

A s per the research in the field of Neuro Sciences, our Subconscious mind actually controls our emergency motor neurons for smooth functioning our most vital mussels such as Heart, Lungs, Kidneys, Brain and other internal and external mussels to live us bypassing conscious logical decisions making memory, the conscious memory, and that is why our subconscious memory functions the most important role to live us and to deal with internal and external problems. This subconscious mind controls our emotions. That is why the emotionally intelligent human can take better decisions than a machine.

[1]  K. Sörensen,et al.  AN ALGORITHM TO GENERATE ALL SPANNING TREES OF A GRAPH IN ORDER OF INCREASING COST , 2005 .

[2]  N.R. Malik,et al.  Graph theory with applications to engineering and computer science , 1975, Proceedings of the IEEE.

[3]  Sofiène Tahar,et al.  A public-key watermarking technique for IP designs , 2005, Design, Automation and Test in Europe.

[4]  Samar Sen Sarma,et al.  Generation of All Spanning Trees of a Simple, Symmetric Connected Graph , 2009 .

[5]  Miodrag Potkonjak,et al.  Localized watermarking: methodology and application to template mapping , 2000, 2000 IEEE International Conference on Acoustics, Speech, and Signal Processing. Proceedings (Cat. No.00CH37100).

[6]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[7]  Richard W. Hamming,et al.  Coding and Information Theory , 1980 .

[8]  Frank Harary,et al.  A survey of the reconstruction conjecture , 1974 .

[9]  D. Lipman,et al.  The multiple sequence alignment problem in biology , 1988 .

[10]  Xin-She Yang,et al.  Introduction to Algorithms , 2021, Nature-Inspired Optimization Algorithms.

[11]  Behrouz A. Forouzan,et al.  Cryptography and network security , 1998 .

[12]  Ralph C. Merkle,et al.  Secrecy, authentication, and public key systems , 1979 .

[13]  E. J. Farrell,et al.  On the reconstraction of the matching polynomial and the reconstruction conjecture , 1987 .

[14]  W. Mayeda,et al.  Generation of Trees without Duplications , 1965 .

[15]  Gary Chartrand,et al.  Graphs & Digraphs: Third Edition , 1996 .

[16]  Subhashis Banerjee,et al.  The Reconstruction Conjecture , 2012 .

[17]  I. Torunoglu,et al.  Watermarking-based copyright protection of sequential functions , 2000, IEEE Journal of Solid-State Circuits.

[18]  Yung-Sheng Chen,et al.  A communication system model for digital image watermarking problems , 2007 .

[19]  E. J. Farrell,et al.  An introduction to matching polynomials , 1979, J. Comb. Theory, Ser. B.

[20]  M. Potkonjak,et al.  FPGA fingerprinting techniques for protecting intellectual property , 1998, Proceedings of the IEEE 1998 Custom Integrated Circuits Conference (Cat. No.98CH36143).

[21]  John Clark,et al.  A First Look at Graph Theory , 1991 .

[22]  Antonio García,et al.  IPP Watermarking Technique for IP Core Protection on FPL Devices , 2006, 2006 International Conference on Field Programmable Logic and Applications.

[23]  H. Trent.  A NOTE ON THE ENUMERATION AND LISTING OF ALL POSSIBLE TREES IN A CONNECTED LINEAR GRAPH. , 1954, Proceedings of the National Academy of Sciences of the United States of America.

[24]  Donald Ervin Knuth,et al.  The Art of Computer Programming, Volume II: Seminumerical Algorithms , 1970 .

[25]  Ujjwal Maulik,et al.  Probabilistic Analysis of Cellular Automata Rules and its Application in Pseudo Random Pattern Generation , 2008 .

[26]  Ulrich Storz,et al.  Intellectual property protection , 2011, mAbs.

[27]  Edith Hemaspaandra,et al.  Complexity results in graph reconstruction , 2004, Discret. Appl. Math..

[28]  Hen-Wai Tsao,et al.  Watermarking for intellectual property protection , 2003 .

[29]  Sundaram Seshu,et al.  Linear Graphs and Electrical Networks , 1961 .

[30]  Fred Piper,et al.  Stream Ciphers , 1982, EUROCRYPT.

[31]  Arlindo L. Oliveira.  Robust techniques for watermarking sequential circuit designs , 1999, DAC '99.

[32]  Edoardo Charbon.  Hierarchical watermarking in IC design , 1998, Proceedings of the IEEE 1998 Custom Integrated Circuits Conference (Cat. No.98CH36143).

[33]  Anthony J. G. Hey,et al.  Feynman Lectures on Computation , 1996 .

[34]  ENUMERATION OF SPANNING TREES OF GRAPHS , 1994 .

[35]  M. Jerrum.  Two-dimensional monomer-dimer systems are computationally intractable , 1987 .

[36]  Gang Qu,et al.  Publicly detectable watermarking for intellectual property authentication in VLSI design , 2002, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[37]  M. Piekarski.  Listing of All Possible Trees of a Linear Graph , 1965 .

[38]  Charles J. Alpert,et al.  The ISPD98 circuit benchmark suite , 1998, ISPD '98.

[39]  Susmita Sur-Kolay,et al.  Encoding of Floorplans through Deterministic Perturbation , 2009, 2009 22nd International Conference on VLSI Design.

[40]  E. Reingold,et al.  Combinatorial Algorithms: Theory and Practice , 1977 .

[41]  Parthasarathi Dasgupta,et al.  An internet-based IP protection scheme for circuit designs using linear feedback shift register (LFSR)-based locking , 2009, SBCCI.

[42]  M. Aswatha Kumar,et al.  Symmetric Key Image Encryption Scheme with Key Sequences Derived from Random Sequence of Cyclic Elliptic Curve Points. , 2011 .

[44]  Miodrag Potkonjak,et al.  Constraint-based watermarking techniques for design IP protection , 2001, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[45]  S. L. Hakimi,et al.  On trees of a graph and their generation , 1961 .

[46]  Franklin M. Ingels.  Information and coding theory , 1971 .

[47]  Susmita Sur-Kolay,et al.  A Novel Scheme for Encoding and Watermark Embedding in VLSI Physical Design for IP Protection , 2007, 2007 International Conference on Computing: Theory and Applications (ICCTA'07).