Zobrazeno 1 - 10
of 388
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:
Dan Vlase, Gabriela Vlase, Gabriela Ursuţ, Paula Sfirloaga, Florin Manea, Mihaela Budiul, Andrei Rotaru, Titus Vlase
Publikováno v:
Ceramics International. 49:14941-14956
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c8a0f8bda67e05e31c2e9e1c7e4efdc0
https://doi.org/10.1016/j.ceramint.2022.12.120
https://doi.org/10.1016/j.ceramint.2022.12.120
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
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c2c330454a4b6c21c82f48723cbe293a
https://doi.org/10.1145/3571203
https://doi.org/10.1145/3571203
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
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::0a3144602367473a74f1701d509b42cd
https://doi.org/10.1016/j.tcs.2022.12.009
https://doi.org/10.1016/j.tcs.2022.12.009
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
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
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5ebef943c2f860f7b969351fd1bafe14
https://doi.org/10.1007/s10973-022-11262-2
https://doi.org/10.1007/s10973-022-11262-2
Publikováno v:
SGEM International Multidisciplinary Scientific GeoConference� EXPO Proceedings.
According to ANSYS - developer of the Multiphysics platform for computer simulations - the FSI (Fluid-Structure Interaction) model can be used in all cases where a fluid encounters a solid structure, for example, wind gusts rotating a turbine, air wa
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::30d5b275be47e1bf46d0b07e39c515ce
https://doi.org/10.5593/sgem2022/1.1/s06.072
https://doi.org/10.5593/sgem2022/1.1/s06.072
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
In this paper we provide an overview of a series of recent results regarding algorithms for searching for subsequences in words or for the analysis of the sets of subsequences occurring in a word.
Comment: This is a revised version of the paper
Comment: This is a revised version of the paper
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::0cd93a0e2663dc10a1b17fd17242d489
http://arxiv.org/abs/2208.14722
http://arxiv.org/abs/2208.14722
