Wyniki wyszukiwania - BazTech

1

Wykorzystanie zapasów trwałości oraz rezerw po stronie sterowania dla zwiększenia elastyczności bloków klasy 200 MW

Trzeszczyński Jerzy, Galbarczyk Paweł, Murzynowski Wojciech, Stanek Radosław, Hatłas Marcin, Kusibab Mateusz, Zając Paweł

Energetyka

|

2022

|

nr 12

642--646

PL

Zdobyta wiedza i doświadczenie skłoniły Pro Novum do opracowania Metody, której podstawowymi atutami są uniwersalność i niskie koszty wdrożenia, co sprawia, że może zostać zaimplementowana z korzyścią ekonomiczną nawet na blokach, których dalsza eksploatacja może być względnie krótka z uwagi na niespełnienie wszystkich wymagań emisyjnych oraz braku korzyści z Rynku Mocy, a także wykonywania specjalnych usług systemowych. W artykule przedstawiono genezę, podstawowe założenia, warunki wdrożenia, opis funkcjonalny oraz atuty Metody Pro Novum.

EN

The acquired knowledge and experience moved Pro Novum to develop a Method, the main advantages of which are universality and low implementation costs, which means that it can be implemented with an economic benefit even on units whose further operation may be relatively short due to failure to meet all emission requirements and no benefits from the Power Market as well as special system services. The article presents the genesis, basic assumptions, implementation conditions, functional description and advantages of the Pro Novum Method.

2

Poprawa elastyczności bloków klasy 200 MW poprzez wykorzystanie możliwości i rezerw po stronie sterowania oraz zapasów trwałości

Trzeszczyński Jerzy

Energetyka

|

2022

|

nr 6

297--301

PL

Zdobyta wiedza i doświadczenie skłoniły Pro Novum do opracowania Metody, której podstawowymi atutami są uniwersalność i niskie koszty wdrożenia, co sprawia, że może zostać zaimplementowana z korzyścią ekonomiczną nawet na blokach, których dalsza eksploatacja może być względnie krótka z uwagi na niespełnienie wszystkich wymagań emisyjnych oraz braku korzyści z Rynku Mocy, a także wykonywania specjalnych usług systemowych. W artykule przedstawiono genezę, podstawowe założenia, warunki wdrożenia, opis funkcjonalny oraz atuty Metody Pro Novum.

EN

The acquired knowledge and experience moved Pro Novum to develop a Method, the main advantages of which are universality and low implementation costs, which means that it can be implemented with an economic benefit even on units whose further operation may be relatively short due to failure to meet all emission requirements and no benefits from the Power Market as well as special system services. The article presents the genesis, basic assumptions, implementation conditions, functional description and advantages of the Pro Novum Method.

3

P Systems with Rule Production and Removal

Pan Linqiang, Song Bosheng

Fundamenta Informaticae

|

2020

|

Vol. 171, nr 1-4

313--329

EN

P systems are a class of parallel computational models inspired by the structure and functioning of living cells, where all the evolution rules used in a system are initially set up and keep unchanged during a computation. In this work, inspired by the fact that chemical reactions in a cell can be affected by both the contents of the cell and the environmental conditions, we introduce a variant of P systems, called P systems with rule production and removal (abbreviated as RPR P systems), where rules in a system are dynamically changed during a computation, that is, at any computation step new rules can be produced and some existing rules can be removed. The computational power of RPR P systems and catalytic RPR P systems is investigated. Specifically, it is proved that catalytic RPR P systems with one catalyst and one membrane are Turing universal; for purely catalytic RPR P systems, one membrane and two catalysts are enough for reaching Turing universality. Moreover, a uniform solution to the SAT problem is provided by using RPR P systems with membrane division. It is known that standard catalytic P systems with one catalyst and one membrane are not Turing universal. These results imply that rule production and removal is a powerful feature for the computational power of P systems.

4

The Computational Power of Cell-like P Systems with Symport/Antiport Rules and Promoters

Jiang Suxia, Wang Yanfeng, Xu Jinbang, Xu Fei

Fundamenta Informaticae

|

2019

|

Vol. 164, nr 2-3

207--225

EN

