Analysis of P-Systems under a Multiagent Systems Perspective

Membrane computing is a recent area that belongs to natural computing. This field works on computational models based on nature's behavior to process the information. Recently, numerous models have been developed and implemented with this purpose. P-systems are the structures which have been defined, developed and implemented to simulate the behavior and the evolution of membrane systems which we find in nature. What we show in this paper is an application capable to simulate the P-systems based on a multiagent systems (MAS) technology. The main goal we want to achieve is to take advantage of the inner qualities of the multiagent systems. This way we can analyse the proper functioning of any given p-system. When we observe a P-system from a different perspective, we can be assured that it is a particular case of the multiagent systems. This opens a new possibility, in the future, to always evaluate the P-systems in terms of the multiagent systems technology.

One Approach to Knowledge Mapping for International Student Portal

* The work is partly supported by RFFI grant 08-07-00062-a

One-Parameter Bifurcation Analysis of Dynamical Systems using Maple

This paper presents two algorithms for one-parameter local bifurcations of equilibrium points of dynamical systems. The algorithms are implemented in the computer algebra system Maple 13 © and designed as a package. Some examples are reported to demonstrate the package’s facilities.

One Approach to Drawing Tasks Statistics

Report published in the Proceedings of the National Conference on "Education and Research in the Information Society", Plovdiv, May, 2014

On the Busy Period in One Finite Queue of M/G/1 Type with Inactive Orbit

The paper deals with a single server finite queuing system where the customers, who failed to get service, are temporarily blocked in the orbit of inactive customers. This model and its variants have many applications, especially for optimization of the corresponding models with retrials. We analyze the system in non-stationary regime and, using the discrete transformations method study, the busy period length and the number of successful calls made during it. ACM Computing Classification System (1998): G.3, J.7.

Implementation of the EM Algorithm for Maximum Likelihood Estimation of a Random Effects Model for One Longitudinal Ordinal Outcome

2010 Mathematics Subject Classification: 62J99.