Zobrazeno 1 - 10
of 33
pro vyhledávání: '"Hamed M. K. Alazemi"'
Publikováno v:
Applied Economics. 48:553-562
Although academic dishonesty has a long history in academia, its pervasiveness has recently reached an alarming level. Academic dishonesty not only undermines the purpose of education and the assessment process but also threatens the creditability of
Publikováno v:
IEEE Systems Journal. 9:775-784
The advance reservation (AR) of connections is becoming an increasingly important requirement for many emerging commercial bandwidth and scientific computing users. However, most studies in this area have focused on scheduling algorithm design and ha
Autor:
Hamed M. K. Alazemi, Anton Černý
Publikováno v:
Journal of Computer and System Sciences. 79:658-668
The Parikh matrix mapping is a morphism assigning to each word w over a k-letter alphabet a (k+1)i?(k+1) upper triangular matrix with entries expressing the number of occurrences in w of some specific subwords. To tackle the problem of ambiguity of t
Publikováno v:
IEEE Transactions on Intelligent Transportation Systems. 14:700-708
This paper proposes a novel bundle delivery scheme (BDS) aimed at achieving a delay-minimal bundle delivery in the context of an intermittent roadside network. The realization of this objective is challenging whenever network information is completel
Publikováno v:
Optical Switching and Networking. 10:119-131
This paper focuses on the survivable routing problem in WDM mesh networks where the objective is to minimize the total number of wavelengths used for establishing working and protection paths in the WDM networks. The past studies for survivable routi
Publikováno v:
IEEE Transactions on Communications. 61:1134-1143
The open literature encloses numerous studies on the efficiency of retransmission mechanisms used in typical data communication networks for the purpose of recovering from packet transmission errors or losses. This paper revolves around the design an
Publikováno v:
Wireless Networks. 19:1485-1496
We investigate the joint problem of power and subcarrier allocation with relay selection for a multi-user multi-relay cellular system with selective relaying. We first formulate the optimal problem using Boolean-convex optimization with the objective
Publikováno v:
Computer Communications. 35:1411-1421
The advance reservation of network connections is an area of growing interest and a range of service models and algorithms have been proposed to achieve various scheduling objectives, i.e., including optimization-based strategies and heuristic scheme
Publikováno v:
IEEE Transactions on Communications. 59:3102-3110
Network survivability is a key design issue for optical transport mesh networks. Various survivability schemes have been introduced among which p-cycle has (and continues) attracted quite a lot of attention because of its fast and efficient protectio
Publikováno v:
International Journal of Control, Automation and Systems. 9:237-248
This paper proposes an optimal recursive estimator to estimate the states of a stochastic discrete time linear dynamic system when the states of the system are constrained with inequality constraints. The case when the constraints are strictly satisf