Zobrazeno 1 - 10
of 132
pro vyhledávání: '"Florin Manea"'
Autor:
Adrian Bogdan Simon Marinica, George Artur Gaman, Daniel Pupazan, Emilian Ghicioi, Florin Manea, Marius Cornel Suvar, Maria Prodan, Niculina Sonia Suvar, Gheorghe Daniel Florea, Robert Laszlo
Publikováno v:
Automation, Vol 5, Iss 3, Pp 246-258 (2024)
In the present paper, the use of programmable microprocessors to develop a computerized stand for the preparation of a mixture of flammable/toxic/explosive gases in order to obtain mixtures at concentrations in explosive range is presented. The opera
Externí odkaz:
https://doaj.org/article/422a848341344fff8644ed9f83f1d069
Autor:
Florin Manea, Emilian Ghicioi, Marius Cornel Suvar, Maria Prodan, Nicolae Ioan Vlasin, Niculina Sonia Suvar, Titus Vlase
Publikováno v:
Fire, Vol 5, Iss 6, p 198 (2022)
On the evening of 5 April 2014, at a building located on 122 Tomis Boulevard, Constanta Municipality, Constanta County, Romania, a restaurant with its kitchen on the ground floor and a lounge bar located on the first floor experienced a fire, one tha
Externí odkaz:
https://doaj.org/article/044de00a03dc48d5b9a042ce1023f4cf
Autor:
Florin Manea
Publikováno v:
Axioms, Vol 10, Iss 4, p 304 (2021)
In this paper we propose and analyse from the computational complexity point of view several new variants of nondeterministic Turing machines. In the first such variant, a machine accepts a given input word if and only if one of its shortest possible
Externí odkaz:
https://doaj.org/article/bfa987aff43b42e08b17bf4a5274f988
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, Vol Vol. 19 no. 4, FCT '15, Iss special issue FCT'15 (2017)
A gapped repeat (respectively, palindrome) occurring in a word $w$ is a factor $uvu$ (respectively, $u^Rvu$) of $w$. In such a repeat (palindrome) $u$ is called the arm of the repeat (respectively, palindrome), while $v$ is called the gap. We show ho
Externí odkaz:
https://doaj.org/article/b7cfb9a7dac348a990ae95638cc2fb7f
Accepting Hybrid Networks of Evolutionary Processors with Special Topologies and Small Communication
Autor:
Jürgen Dassow, Florin Manea
Publikováno v:
Electronic Proceedings in Theoretical Computer Science, Vol 31, Iss Proc. DCFS 2010, Pp 68-77 (2010)
Starting from the fact that complete Accepting Hybrid Networks of Evolutionary Processors allow much communication between the nodes and are far from network structures used in practice, we propose in this paper three network topologies that restrict
Externí odkaz:
https://doaj.org/article/0bf009a4a7db4946b112c7a3bf5a8a90
Publikováno v:
Electronic Proceedings in Theoretical Computer Science, Vol 3, Iss Proc. DCFS 2009, Pp 173-182 (2009)
In this paper, we present some results regarding the size complexity of Accepting Networks of Evolutionary Processors with Filtered Connections (ANEPFCs). We show that there are universal ANEPFCs of size 10, by devising a method for simulating 2-Tag
Externí odkaz:
https://doaj.org/article/572a01218324496a9b734fcb5ebadbc2
Autor:
Dan Vlase, Gabriela Vlase, Gabriela Ursuţ, Paula Sfirloaga, Florin Manea, Mihaela Budiul, Andrei Rotaru, Titus Vlase
Publikováno v:
Ceramics International. 49:14941-14956
Publikováno v:
Proceedings of the ACM on Programming Languages. 7:278-308
We investigate properties of strings which are expressible by canonical types of string constraints. Specifically, we consider a landscape of 20 logical theories, whose syntax is built around combinations of four common elements of string constraints
Autor:
Murphy Berzish, Joel D. Day, Vijay Ganesh, Mitja Kulczynski, Florin Manea, Federico Mora, Dirk Nowotka
Publikováno v:
Theoretical Computer Science. 943:50-72
Autor:
Gabriela Vlase, Dan Vlase, Iosif Vasile Ferencz, Paula Sfîrloagă, Dorel Micle, Florin Manea, Titus Vlase
Publikováno v:
Journal of Thermal Analysis and Calorimetry. 147:5365-5376