Cell-like P systems with symport/antiport rules (CSA P systems, for short) are a class of computational models in membrane computing, inspired by the way of transmembrane transport of substances through membrane channels between neighboring regions in a cell. In this work, we propose a variant of CSA P systems, called cell-like P systems with symport/antiport rules and promoters (CSAp P systems, for short), where symport/antiport rules are regulated by multisets of promoters. The computational power of CSAp P systems is investigated. Specifically, it is proved that CSAp P systems working in the maximally parallel mode, having arbitrary large number of membranes and promoters and using only symport rules of length 1 or antiport rules of length 2, are able to compute only finite sets of non-negative integers. Furthermore, we show that CSAp P systems with two membranes working in a sequential mode when having at most two promoters and using only symport rules of length 2, or having at most one promoter and using symport rules of length 1 and antiport rules of length 2, are Turing universal.

5

Spiking Neural P Systems with Rules on Synapses Working in Sum Spikes Consumption Strategy

Su Y., Wu T., Xu F., Păun A.

Fundamenta Informaticae

|

2017

|

Vol. 156, nr 2

187--208

EN

Spiking neural P systems with rules on synapses (RSSN P systems, for short) are a class of distributed and parallel computation models inspired by the way in which neurons process and communicate information with each other by means of spikes, where neurons only contain spikes and the evolution rules are on synapses. RSSN P systems have been proved to be Turing universal, using the strategy that restricts all the applied rules to consume the same number of spikes from the given neuron, termed as equal spikes consumption strategy. In this work, in order to avoid imposing the equal spikes consumption restriction on the application of rules, a new strategy for rule application, termed as sum spikes consumption strategy, is considered in RSSN P systems, where a maximal set of enabled rules from synapses starting from the same neuron is nondeterministically chosen to be applied, in the sense that no further synapse can use any of its rules, and the sum of these numbers of spikes that all the applied rules consume is removed from the neuron. In this way, the proposed strategy avoids checking whether all the applied rules consume the same number of spikes from the given neuron. The computation power of RSSN P systems working in the proposed strategy is investigated, and it is proved that such systems characterize the semilinear sets of natural numbers, i.e., such systems are not universal. Furthermore, RSSN P systems with weighted synapses working in the proposed strategy are proved to be Turing universal. These results show that the weight on synapses is a powerful ingredient of RSSN P systems in terms of the computation power, which makes RSSN P systems working in sum spikes consumption strategy become universal from non-universality.

6

P Systems Simulating Bacterial Conjugation : Universality and Properties

Păun A., Rodríguez-Patón A.

Fundamenta Informaticae

|

2017

|

Vol. 153, nr 1/2

87--103

EN

We refine the modeling in the P systems area of the way bacteria transmit genetic information in bacterial colonies, specifically the conjugation process. We study this new model from the computational power perspective using methods and ideas in the area; we are able to prove the universality of these systems. We show that systems working in a homogeneous manner and using only 75 species of objects in the regions and 13 species of "on-membrane" objects are enough for reaching universality. The system starts in a initial state with only few (nine) bacteria needed and the "bacteria" from this system are homogeneous, all have the same rules.

7

Tissue P Systems with Protein on Cells

Song B., Pan L., Pérez-Jiménez M. J.

Fundamenta Informaticae

|

2016

|

Vol. 144, nr 1

77--107

EN

Tissue P systems are a class of distributed parallel computing devices inspired by biochemical interactions between cells in a tissue-like arrangement, where objects can be exchanged by means of communication channels. In this work, inspired by the biological facts that the movement of most objects through communication channels is controlled by proteins and proteins can move through lipid bilayers between cells (if these cells are fused), we present a new class of variant tissue P systems, called tissue P systems with protein on cells, where multisets of objects (maybe empty), together with proteins between cells are exchanged. The computational power of such P systems is studied. Specifically, an efficient (uniform) solution to the SAT problem by using such P systems with cell division is presented. We also prove that any Turing computable set of numbers can be generated by a tissue P system with protein on cells. Both of these two results are obtained by such P systems with communication rules of length at most 4 (the length of a communication rule is the total number of objects and proteins involved in that rule).

8

On the Universality of Colored One-Catalyst P Systems

Wu T., Zhang Z., Paun G., Pan L.

Fundamenta Informaticae

|

2016

|

Vol. 144, nr 2

205--212

EN

A control strategy on the computations in a one-catalyst P system is provided: the rules are assumed “colored” and in each step only rules of the same “color” are used. Such control leads to Turing universality for one-catalyst P systems with one membrane. Turing universality is also reached for purely catalytic P systems with two catalysts, and for purely catalytic P systems with only one catalyst and cooperating rules working in the so-called terminal mode.

