PL
 |
EN
Preferencje help
Polish version English version Język
Widoczny [Schowaj] Abstrakt
Liczba wyników

Znaleziono wyników: 8

Liczba wyników na stronie
first rewind previous Strona / 1 next fast forward last
Wyniki wyszukiwania
help Sortuj według:

help Ogranicz wyniki do:
first rewind previous Strona / 1 next fast forward last
1
Content available remote Spatially Localised Membrane Systems
Csuhaj-Varjú E., Gheorghe M., Stannett M., Vaszil G.
Fundamenta Informaticae
|
2015
|
Vol. 138, nr 1/2
193--205
EN
In this paper we investigate the use of general topological spaces in connection with a generalised variant of membrane systems. We provide an approach which produces a fine grain description of local operations occurring simultaneously in sets of compartments of the system by restricting the interactions between objects. This restriction is given by open sets of a topology and multisets of objects associated with them, which dynamically change during the functioning of the system and which together define a notion of vicinity for the objects taking part in the interactions.
2
Content available remote Conventional Verification for Unconventional Computing : a Genetic XOR Gate Example
Konur S., Gheorghe M., Dragomir C., Ipate F., Krasnogor N.
Fundamenta Informaticae
|
2014
|
Vol. 134, nr 1/2
97--110
EN
As unconventional computation matures and non-standard programming frameworks are demonstrated, the need for formal verification will become more prevalent. This is so because “programming” in unconventional substrates is difficult. In this paper we show how conventional verification tools can be used to verify unconventional programs implementing a logical XOR gate.
3
Content available remote CANDU®6 Nuclear Power Plant and nuclear energy self-suffciency based on Cernavoda NPP in Romania
Parkitny J., Gheorghe M.
Journal of Power Technologies
|
2011
|
Vol. 91, nr 3
140-147
EN
The CANDU® 6 nuclear power reactor design has been in commercial operation since the 1980s and is currently in operation in several countries, including Canada, Argentina, South Korea, China and Romania. CANDU 6 is the proven, mid size version of the CANDU Pressurized Heavy Water Reactor (PHWR). With a gross electrical output in excess of 720 MWe, the CANDU 6 fits easily into most grids. The CANDU designuses natural uranium fuel. Other fuel types can be used, including slightly enriched uranium (SEU), recovered uranium (RU), mixed oxides (MOX), and thorium. On power re-fuelling maintains the reactivity, eliminates the need for re-fuelling outages, and contributes to the availability record of CANDU power plants. The focus of this paper, apart from summarizing some key technical and operating features of the CANDU reactor design, is to demonstrate how the selection of the CANDU technology can contribute to the development of the country's nuclear industry and economy and allows nuclear self sufficiency, using the Cernavoda Nuclear Power Plant (NPP) project in Romania as an example. Similar benefits, in terms of economic development and nuclear energy self-sufficiency, have also been realized by other countries that have selected the CANDU reactor technology.
4
Content available remote On Restricted Bio-Turing Machines
Raghavan R., Ramesh H., Gheorghe M., Krishna S.N.
Fundamenta Informaticae
|
2011
|
Vol. 110, nr 1-4
309-320
EN
Here we continue the study of bio-Turing machines introduced in [2] and further investigated in [17]. We introduce a restricted model of bio-Turingmachine and we investigate its computational power, a hierarchy of languages accepted, and deterministic and nondeterministic variants. A comprehensive example illustrating the modelling power of the introduced machine ends the paper.
5
Content available remote A Quantum-Inspired Evolutionary Algorithm Based on P systems for Knapsack Problem
Zhang G-X., Gheorghe M., Wu C-Z.
Fundamenta Informaticae
|
2008
|
Vol. 87, nr 1
93-116
EN
This paper introduces an evolutionary algorithm which uses the concepts and principles of the quantum-inspired evolutionary approach and the hierarchical arrangement of the compartments of a P system. The P system framework is also used to formally specify this evolutionary algorithm. Extensive experiments are conducted on a well-known combinatorial optimization problem, the knapsack problem, to test the effectiveness of the approach. These experimental results show that this evolutionary algorithm performs better than quantum-inspired evolutionary algorithms, for certain arrangements of the compartments of the P system structure utilized.
6
Content available remote On P Systems and Almost Periodicity
Bernardini F., Gheorghe M., Manca V.
Fundamenta Informaticae
|
2005
|
Vol. 64, nr 1-4
29-42
EN
The study of P systems as a mathematical model for biological systems is an important research topic in the area of membrane computing. In this respect, the detection of periodicity and almost periodicity as aspects of the system dynamics seems to be of particular relevance for understanding many biological processes and their related phenomena. This paper introduces specific notions of periodicity and almost periodicity for (infinite) sequences of multisets, which are used to describe the dynamics of P systems. Specifically, a variant of P systems, called P systems with resources, is considered where the rules always consume a certain amount of resources, which are provided in the form of a periodic input sequence of multisets. It is then shown that P systems with resources are computationally complete (when halting computations are considered) and that, in general, they can generate sequences of multisets that are not even almost periodic (once the constraint of having halting computation is released). However, if P systems with resources are restricted to be deterministic, it is shown that a characterization of the behaviour of a particular class of P systems with resources can be obtained in terms of almost periodicty.
7
Content available remote Formal black box testing for partially specified deterministic finite state machines
Balanescu T., Gheorghe M., Ipate F., Holcombe M.
Foundations of Computing and Decision Sciences
|
2003
|
Vol. 28, No. 1
17-28
EN
One of the most important methods of generating test sets for software modelled by finite state machines is Chow's W-method. However, the W-method is only proved to work if both the specification and the implementation are completely-specified deterministic finite state machines (i.e. there is a transition for any state and any input symbol). This paper extends the W-method to (possibly) partially specified deterministic finite state machines. It shows that, by slightly augmenting the test set, the W-method remains valid in this, more general, case. It is also shown how this generalised W--method can be used to generate test sets for a type of extended finite state machines, called stream X-machines (Eilenberg machines).
8
Content available remote P Systems with Replicated Rewriting and Stream X-Machines (Eilenberg Machines)
Aguado J., Balanescu T., Cowling T., Gheorghe M., Holcombe M., Ipate F.
Fundamenta Informaticae
|
2002
|
Vol. 49, nr 1-3
17-33
EN
The aim of this paper is to show how the P systems with replicated rewriting can be modeled by X-machines (also called Eilenberg machines). In the first approach, the parallel behaviour of the regions of a P system is simulated by a sequential process involving a single X-machine. This allows the application of the X-machine testing procedures in order to prove the correctness of P systems. In the second approach, a P system is simulated by a communicating system of X-machines. Each component of such a system is an X-machine associated with a region of the given P system. The components act in parallel, as their counterparts do in a P system, and use some specific mechanism for communication and synchronisation.
first rewind previous Strona / 1 next fast forward last
JavaScript jest wyłączony w Twojej przeglądarce internetowej. Włącz go, a następnie odśwież stronę, aby móc w pełni z niej korzystać.