node pairs
Node connectivity index as mobility metric for GA based QoS routing in MANET
... the node connectivity time in ...higher node connectivity ...the node mobility model and extract a suitable node connectivity ...estimate node connectivity time for a given velocity and ...
8
Identification of rotational failure mechanisms in cohesive media using discontinuity layout optimization
... However, it is evident from Fig. 5 that although the form of the mechanism identified is similar to that proposed by Martin (2011), the funnel-shaped SLF that meets the ground surface is not reproduced well. To obtain an ...
16
Efficient and Expressive Knowledge Base Completion Using Subgraph Feature Extraction
... to node pairs, and the columns correspond to the path types found in the first ...target node of a node pair, given that a random walk began at the source node and was constrained to ...
11
Radio Coverage Mapping in Wireless Sensor Networks
... Motivated by the problems mentioned above, this paper presents NRC-Map algorithm to estimate the radio coverage of a sensor node by its neighbor nodes. Firstly, we collect the RSSI data of the all node ...
8
Study on Trusting Relationship in Complex Network
... Abstract—In order to find the information dissemination rules in the social network, trusting relationship is proposed from a view of the influences of the members in a complex network. The basic metric, trusting value ...
8
Robust Analysis of Freight Comprehensive Transportation Networks
... Delivery. The influence of uncertainties on FCTNs may lead to the variation of goods in transit. The greater the influence, the greater the reduction in the amount of freight between nodes. Thus the indicator of delivery ...
7
IMNTV-Identifying Malicious Nodes using Trust Value in Wireless Sensor Networks
... each node. During packet transmission each node adds a packet sequence number and encrypts the packet using unique secret ...Child node notice the parent node for packet successful and ...
14
Unsupervised Semantic Abstractive Summarization
... In this work, we propose an alternative method to use AMRs for abstractive summarization. Our approach is inspired by the way humans summa- rize any piece of text. User studies Chin et al. (2009); Kang et al. (2011) have ...
10
A Look inside the Distributionally Similar Terms
... synonymic pairs, s* as the union of s, a, n, v, e, f, and m, makes ...classes, pairs in “other” relation and “unrelated” pairs, which make ...
10
New Language Pairs in TectoMT
... Other improvements to support adding new lan- guage pairs quickly are rather technical. We au- tomated the translation model training in a set of makefiles. To train a new translation pair, one only needs to ...
7
Annotating omission in statement pairs
... In this piece of industrial application, we focus on the identification of omission in statement pairs for an online news platform. We compare three annota- tion schemes, namely two crowdsourcing schemes and an ...
5
QUANTUM CRYPTOGRAPHY WITH PHOTON PAIRS
... An advantage of this set-up is that coding in the time basis is particularly stable. In addition, the coherence length of the pump laser is not critical anymore. It is however necessary to use relatively short pulses (≈ ...
6
Insights from unifying modern approximations to infections on networks
... assumption, pairs with a single indexing degree are the main variables, which significantly reduces the number of independent ODEs needed in the pairwise equations to 10M for SIR ...
9
Identifying dynamical modules from genetic regulatory systems: applications to the segment polarity network
... in node states, we can assess how robust each sub- system is to changes in the model itself (such as changes in Boolean functions or the addition of new compo- ...
27
The all or nothing flow problem in directed graphs with symmetric demand pairs
... An important motivation for studying routing problems in directed graphs with symmetric demand pairs stems from their connections to directed treewidth. Johnson, Robertson, Seymour, and Thomas [21] introduced the ...
27
SRDD AD-Secured Routing Data Delivery by anonymous detection in wireless sensor networks
... adjacent node. The address of the adjacent node is used as the bait destination address, baiting malicious nodes to send RREP reply messages and identifies the malicious nodes by using the reverse tracing ...
5
A Low Power Low Phase Noise LC Voltage-Controlled Oscillator
... Low power consumption VCO using the adaptive body-biasing technique in 0.18 µm CMOS technology is presented. The adaptive body bias technique increases the oscillation amplitude and decreases the power consumption. The ...
9
Improved Force Directed Layout Algorithm for Social Network Visualization
... Social network belongs to the complex network. Aiming at the problem that traditional graph layout cannot effectively show the community structure of the network, Literature [4] firstly divided the network nodes into ...
6
The all or nothing flow problem in directed graphs with symmetric demand pairs
... The decomposition has two main components. The first step is a weaker decomposition in which we take a fractional solution to a natural multicommodity flow based LP (described in Section 3.3) and use it to decompose the ...
27
Online Algorithms for Adaptive Optimization in Heterogeneous Delay Tolerant Networks
... There can be multiple source-destination pairs, but we assume that at a given time there is a single message, generated by a tagged source node. The message may eventually have many copies spread in the ...
14