Invited Speakers

Keynote A

Tao Song (China University of Petroleum, China)

Title: A Short Survey on Spiking Neural P Systems and Some Further Research Directions

Abstract:

In the lecture, a short survey on spiking neural P systems will be given, from 2006 to 2015. As well, classical research topics in spiking neural P systems will be briefly introduced, including computational power (as sets of numbers generating device, languages generating devices, functions computing devices), computational efficiency and new variants of the systems (with biological inspirations and mathematic motivations). Also, some promising applications with spiking neural P systems will be discussed, including performing four basic arithmetic operations, approximately solving combinatorial optimization problems, fault diagnosing of power nets, fussy knowledge representation, data clustering, pattern recognition etc.

Keynote B

Henry N. Adorna (University of the Philippines, Philippines)

Title: Communication Complexity in Membrane Computing

Abstract:

Membrane computing has been around since 1998 (initially through the internet). In [6] Gh. Paun introduced this model of computation as an abstraction of the functioning of a living cell. The innate partitions in a cell structure are capitalized to described a computing model that performs operations in a maximally parallel manner. Indeed, models of computation in membrane computing is a non-deterministic maximally parallel computing model. Membrane computing models are now called P systems (named after its creator). Many variants of P systems have been introduced since then and all are proved to be universal[8]. One could consider [7] as a very good introduction.
Operations common to most of the variants of P systems are evolution of objects in the region or membrane and communication where objects are being transported across regions. In the 2002, M. Cavaliere in [2], introduced a so-called Evolution-Communication P systems (ECP systems). In the 2009, H. Adorna et al in [1] introduced an idea of energy in ECP systems (which they called ECP systems with energy or ECPe systems) to study the concept of communication complexity in membrane computing. Furthermore, priority between communication and evolution is considered in [1] as approaches in performing operations in solving problems.
In this talk, we shall report on the power of ECPe Systems in solving hard problems as reported in [3,4]. In particular, we report on the communication complexity of some hard problems like Vertex Cover Problem and 3-Satisfiability Problem in ECPe systems. We use concept and idea of communication complexity as defined in [1]. We further present results on communication complexity using with and without priority mode in computation via ECPe systems. Suggested future directions will be provided in the talk.
Some details of the talk could be read in full in [5] of this volume.

References
1. Adorna, H., Paun, Gh., Perez-Jimenez, M. On Communication Complexity in Evolution-Communication P Systems. Romanian Journal of Information Science and Technology, Vol 12, No. 2, pp 157-173 (2009)
2. Cavaliere, M.; Evolution-Communication P systems. LNCS 2597, Springer, pp 133-145 (2003)2 H.N. Adorna
3. Francia, S., Francisco, D.A., Juayong, R.A., Adorna, H. On Communication Complexity of Some Hard Problems in ECPe Systems with Priority. Philippine Computing Journal, Vol 9 No 2, pp 14 – 25 (2014)
4. Henrnadez, N.H., Juayong, R.A., Adorna, H. On Communication Complexity of Some Hard Problems in ECPe Systems. LNCS 8340, Springer, pp 206-224 (2014)
5. Hernandez, N.H., Juayong, R.A., Francia, S., Francisco, D.A., Adorna, H. On the Communication Complexity of the Vertex Cover Problem and 3-Satisfiability Problem in ECPe Systems. this volume (2015)
6. Paun, Gh.: Computing with membranes. Journal of Computer and System Science, vol. 61(1), pp. 108-143 (1999)
7. Paun, Gh.: Membrane Computing: An Introduction. Springer (2002)
8. Paun, Gh., Rozenberg, G., Salomaa, A. (eds) The Oxford Handbook of Membrane Computing, Oxford University Press (2010)

Acknowledgements: H. Adorna is supported in part by Semirara Mining Corporation Professorial Chair in Computer Science, the ERDT-DOST Project, and by the OVCRD research load credit grant of UPDiliman.

Keynote C

 

K.G. Subramanian (Madras Christian College, India)

Title: Picture Languages and P Systems

Abstract:

In the development of syntactic methods to describe higher dimensional structures such as arrays, trees or graphs, different kinds of approaches based on generalizations of string grammars continue to be proposed. Many of these have a motivation arising in some application problem in the areas of image analysis and picture processing, particularly, in the problems of character recognition, scene analysis, clustering patterns and others. In the case of picture languages consisting of rectangular or non-rectangular arrays of symbols in the two-dimensional plane, formal grammars are found to be suitable for handling structural properties of picture patterns, especially based on the fact that a complex pattern can be viewed as composed of simpler patterns analogous to the way sentences are formed in a language. For an account of the earlier methods, see for example [6,7,12] while for some recent developments, we refer to [2,4,9,11].

