WebPage
of


ha@dcs.upd.edu.ph


English

Filipino

Henry N. Adorna is a member of the Faculty of the Department of Computer Science, College of EngineeringUniversity of the Philippines Diliman, 1101 Quezon City, Philippines.

He heads the Algorithms and Complexity Laboratory of the Department.

The research interests of Henry are in the Mathematical Foundations of Computer Science, in particular, Membrane Computing, Automata and Formal Language Theory, Discrete Mathematics and Algorithms for Hard Problems.

Henry is one of the founders and co-organizers (J. Caro, F.P. Muga II) of SMACS (Symposium on the Mathematical Aspects of Computer Science). 

Best known upper bound of Henry's Erdos Number is 3, via:

    Henry ADORNA, Gheorghe PAUN, and M. J. PEREZ-JIMENEZ, On Communication Complexity in Evolution-Communication P Systems, Romanian Journal of Information Science and Technology, Vol. 13 No. 2 pp. 113–130, 2010

    Solomon Marcus and Gheorghe Pâun, On symmetry in languages, International Journal of Computer Mathematics, 1029-0265, Volume 52, Issue 1, pp. 1 – 15, 1994

    Paul Erdös and Solomon Marcus, Sur la decomposition de l'espace euclidien en ensembles homogenes, Acta Mathematica Academiae Scientiarum Hungaricae, Vol. 8, Number 3-4, pp. 443-452, 1957

 

Teachings:

       

        2012-2013      First Semester
                                                                    CS 30:       Discrete Mathematics
                                                                    CS 204:     Theory of Computations
                                                                    CS 211:      Combinatorial Optimization
                                                                    CS 397:      Natural and Unconventional Computing Models

       
2011-2012       Second Semester
                                                                    CS 301: Communication Complexity
                                                                    CS 290: Topics in Unconventional Computing
                                                                    CS 197: Bridging Theoretical Computer Science


       
2011-2012       First Semester
                                                                    CS 397: Models of Computations
                                                                    CS 204: Theory of Computations
                                                                    CS 197: Bridging Theoretical Computer Science


        2010-2011       Second Semester
                                                                    CS 290: Models of Computations and Complexity Measures
                                                                    CS 297: Communication Complexity

                                First Semester
                                                                    CS 204: Theory of Computation
                                                                    CS 133: Automata and Computability Theory
                                                                    
        2009-2010       Second Semester
                                                                   
CS 290     Grammar, Communication, and Languages
                                                                    CS 208     Computational Complexity Theory
                                                                    CS 297     Formal Models and Computability


                                  First Semester

                                                                    CS 204    Theory of Computation
                                                                    CS 297    Automata, Grammar, and Communication

        2008-2009         Second Semester
                                                                    CS 290: Algorithmics for Hard Problems
                                                                    CS 297: Special Topics in Communication Complexity
                                                                    Math 157: Discrete Mathematical Structures
        
                                  First Semester            
                                                                    
CS 133: Automata and Computability
                                                                     CS 204: Theory of Computation
                                                                     CS 297: Computer-Assisted Argumentation
                                                                                    and Non-monotonic Reasoning
                                                                     CS 296: Graduate Seminar


