This paper studies the effect of path delay on SCTP performance. It focuses on the SCTP fast retransmit algorithm and demonstrates that the performance in the current retransmission strategy will degrade acutely when the secondary path delay is less than the primary path delay at a certain level. The performance degradation is due to the disordered SACKs and constant congestion window size duri...

This paper designs and analyzes the performance of a reliable communication scheme for the traffic control system built upon a wireless process control protocol, aiming at enhancing the robustness and timeliness of the safetycritical control applications. Focusing on the slot-based predictable access and the grid topology of urban area road networks, the proposed scheme establishes one primary ...

The FXLMS algorithm, which is extensively used in active noise control, exhibits frequency dependent convergence behavior. This leads to degraded performance for time-varying and multiple frequency signals. A new algorithm called the eigenvalue equalization filtered-x least mean squares (EE-FXLMS) has been developed to overcome this limitation without increasing the computational burden of the ...

Efficient path planning algorithms and decision-making control system are crucial issues for modern autonomous underwater vehicle (AUV) in complex underwater environment. In this paper, Fast Marching (FM) algorithm is used to extract cost optimal paths from complex and continuous environments, and meanwhile, we design a decision-making control system with reactive structure based on behavior. T...

Path searching algorithm is one of the main topics in studies on path planning. These algorithms are used to avoiding obstacles and find paths from starting point to target point. There are dynamic problems that must be addressed when these paths are applied in real environments. In order to be applicable in actual situations, the path must be a smooth path. A smooth path is a path that maintai...

A point-free formulation of the König Lemma for trees with uniformly at most one infinite path allows for a constructive proof without unique choice. 2000 Mathematics Subject Classification: 03E25, 03F65 (primary); 05C05, 05C38, 05C63 (secondary)

Path searching algorithm is one of the main topics in studies on path planning. These algorithms are used to avoiding obstacles and find paths from starting point to target point. There are dynamic problems that must be addressed when these paths are applied in real environments. In order to be applicable in actual situations, the path must be a smooth path. A smooth path is a path that maintai...