In resource-constrained mobile ad hoc network, geographical routing algorithms are relatively attractive routing algorithms. Due to the movement of nodes, energy exhaustion and the presence of obstacles, routing holes may occur. The existing routing algorithm only considers bypassing routing void through right-hand or left-hand criteria, and forwards data at the boundary of the hole. However, such a routing algorithm may lead to the expansion of the routing hole and even cause the paralysis of the network. This paper proposes a new greedy forwarding improvement routing method for mobile ad hoc network. In the greedy forwarding phase, the reliable communication area is calculated, and then the quality of the link is evaluated according to the relative displacement between the nodes and the maintenance time of the link. Then, according to the quality of the link, the distance between the candidate node and the destination node, and the number of the neighbor nodes, the metric value is obtained, and the node with the large metric value is selected as the next hop. When a routing hole occurs, the waiting forwarding mode is used for a period of time. After a period of time, when the current node is still a routing hole node, we can use the right-hand rule and the left-hand criteria, and the bypass mode is performed simultaneously. By considering three factors of the deflection angle and the maintenance time of the link and the remaining energy of the node, the forwarding node as the next hop with the highest priority value is selected in each direction. The experimental results show that compared with the existing GPSR,EMGR and EDGR, the proposed algorithm reduces the energy consumption of the network, improves the delivery rate of data packets, reduces the network delay and prolongs the network lifetime. INDEX TERMS Mobile ad hoc network, greedy forwarding, bypass mode, link quality, energy consumption.

No abstract

Note: This is the author's preprint version of the article (date: 17. 08. 2020). The final article is accepted for publication in the Journal of Memory and Language. Theories of grounded cognition postulate that concepts are grounded in sensorimotor experience. But how can that be for concepts like Atlantis for which we do not have that experience? We claim that such concepts obtain their sensorimotor grounding indirectly, via already-known concepts used to describe them. Participants learned novel words referring to up or down concepts (mende = enhanced head or mende = bionic foot). In a first experiment, participants then judged the sensibility of sentences implying up or down actions (e.g., "You scratch your bionic foot") by performing up or down hand movements. Reactions were faster when the hand movement matched the direction of the implied movement. In the second experiment, we observed the same congruency effect for sentences like, "You scratch your mende", whose implied direction depended entirely on the learning phase. This offers a perspective on how concepts learned without direct experience can nonetheless be grounded in sensorimotor experience.

No abstract

Pattern-based labeling methods have achieved promising results in alleviating the inevitable labeling noises of distantly supervised neural relation extraction. However, these methods require significant expert labor to write relation-specific patterns, which makes them too sophisticated to generalize quickly. To ease the labor-intensive workload of pattern writing and enable the quick generalization to new relation types, we propose a neural pattern diagnosis framework, DIAG-NRE, that can automatically summarize and refine highquality relational patterns from noise data with human experts in the loop. To demonstrate the effectiveness of DIAG-NRE, we apply it to two real-world datasets and present both significant and interpretable improvements over state-of-the-art methods. Source codes and data can be found at https://github. com/thunlp/DIAG-NRE.