Learn More
— This paper studies consensus problems of multiple second-order agents with time-varying topology. It is assumed that each possible interaction topology is strongly connected and balanced and each agent can only obtain the measurements of its position relative to its neighbors. A feasible protocol is proposed, and by applying the linear matrix inequality(More)
Comparing face images using the Hausdorff distance is one of the face matching and fast screening techniques. As a fast screening technique, the computational efficiency is a key issue. An efficient method for Hausdorff distance-based face matching and fast screening is proposed. The method utilises dominant points, instead of edge maps, as features for(More)
Checkpointing is one of the commonly used techniques to provide fault-tolerance in distributed systems so that the system can operate even if one or more components have failed. However, mobile computing systems are constrained by low bandwidth, mobility, lack of stable storage, frequent disconnections and limited battery life. Hence, checkpointing(More)
—This paper presents a sequential mode that can be used to improve the efficiency of iterative matching algorithm for CIOQ crossbar switches. The proposed matching algorithm is collectively called SIM-δ, and four different configuration are presented: restricted iteration, pipelined iteration, exhaustive transmission, and GSI (general state(More)