Zobrazeno 1 - 10
of 69
pro vyhledávání: '"Hüsnü Yenigün"'
Autor:
Abdulkadir Uzun, Firas Abdul Ghani, Amir Mohsen Ahmadi Najafabadi, Hüsnü Yenigün, İbrahim Tekin
Publikováno v:
Sensors, Vol 21, Iss 13, p 4338 (2021)
In this paper, an indoor positioning system using Global Positioning System (GPS) signals in the 433 MHz Industrial Scientific Medical (ISM) band is proposed, and an experimental demonstration of how the proposed system operates under both line-of-si
Externí odkaz:
https://doaj.org/article/e408389cca6d47fcb1a0b2a0dc49b6f5
Publikováno v:
Information Sciences. 574:162-175
Synchronizing sequences for large-scale automata have gained popularity recently due to their practical use cases especially to have a faster and better testing process. In many applications, shorter sequences imply less overhead and faster processin
Publikováno v:
2020 IEEE International Symposium on Antennas and Propagation and North American Radio Science Meeting.
For indoor positioning using customary Global Navigation Satellite Systems (GNSS) receivers, the use of GNSS repeaters can be considered. However, regulations and provisions limit the use of GNSSrepeaters. In order to circumvent these limitations, we
An important concept in finite state machine based testing is synchronization which is used to initialize an implementation to a particular state. Usually, synchronizing sequences are used for this purpose and the length of the sequence used is impor
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::1cf48d02c1c9dfc241788aeb03a340cb
https://aperta.ulakbim.gov.tr/record/8337
https://aperta.ulakbim.gov.tr/record/8337
Publikováno v:
Труды Института системного программирования РАН, Vol 30, Iss 1, Pp 7-24 (2018)
State identification is a long standing problem in the area of Finite State Machine (FSM) based modeling and testing of discrete event systems. For the identification of the current state of the system, so-called homing and synchronizing experiments
Publikováno v:
Software Quality Journal
Software Quality Journal, Springer Verlag, 2019, 27 (2), pp.497-499. ⟨10.1007/s11219-019-09447-4⟩
Software Quality Journal, Springer Verlag, 2019, 27 (2), pp.497-499. ⟨10.1007/s11219-019-09447-4⟩
International audience; Testing is one of the most frequently used techniques in practice to assure the quality and the reliability of software systems. It is used not only during the development of such systems but also during their operation. Over
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::7ebdcece28115b3914aa585893cd6494
https://hal.archives-ouvertes.fr/hal-02481420
https://hal.archives-ouvertes.fr/hal-02481420
Autor:
Kamer Kaya, Poyraz Kıvanç Karaçam, Emre Yasin Sivri, Barış Sevilmiş, Hüsnü Yenigün, Berk Çirişci
Publikováno v:
Communications in Computer and Information Science ISBN: 9783030110291
MODELSWARD (Revised Selected Papers)
MODELSWARD (Revised Selected Papers)
Since the problem of finding a shortest synchronizing sequence for an automaton is known to be NP-hard, heuristics algorithms are used to find synchronizing sequences. There are several heuristic algorithms in the literature for this purpose. However
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::486ba5ee9c9b1ab863cee316f936a5ba
Publikováno v:
MODELSWARD
Computing a shortest synchronizing sequence of an automaton is an NP-Hard problem. There are well-known heuristics to find short synchronizing sequences. Finding a shortest homing sequence is also an NP-Hard problem. Unlike existing heuristics to fin
Publikováno v:
Expert Systems with Applications. 167:114203
For automata, synchronization, the problem of bringing an automaton to a particular state regardless of its initial state, is important. It has several applications in practice and is related to a fifty-year-old conjecture on the length of the shorte
Publikováno v:
MODELSWARD
The problem of finding a synchronizing sequence for an automaton is an interesting problem studied widely in the literature. Finding a shortest synchronizing sequence is an NP-Hard problem. Therefore, there are heuristics to find short synchronizing
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::41368797989b668c8f213f771490ac1f