Emergency vehicle (EV) services save lives around the world. The necessary fast response of EVs requires minimising travel time. Preempting traffic signals can enable EVs to reach the desired location quickly. Most of the current research tries to decrease EV delays but neglects the resulting negative impacts of the preemption on other vehicles in the side roads. This paper proposes a dynamic preemption algorithm to control the traffic signal by adjusting some cycles to balance between the two critical goals: minimal delay for EVs with no stop, and a small additional delay to the vehicles on the side roads. This method is applicable to preempt traffic lights for EVs through an Intelligent Transportation System. A Matlab-Vissim Interface was implemented to simulate the intersection and apply the proposed algorithm. The results show a significant decrease in delays for both EVs and other traffic.
Future wireless networks will require advance physical-layer techniques to meet the requirements of Internet of Everything (IoE) applications and massive communication systems. To this end, a massive MIMO (m-MIMO) system is to date considered one of the key technologies for future wireless networks. This is due to the capability of m-MIMO to bring a significant improvement in the spectral efficiency and energy efficiency. However, designing an efficient downlink (DL) training sequence for fast channel state information (CSI) estimation, i.e., with limited coherence time, in a frequency division duplex (FDD) m-MIMO system when users exhibit different correlation patterns, i.e., span distinct channel covariance matrices, is to date ve
... Show MoreEvolutionary algorithms are better than heuristic algorithms at finding protein complexes in protein-protein interaction networks (PPINs). Many of these algorithms depend on their standard frameworks, which are based on topology. Further, many of these algorithms have been exclusively examined on networks with only reliable interaction data. The main objective of this paper is to extend the design of the canonical and topological-based evolutionary algorithms suggested in the literature to cope with noisy PPINs. The design of the evolutionary algorithm is extended based on the functional domain of the proteins rather than on the topological domain of the PPIN. The gene ontology annotation in each molecular function, biological proce
... Show MoreObjective(s): The aims of present study to findout the effect of aeromedical evacuation program on flight medics’ knowledge.
Methods: A pre-experimental design is carried in army aviation bases in Iraq, for the period of April 1st 2019 to October 25th 2019. Non-probability "purposive" sample of (30) flight medics are selected from army aviation bases. The questionnaire consisted of two main parts: the demographic characteristics of air paramedics, and the second part included five axes, which are (50) paragraphs related to the knowledge of air paramedics towards emergency injuries. The researcher used the statistical program version 20 to analyze the data, and the stability of the questionnaire was measured through the pre and post
In this paper, the using of Non-Homogenous Poisson Processes, with one of the scientific and practical means in the Operations Research had been carried out, which is the Queuing Theory, as those operations are affected by time in their conduct by one function which has a cyclic behavior, called the (Sinusoidal Function). (Mt / M / S) The model was chosen, and it is Single Queue Length with multiple service Channels, and using the estimating scales (QLs, HOL, HOLr) was carried out in considering the delay occurring to the customer before his entrance to the service, with the comparison of the best of them in the cases of the overload.
Through the experiments
... Show MoreSequence covering array (SCA) generation is an active research area in recent years. Unlike the sequence-less covering arrays (CA), the order of sequence varies in the test case generation process. This paper reviews the state-of-the-art of the SCA strategies, earlier works reported that finding a minimal size of a test suite is considered as an NP-Hard problem. In addition, most of the existing strategies for SCA generation have a high order of complexity due to the generation of all combinatorial interactions by adopting one-test-at-a-time fashion. Reducing the complexity by adopting one-parameter- at-a-time for SCA generation is a challenging process. In addition, this reduction facilitates the supporting for a higher strength of
... Show More