Selected Publications:
  1. F.G.C. Cabarle, K.C. Buño, H.N. AdornaSpiking Neural P System Generating the Thue-Morse Sequence. (accepted) Asian Conference on Membrane Computing, Wuhan, China, October 2012.
  2. F.G.C. Cabarle, H. Adorna; On Structures and Behaviors of Spiking Neural P systems and Petri nets. (accepted) 13th Int'l Conference on Membrane Computing, Budapest, Hungary, Aug 2012.
  3. R.A.B. Juayong, F.G.C. Cabarle, H.N. Adorna; On the Simulations of Evolution-Communication P systems with Energy without Antiport Rules for GPUs. Technical report of the 10th Brainstorming Week in Membrane Computing, Seville, Spain, Feb 2012.
  4. J. B. Lee, H. Adorna. Link prediction in a modified heterogeneous bibliographic network. (to appear) IEEE/ACM ASONAM '12, Istanbul, Turkey.
  5. J. A. Malinao, R.A. B. Juayong, E.R. F. Oquendo, R.M. U. Tadlas, J.B. T. Lee, J. B. Clemente, Ma.S. Gaabucayan-Napalang, J.R. F. Regidor, H. N. Adorna. A Quantitative Analysis-based Algorithm for Optimal Data Signature Construction of Traffic Data Sets. In Journal of Information Processing, Vol. 20, No. 3 (2012)
  6. R. Maravilla, E. Tabanda, J. A. Malinao, H. N. Adorna. Data Signature-based Time Series Traffic Analysis on Coarse-grained NLEX Density Data Set. To appear in the International Journal of Database Theory and Application. (2012) 
  7. R. Maravilla Jr, E.R. Tabanda, R.M. Tadlas, J. Malinao, H. Adorna. Proving and Implementing the Effectiveness of iDnc for Optimal 4D Data Signature based Cluster Models of NLEX Traffic Density Data Sets. Currently considered for publication in the Philippine Computing Journal. (2012)
  8. J. Villena, J. A. Malinao, H. N. Adorna. Data Signature-based Multiyear Analysis of BLK-NB 6-minute Interval Data Sets of 2006 to 2009. To appear in the Proceedings of the 2012 IEEE/ACIS 11th International Conference on Computer and Information Science. (2012) 
  9. F.G.C. Cabarle, H. Adorna; Notes on Spiking Neural P systems and Petri nets. (paper presentation) 8th Computability in Europe - How the World Computes (Turing Centenary Conference), Cambridge, England, 2012.
  10. F.G.C. Cabarle, H. Adorna, M.A. Martinez-del-Amor, M.J. Perez-Jimenez, Improving GPU Simulations of Spiking Neural P Systems. Romanian Journal of Information Science and Technology vol. 15(1), 2012.
  11. G. Solano, H. AdornaA Workflow Net for Processing Administrative Complaints, Proceedings of the 12th Philippine Computing Science Congress (PCSC2012), Canlubang, 2012.
  12. R. Maravilla Jr, E.R. Tabanda, R.M. Tadlas, J. Malinao, H. Adorna. Proving and Implementing the Effectiveness of iDnc for Optimal 4D Data Signature-based Cluster Models of NLEX Traffic Density Data Sets. Proceedings of the 12th Philippine Computing Science Congress (PCSC2012), Canlubang, 2012.
  13. F.G.C Cabarle, G.N. Ibo, H. Adorna, K. Buno. Notes On Ternary Combinatorial Search And Communication with Subjectivity.  Proceedings of the 12th Philippine Computing Science Congress (PCSC2012), Canlubang, 2012.
  14. J.E. Pascual, J. Clemente, F.G.C. Cabarle, H. Adorna. Parallel GibbsDST for Motif Finding on GPUs, Proceedings of the 12th Philippine Computing Science Congress (PCSC2012), Canlubang, 2012.
  15. B. Donor, R.A. Juayong, H. Adorna; On the Communication Complexity of Sorting in Evolution-Communication P systems with Energy.  Proceedings of the 12th Philippine Computing Science Congress (PCSC2012), Canlubang, 2012.
  16. F.G.C. Cabarle, H. Adorna, M.A. Martinez-del-Amor; A Spiking Neural P system simulator based on CUDA, in: M. Gheorghe et al. (Eds.): International Conference on Membrane Computing 2011 revised and selected papers, Lecture Notes in Computer Science, Volume 7184, 2012, DOI: 10.1007/978-3-642-28024-5, ISBN 978-3-642-28023-8, pp. 87--103. Springer-Verlag, Berlin Heidelberg (2012).
  17. K. C. Buno, H. AdornaControlled Rewriting Distributed P Systems, Proceedings in Information and Communications Technology, Vol. 5 Nishizaki, S.-y.; Numao, M.; Caro, J.; Suarez, M.T. (Eds.), Springer 2012.
  18. R. A. B. Juayong, H. Adorna; Computing on Evolution-Communication P systems with Energy Using Symport OnlyProceedings in Information and Communications Technology, Vol. 5 Nishizaki, S.-y.; Numao, M.; Caro, J.; Suarez, M.T. (Eds.), Springer 2012.
  19. J. Clemente, F. Cabarle, H. Adorna; PROJECTION Algorithm for Motif Finding on GPUsProceedings in Information and Communications Technology, Vol. 5 Nishizaki, S.-y.; Numao, M.; Caro, J.; Suarez, M.T. (Eds.), Springer 2012.
  20. F. Cabarle, H. Adorna; Some notes on Spiking Neural dP systems and Petri netsProceedings in Information and Communications Technology, Vol. 5 Nishizaki, S.-y.; Numao, M.; Caro, J.; Suarez, M.T. (Eds.), Springer 2012.
  21. K. C. Buno, R. A. B. Juayong, H. Adorna; Communication Complexity of dP Automata Accepting  {(ac)^{s}(bd)^{s} | s >= 0 }. Philippine Computing Journal, Vol 6 No. 1 (2011), pp 17-26.
  22. R.A.B. Juayong, H. Adorna; Communication Complexity of EC P Systems with Energy ans Sevilla Carpet. Philippine Computing Journal, Vol 6 No. 1 (2011), pp 34 - 40.
  23. D.F. Wuysang, H. Adorna; Formal Specification of Electronic Ballot Transmission Protocol in the Applied Pi-Calculus, Philippine Computing Journal, Vol 6 No. 1 (2011), pp 48 - 57
  24. A.C. Garais, G.I.M. Tan, D.F. Wuysang, H. Adorna; Verifying Privacy-Type Properties of an Electronic Voting Protocol that uses Identity Based Cryptography. Philippine Computing Journal, Vol 6 No. 1 (2011), pp 70 - 81.
  25. F. Cabarle, H. Adorna, M.A. Martinez-del-Amor, M.J. Perez-Jimenez; Spiking Neural P system simulations on a high performance GPU platformfull paper accepted in: 2011 International Symposium on Advances of Distributed Computing and Networking (ADCN 2011) 24-26 October, 2011, Melbourne, Australia.
  26. F. Cabarle, H. Adorna, M.A. Martinez-del-Amor; A Spiking Neural P system simulator based on CUDAfull paper accepted in: Twelfth International Conference on Membrane Computing (CMC12) 23-26 August, 2011, Fontainebleau/Paris, France.
  27. G.N. Ibo, H. Adorna; Characterizing Periodicity as a Dynamical Aspect of Generative SN P Systems , full paper accepted in: Twelfth International Conference on Membrane Computing (CMC12) 23-26 August, 2011, Fontainebleau/Paris, France.
  28. X. Zeng, H. Adorna, M.A. Martínez-del-Amor, L. Pan and M. J. Pérez-Jiménez; Matrix Representation of Spiking Neural P Systems; in Membrane Computing: Lecture Notes in Computer Science, 2011, Volume 6501/2011, 377-391,Revised Selected Papers Marian Gheorghe, Thomas Hinze, Gheorghe Paun, Grzegorz Rozenberg and Arto Salomaa (Eds).
  29. F. Cabarle, H. Adorna, M.A. Martınez–del–AmorSimulating Spiking Neural P systems without delays using GPUs, revised and submitted in: International Journal of Natural Computing Research, 2011, Gh. Paun, P. Frisco, M. Perez-Jimenez (eds).
  30. J. A. Malinao, R.A.  B. Juayong, E.R. F. Oquendo, R.M. U. Tadlas, J.B. T. Lee, J. B. Clemente, Ma.S. Gaabucayan-Napalang, J.R. F. Regidor, and H. N. AdornaA Quantitative Analysis-based Algorithm for Optimal Data Signature Construction of Traffic Data Sets. In Proceedings of the 1st AICS/JNU International Conference on Computers, Networks, Systems, and Industrial Engineering (CNSI 2011). 2011.
  31. F. Cabarle, H. Adorna, M.A. Martinez-del-Amor; An Improved GPU Simulator For Spiking Neural P Systems, full paper accepted in: IEEE 6th International Conference on Bio-Inspired Computing: Theories and Applications 2011, Malaysia.
  32. F. Cabarle, H. Adorna, M.A. Martınez–del–AmorSimulating Spiking Neural P systems without delays using GPUs, in: Proceedings of the 9th BWMC, University of Seville, Spain.
  33. F. Cabarle, H. Adorna, M.A. Martınez–del–Amor; Spiking Neural P system without delay simulator implementation using GPGPUs, in: Proceedings of the 11th Philippine Computing Science Congress, Naga city, Philippines.
  34. K. C. Buno, H. N. AdornaSystem of Automata Recognizing Languages, in: Proceedings of the 11th Philippine Computing Science Congress, Naga city, Philippines.
  35. R. A. B. Juayong, H. N. Adorna; A Matrix Representation for Computations on EC P Systems with Energy, in: Proceedings of the 11th Philippine Computing Science Congress, Naga city, Philippines.
  36. E.R. Oquendo, J.A. Malinao, R.A.B. Juayong, R.M.U. Tadlas, J.B. Lee, J.B. Clemente, M.S. Gaabucayan-Napalang, J.R.F. Regidor, and H.N. Adorna; Data Signature 2-Dimensional Representations for Traffic Data Analysis and Prediction, In Proceedings 11th Philippine Computing Science Congress, 2011
  37. E.R. Oquendo, J. Clemente, J. Malinao, and H. Adorna; Characterizing Classes of Potential Outliers through Traffic Data Set Data Signature 2D nMDS Projection, In Philippine Information Technology Journal, Volume 4, Number 1, 2011.
  38. H. Adorna, Gh. Paun, and M. J. Perez-Jimenez ; On Communication Complexity in Evolution-Communication P Systems, Romanian Journal of Information Science and Technology, Vol. 13 No. 2 pp. 113–130, 2010
  39. R. A. B. Juayong, H. N. Adorna; A Note on the Universality of EC P Systems with Energy, in: 2nd International Conference on Information Technology Convergence and Services (ITCS 2010), Cebu City, Philippines, August 2010.
  40. N. W. Sy, J. DL Caro, and N. H. S. Hernandez, H. Adorna;  On the Octagonal Drawings  of a Class of 2-4 Plane Graphs with Bends and with Prescribed Face Areas, In: H.
    Adorna (ed) Electronic Proceedings of PCSC 2010 pp 308-319
  41. J. A. Malinao, R. A. B. Juayong, N. H. S. Hernandez, H. Adorna;  Generating a Set of Strong Spanned Patterns Using SubCP Reduction and the MHA-Product Operation, In: H.
    Adorna (ed) Electronic Proceedings of PCSC 2010, pp 245-252
  42. J. G. Beceral, K. R. C. Cabreros, R. A. B. Juayong, J. A. Malinao, H. Adorna; Traffic Data Analysis and Visualization via BC Method, In: H. Adorna (ed) Electronic Proceedings of PCSC 2010, pp 84-90
  43. J. Malinao, H. Adorna; An Algorithm to Efficiently Generate an Approximation of a Theory Set, Philippine Computing Journal, Vol. 4, No.2, (2009), pp. 19-32. 
  44. R.A. Juayong, M.C. Albores, H. Adorna; An Implementation of a Backtracking Algorithm for the Turnpike Problem in Membranes, Philippine Computing Journal, Vol. 4, No.1, (2009), pp. 1-11. 
  45. M. Robles, J. Pasia, H. Adorna;  An algorithm for solving the open gallery problem, Philippine Computing Journal, Vol. 4, No.1, (2009), pp.12-17.
  46. N.H.S. Hernandez, H. Adorna; On Network Properties of a Generalized Hypercubes, Philippines Computing Journal, Vol. 4, No.1, (2009), pp. 26-30.
  47. J.A. Malinao, N. Hernandez, H. Adorna; The SSP-Trie Algorithm for Efficient Strong Spanned Pattern Set Generation of ACTSF, 3rd ERDT-DOST Conference, Manila (2009)
  48. U. Garnica, J.A. Malinao, R. Juayong, H. Adorna; The Reduction Buildup Algorithm (RBA) for Efficient Support Set Construction, NCITE, Cagayan de Oro (2009)
  49. J.A. Malinao, R.B. Juayong, F. Corpuz, J. Yap, H. Adorna; Data signatures for traffic data analysis, NCITE, Cagayan de Oro (2009)
  50. J. A. Malinao, H. Adorna; An Algorithm to Efficiently Generate an Approximation of a Theory Set, Proc. of 9th PCSC, pp. 185-208 (2009)
  51. P. C. Zuniga, M. Malonzo, H. Adorna, P. Naval;  An Ant Colony Optimization Algorithm for the Network Inference and Parameter Estimation of S-Systems, Proc. of 9th PCSC, pp. 267-271 (2009)
  52. M. M. Robles, J. M. Pasia, H. Adorna; An Algorithm for Solving the Open Gallery Problem, Proc. of 9th PCSC, pp. 249-254 (2009)
  53. N. H. S. Hernandez, H. Adorna; On Network Properties of a Generalized Hypercubes, Proc. of 9th PCSC, pp. 169-173 (2009)
  54. H.N. Adorna: Some Descriptional Complexity Problems on Finite Automata. Philippine Computing Journal, Vol 3, No. 1, pp 1-6, (2008)
  55. H.N. Adorna, N.Hernandez, R. Lorenzo: On the UFA and the Strict Tree Property. Philippine Computing Journal, Vol 3, No.1, pp 7-12, (2008)
  56. H.N. Adorna, A. Aragon, P. Cabral: On Infinite Sequence induced by Collatz Problem,  Philippine Computing Science Journal, Vol 3, No. 1,  pp 40-45, (2008)
  57. H.N. Adorna: Sequences, Languages and Automata. In:R. Saldana et al. (eds), Proceedings of 8th Philippine Computing Science Congress (2008)
  58. M. de Guzman, J. Pasia, H.N. AdornaSchutzenberger's Guessing Game and Finite Kolakoski Subsequence. In: R. Saldana et al. (eds), Proceedings of 8th Philippine Computing Science Congress (2008)
  59. H.N. Adorna, A. Aragon, P. Cabral: On Infinite Sequence induced by Collatz Problem, In: R. Saldana et al. (eds) Proceedings of 6th Philippine Computing Science Congress,  (2006), 221-226
  60. H.N. Adorna: Some Descriptional Complexity Problems on Finite Automata. In: R. Saldana et al. (eds) Proceedings of 5th Philippine Computing Science Congress (2005), 27-32
  61. H.N. Adorna: On the Separation between k-Party and (k-1)-Party Nondeterministic Message Complexity. LNCS 2450, 151-161 (2003)
  62. H.N. Adorna: 3-Party Message Complexity is Better than 2-Party Ones for Proving Lower Bounds on the Size of Minimal Nondeterministic Finite Automata. Journal of Automata, Languages and Combinatorics,7 (2002) 4, 419-432.

Last Update: 10 Marso 2009
by H.N. Adorna.
Comments and Suggestions