Zobrazeno 1 - 10
of 429
pro vyhledávání: '"Cămpeanu, A."'
Publikováno v:
Advances in Electrical and Computer Engineering, Vol 14, Iss 1, Pp 87-92 (2014)
Most published papers on low power asynchronous motors were aimed to achieve better operational performances in different operating conditions. The optimal design of the general-purpose motors requires searching and selecting an electric machine to
Externí odkaz:
https://doaj.org/article/2a762502a2d74e3997b5128c42a0214a
Publikováno v:
Advances in Electrical and Computer Engineering, Vol 12, Iss 1, Pp 97-102 (2012)
In the paper is shown that, by using the circuit theory which operates with lumped parameters, it is possible to derive mathematical models of a high power salient pole synchronous machine (SPSM), that can take into account the basic processes of the
Externí odkaz:
https://doaj.org/article/93e55a78a2b046099da768a9daa16f6d
Publikováno v:
In Theoretical Computer Science 12 November 2024 1016
Autor:
Mekis, N., Bianchi, T., Doyle, C., Gauchat, M., Geerling, I., Linneman, J., Staats, S., Campeanu, C.
Publikováno v:
In Radiography January 2024 30(1):359-366
Autor:
Sá dos Reis, C., De Labouchere, S., Campeanu, C., Ghotra, S.S., Flaction, L., Marmy, L., Vorlet, P., Al-Musibli, A., Franco, L., Champendal, M.
Publikováno v:
In Radiography January 2024 30(1):193-201
Autor:
Campeanu, Gabriel, Saadatmand, Mehrdad
Publikováno v:
Designs 2019, 3, 6
Component-based development is a software engineering paradigm that can facilitate the construction of embedded systems and tackle its complexities. The modern embedded systems have more and more demanding requirements. One way to cope with such vers
Externí odkaz:
http://arxiv.org/abs/1901.06524
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Given a regular language $L$, we study the language of words $\mathsf{D}(L)$, that distinguish between pairs of different left-quotients of $L$. We characterize this distinguishability operation, show that its iteration has always a fixed point, and
Externí odkaz:
http://arxiv.org/abs/1407.0160
Autor:
Câmpeanu, Cezar
Publikováno v:
EPTCS 151, 2014, pp. 162-173
The concept of Deterministic Finite Cover Automata (DFCA) was introduced at WIA '98, as a more compact representation than Deterministic Finite Automata (DFA) for finite languages. In some cases representing a finite language, Nondeterministic Finite
Externí odkaz:
http://arxiv.org/abs/1405.5601
Publikováno v:
Journal of Economic Issues, 2017 Sep 01. 51(3), 748-781.
Externí odkaz:
https://www.jstor.org/stable/26606516