9

Reversible Spiking Neural P Systems with Astrocytes

Kong Y., Shi X., Xu J., Huang X.

Fundamenta Informaticae

|

2015

|

Vol. 136, nr 3

219--230

EN

Spiking neural P systems with astrocytes (SNPA systems, for short) are a class of distributed parallel computing devices inspired from the way neurons communicate by means of spikes. In this work, we investigate the reversibility in SNPA systems as well as the computational power of reversible SNPA systems. It is proved that reversible SNPA systems are universal, where the forgetting rules and the feature of delay in spiking rules are not used, and each neuron contains only one spiking rule. The result suggests that the astrocytes play a key role in the functioning of reversible SNPA systems.

10

An Algorithmic Approach to Tilings of Hyperbolic Spaces: Universality Results

Margenstern M.

Fundamenta Informaticae

|

2015

|

Vol. 138, nr 1/2

113--125

EN

In this paper, our results on algorithmic analysis of tiling in hyperbolic spaces are discussed. We overview results and developments obtained by the approach, focusing on the construction of universal cellular automata in hyperbolic spaces with a minimal number of cell states.

11

Historical overview of the importance of building materials in architecture

Mełges M.

Czasopismo Techniczne. Architektura

|

2015

|

Y. 112, iss. 9-A

203--209

EN

The title of the conference Defining architectural space – Games and play of architecture should be regarded as a kind of intellectual provocation, given that without a profound comment, these “games and play” should above all be understood as extremely costly ones. However, taking for granted the “game” motif (in the sense of artistic manipulation of the structure’s shape and detail embedded in space), the author has decided to raise the subject of the role that building and finishing materials play in the design concept and practice of the architect.

PL

Tytuł konferencji: Definiowanie przestrzeni architektonicznej – gry i zabawy architektury uznać trzeba, jak sądzę, za swego rodzaju prowokację intelektualną, zważywszy, że bez głębokiego skomentowania trzeba by je rozumieć jako „gry i zabawy” przede wszystkim niezmiernie kosztowne. Biorąc jednak za dobrą monetę motyw „gry” (w sensie artystyczno-plastycznej manipulacji kształtem budowli i detalem osadzonymi w przestrzeni), podjęłam temat roli, jaką w zamyśle projektowym i praktyce architekta pełnią materiały konstrukcyjno-budowlane i wykończeniowe.

12

A 6-state Universal Semi-totalistic Cellular Automaton on Kite and Dart Penrose Tilings

Imai K., Hatsuda T., Poupet V., Sato K.

Fundamenta Informaticae

|

2013

|

Vol. 126, nr 2-3

247--261

EN

In this paper we investigate certain properties of semi-totalistic cellular automata (CA) on the well known quasi-periodic kite and dart two dimensional tiling of the plane presented by Roger Penrose. We show that, despite the irregularity of the underlying grid, it is possible to devise a 6-state semi-totalistic CA capable of simulating any boolean circuit and any Turing machine on this aperiodic tiling.

13

The Computational Complexity of Universality Problems for Prefixes, Suffixes, Factors, and Subwords of Regular Languages

Rampersad N., Shallit J., Xu Z.

Fundamenta Informaticae

|

2012

|

Vol. 116, nr 1-4

223-236

EN

In this paper we consider the computational complexity of the following problems: given a DFA or NFA representing a regular language L over a finite alphabet Σ, is the set of all prefixes (resp., suffixes, factors, subwords) of all words of L equal to Σ*? In the case of testing universality for factors of languages, there is a connection to two classic problems: the synchronizing words problem of Černy, and Restivo's conjecture on the minimal uncompletable word.

14

Testing a scaling law for the earthquake recurrence time distributions

Marekova E.

Acta Geophysica

|

2012

|

Vol. 60, no. 3

858-873

EN

The earthquake recurrence time distribution in a given space-time window is being studied, using earthquake catalogues from different seismic regions (Southern California, Canada, and Central Asia). The quality of the available catalogues, taking into account the completeness of the magnitude, is examined. Based on the analysis of the catalogues, it was determined that the probability densities of the earthquake recurrence times can be described by a universal gamma distribution, in which the time is normalized with the mean rate of occurrence. The results show a deviation from the gamma distribution at the short interevent times, suggesting the existence of clustering. This holds from worldwide to local scales and for quite different tectonic environments.

15