On the other hand, in the area of Membrane Computing [5], which was introduced by Gh. Pǎun around the year 2000, there has been a wide applicability of the theoretical model of computation, known as P system and its several variants, in several areas of study and investigation. A good account of evolving recent research topics in membrane computing is given in [3], thereby bringing out the versatility and adaptability of the biologically inspired P system model. Bringing together two-dimensional picture grammars and P systems, array-rewriting P systems have been introduced in [1]. Subsequently, there have been several models of array P system (see, for example, [8]) introduced and investigated by many researchers, again with different motivations. In this talk, an overview of this connection between P systems and picture grammars will be provided, besides indicating recent developments in this area and pointing out possible future research directions and applications as well.

References:

[1] R. Ceterchi, M. Mutyam, Gh. Pǎun, K.G. Subramanian, Array rewriting P systems, Natural Computing, 2, 229-249, 2003.
[2] H. Fernau, R. Freund, R. Siromoney, K.G. Subramanian, Non-isometric Contextual Array Grammars with Regular Control and Local Selectors, Lecture Notes in Computer Science Vol. 9288, 61-78, 2015.
[3] M. Gheorghe, Gh. Pǎun, M.J. Perez-Jimenez, G. Rozenberg, Research frontiers of membrane computing: Open problems and research topics, Int. J. Found. Comp. sci., 24(5) 547-623, 2013.
[4] D. Giammarresi, A. Restivo, Two-dimensional languages. In: Rozenberg G., Salomaa, A. (Ed.) Handbook of Formal Languages, Vol. 3, Springer Verlag, pp. 215-267, 1997.
[5] Gh. Pǎun, Computing with Membranes: An Introduction, Springer-Verlag, Berlin, 2002.
[6] A. Rosenfeld, Picture Languages. Academic Press, Reading, MA, 1979
[7] A. Rosenfeld, R. Siromoney, Picture languages — a survey. Languages of Design 1, 229-245, 1993.
[8] K.G. Subramanian, P systems and Picture languages, Lecture Notes in Computer Science, Vol. 4664, 99-109, 2007.
[9] K. G. Subramanian, R. M. Ali, M. Geethalakshmi, A.K. Nagar, Pure 2D picture grammars and languages, Discrete Applied Mathematics 157, 3401-3411, 2009.
[10] K. G. Subramanian, K. Rangarajan and M. Mukund (eds.): Formal Models, Languages and Applications. Series in Machine Perception and Artificial Intelligence, Vol. 66, World Scientific Publishing, 2006.
[11] K. G. Subramanian, D.G. Thomas, P. Helen Chandra, Maia Hoeberechts, Basic Puzzle Grammars and Generation of Polygons, Journal of Automata, Languages and Combinatorics 6(4), 555-568, 2001.
[12] P.S.P. Wang (ed.), Array Grammars, Patterns and Recognizers, Series in Computer Science, Vol. 18. World Scientific, 1989.

 

 

Keynote D

Quan Zou (Tianjin University, China)

Title: Computational prediction of miRNA and miRNA-disease relationship

Abstract:

MicroRNA is a kind of “star” molecular, and serves as a “director” since it can regulate the expression of protein. In 2006, related works on gene silence won Nobel price, which made miRNA be the hot topic in molecular genetics and bioinformatics. Mining miRNA and targets prediction are two classic topics in computational miRNAnomics. In this talk, we focus on the miRNA mining problems from machine learning views. We point out that the negative data is the key problem for decreasing the False Positive rather than exploring better features. miRNA-disease relationship prediction is another hot topic in recent years. We introduce some novel network methods on calculating miRNA-miRNA similarity, which is the key issue for miRNA-disease relationship prediction.

Short Bio:

Dr. Quan Zou is a Professor of Computer Science at Tianjin University. He received his PH.D. from Harbin Institute of Technology, P.R.China in 2009. From 2009 to 2015, he is an assistant and associate professor in Xiamen University, P.R.China. His research is in the areas of bioinformatics, machine learning and parallel computing. Several related works have been published by Briefings in Science, Bioinformatics, Bioinformatics, IEEE/ACM Transactions on Computational Biology and Bioinformatics, etc. Google scholar showed that his more than 100 papers have been cited more than 1100 times. He is the editor member of Scientific Reports and PLOS One. He is also a reviewer for many impacted journals, including Bioinformatics, Briefings in Bioinformatics, IEEE/ACM Transactions on Computational Biology and Bioinformatics, etc. In Feb.2005, he is awarded as the Outstanding Reviewers for Computers in Biology and Medicine. He also serves as the Program Committee member for several international conferences.

ASIAN CONFERENCE ON MEMBRANE COMPUTING