Zobrazeno 1 - 10
of 90
pro vyhledávání: '"Khaled Day"'
Autor:
Khaled Day, Mohammad H. Al-Towaiq
Publikováno v:
Sultan Qaboos University Journal for Science, Vol 20, Iss 1, Pp 29-38 (2015)
Network-on-chip (NoC) multi-core architectures with a large number of processing elements are becoming a reality with the recent developments in technology. In these modern systems the processing elements are interconnected with regular NoC topologie
Externí odkaz:
https://doaj.org/article/3bb130eba69e4ab99110abfff56de768
Autor:
Mohammed Elhadi, Ahmed Al-Hosni, Khaled Day, Adbullah Al-Hamadani, Abdulrahman Al-Toqi, Nasser Al-Shamli, Ali Al-Hashmi
Publikováno v:
Sultan Qaboos University Journal for Science, Vol 12, Iss 2, Pp 101-120 (2007)
This paper is a review of Oman's major Health Information Systems (HISs) and their enabling technologies. The work assesses the scope, functionality, security, and interoperability of the used systems. The review aids in achieving the objectives of H
Externí odkaz:
https://doaj.org/article/9cd4cbbad8244efd8e52cd1e0fb26ccb
Autor:
Khaled Day, Abderezak Touzene
Publikováno v:
Sultan Qaboos University Journal for Science, Vol 10, Iss 0, Pp 63-75 (2005)
We obtain the conditional fault diameter of the k-ary n-cube interconnection network. It has been previously shown that under the condition of forbidden faulty sets (i.e. assuming each non-faulty node has at least one non-faulty neighbor), the k-ary
Externí odkaz:
https://doaj.org/article/16b025ebec91444c824739cb3635cce7
Autor:
Abderezak Touzene, Khaled Day
Publikováno v:
Sultan Qaboos University Journal for Science, Vol 10, Iss 0, Pp 51-62 (2005)
We obtain the conditional fault-diameter of the square torus interconnection network under the condition of forbidden faulty sets (i.e. assuming that each non-faulty processor has at least one non-faulty neighbor). We show that under this condition,
Externí odkaz:
https://doaj.org/article/cca4b4ad70f54c3b994e2281f18d20f2
Autor:
Khaled Day, Abdel Elah Al-Ayyoub
Publikováno v:
Sultan Qaboos University Journal for Science, Vol 3, Iss 0, Pp 41-45 (1997)
In this paper, a method for constructing node-disjoint (parallel) paths in k-ary n-cube interconnection networks is described. We start by showing in general how to construct parallel paths in any Cartesian product of two graphs based on known paths
Externí odkaz:
https://doaj.org/article/7bf016fb00114a9896a8c634fb6e0d0b
Publikováno v:
International journal of Computer Networks & Communications. 12:1-15
Publikováno v:
International Journal of Pervasive Computing and Communications. 16:279-306
Purpose Wireless sensor network (WSN) and mobile crowd sensing (MCS) technologies face some challenges, especially when deployed in a large environment such as a smart city environment. WSN faces network latency, packets delivery and limited lifetime
Publikováno v:
International journal of Computer Networks & Communications. 12:113-130
Underwater Wireless Sensor Networks (UWSNs) enable a variety of applications such as fish farming and water quality monitoring. One of the critical tasks in such networks is localization. Location information can be used in sensor networks for severa
Publikováno v:
International Journal of Cloud Applications and Computing. 10:36-55
Recently, much research has focused on the improvement of mobile app performance and their power optimization, by offloading computation from mobile devices to public cloud computing platforms. However, the scalability of these offloading services on
Publikováno v:
International journal of Computer Networks & Communications. 12:49-69
Recently, Mobile Crowd Sensing (MCS) has been used in many smart city monitoring applications, leveraging the latest smartphone features of sensing and networking. However, most of these applications use a direct internet connection for sending the c