Universality of Splicing Test Tube Systems with Two Tubes

Verlan S., Margenstern M.

Fundamenta Informaticae

|

2011

|

Vol. 110, nr 1-4

329-342

EN

Splicing test tube systems are one of the first distributed computing models based on splicing. The model introduces (test) tubes where the splicing operation is applied, which are arranged in a communication network with filters that permits to redistribute the words between the tubes at each step. We show that the computational completeness can be achieved with two tubes when the communication graph does not have self-loops. We also construct a universal splicing test tube system with 2 tubes having 23 rules.

16

Universality for Turing Machines, Inductive Turing Machines and Evolutionary Algorithms

Burgin M., Eberbach E.

Fundamenta Informaticae

|

2009

|

Vol. 91, nr 1

53-77

EN

The aim of this paper is the development of foundations for evolutionary computations. To achieve this goal, a mathematical model of evolutionary automata is introduced and studied. The main classes of evolutionary automata considered in this paper are evolutionary Turing machines and evolutionary inductive Turing machines. Various subclasses and modes of evolutionary computation are defined. Problems of existence of universal objects in these classes are explored. Relations between Turing machines, inductive Turing machines, evolutionary Turing machines, and evolutionary inductive Turing machines are investigated.

17

Skolem Machines

Fisher J., Bezem M.

Fundamenta Informaticae

|

2009

|

Vol. 91, nr 1

79-103

EN

The Skolem machine is a Turing-complete machine model where the instructions are first-order formulas of a specific form. We introduce Skolem machines and prove their logical correctness and completeness. Skolem machines compute queries for the Geolog language, a rich fragment of first-order logic. The concepts of Geolog trees and complete Geolog trees are defined, and these tree concepts are used to show logical correctness and completeness of Skolem machine computations. The universality of Skolem machine computations is demonstrated. Lastly, the paper outlines implementation design issues using an abstract machine model approach.

18

On the Computational Power of Querying the History

Lisitsa A., Potapov I.

Fundamenta Informaticae

|

2009

|

Vol. 91, nr 2

395-409

EN

Querying its own history is an important mechanism in the computations, especially those interacting with people or other computations such as transaction processing, electronic data interchange. John McCarthy in his Elephant programming language proposal suggested exploiting the referring to the past as the main programming primitive. In this paper we study the computational power of such primitive. In order to do that we propose a refined formal model, History Dependent Machine (HDM), which uses querying the history as its sole computational primitive. Our main result may be spelled in general terms as: a model with a single agent wandering around a pool of resources and having ability to check its own history for simple temporal properties has a universal computational power. Moreover, HDM can simulate any multicounter machine in real time. Then we show that the computations of HDM may be specified in the extension of propositional linear temporal logic by flexible constants, the abstraction operator and equality. We use then universality of HDM model to show that the above extension with a single flexible constant is not recursively axiomatizable.

19

Classes of Timed Automata and the Undecidability of Universality

Moura A.V., Pinto G.A.

Fundamenta Informaticae

|

2008

|

Vol. 82, nr 1-2

171-184

EN

Universality for deterministic Timed Büchi Automata (TBA) is PSPACE-complete but becomes highly undecidable when unrestricted nondeterminism is allowed. More precisely, universality for nondeterministic TBA is P11-hard and its precise position in the analytical hierarchy is still an open question. In this paper we introduce two types of syntactical restrictions to nondeterministic TBA, which are of independent interest, and show that their universality problem is P11-complete. These restrictions define, as we prove, proper subclasses of the class of timed languages defined by nondeterministic TBA. This suggests, as we argue, that no solution to that open question will come without surprise. We also establish closure properties and the relationships between the classes of languages we describe.

20

Remarks on the Critical Behavior of Second Order Additive Invariants in Elementary Cellular Automata

Fukś H.

Fundamenta Informaticae

|

2007

|

Vol. 78, nr 3

329-341

EN

We present results of some numerical investigations of second order additive invariants in elementary cellular automata rules. Fundamental diagrams of rules which possess additive invariants are either linear or exhibit singularities similar to singularities of rules with first-order invariant. Only rules which have exactly one invariants exhibit singularities. At the singularity, the current decays to its equilibrium value as a power law ta, and the value of the exponent a obtained from numerical simulations is very close to -1/2. This is in agreements with values previously reported for number-conserving rules, and leads to a conjecture that regardless of the order of the invariant, exponent a has a universal value of 1/2.