X Huang, I Rubin - Ad Hoc Networks, 2008 - Elsevier
… The flowcontrol mechanism presented in this paper includes the following important new … to employ a flow admission control mechanism under which a newly generated flow is not …
XS Zheng, GW McConkie, Y Tai - … , Situation Awareness, and …, 2005 - taylorfrancis.com
… distance is coarsely represented, a driver is unlikely to detect that a vehicle ahead is slowing, based on a reduced distance … detected from continuous changes in flow fields. Finally, this …
J Cong, H Huang, W Jiang - 2010 Design, Automation & Test in …, 2010 - ieeexplore.ieee.org
… controlflow structure will result in a generalized edit distance larger than ldist, which means that further GED computation is not necessary. Experimental results show that on average …
J Xiao, B Zhang, F Luo - IEEE Access, 2019 - ieeexplore.ieee.org
… on AC-Flow are difficult to obtain now. Therefore, this paper uses DC-Flow model to obtain approximate boundaries in the first step and then calculate SDs based AC-Flow in the second …
ST Sheu, JS Wu, CH Huang, YC Cheng… - Journal of information …, 2007 - Citeseer
… distanceawareness system (DDAS) on the platform. The protocols performed between vehicles, the device driver of controlling the smart antenna and the direction/distance … control the …
… distances. In this scenario, a congestion … to control the channel load, while an awareness control protocol would seek to increase the transmission parameters of vehicles under free-flow …
… time and distance. The objective of this research is to create a Safety DistanceAwareness System … Figure 3.2 below shows the design flow of this research and figure 3.3 is the overall …
AA Alhaider, N Lau, PB Davenport, MK Morris - Ergonomics, 2020 - Taylor & Francis
… Situation Awareness (DSA) to characterise system-wide patient flow management and … patient flow management and identify deficiencies of the command and control centre of a …
X Zhang, X Dong, N Xiong, J Wu, X Li - Peer-to-Peer Networking and …, 2015 - Springer
… For convenience, we define the distance between two empty close sets A and B, as d ∞ (A, B) := sup|d A (x)−d B (x)|, where d A (x) := inf y ∈ A d(y, x) and d(⋅, ⋅) is the usual Euclidean …