sadat2307/MSciNLI huggingface dataset:
Domain: Networks
Sentence 1: Having an SMS inter­face for requesting transfers, rather than something like a .xed schedule of data delivery, allows the users to choose when they want to go to internet kiosks without having to deal with stale data, and gives them the option of compar­ing multiple service providers before committing to buy a service.
Sentence 2: it is also important to make adoption by kiosks and other internet providers as simple as possible.
Relationship: contrasting
Domain: Networks
Sentence 1: We can see that disabling LSO resulted in a moderate performance decrease for LWEP: a 4% drop for end-to-end performance and a 10% drop for Tx perfor­mance.
Sentence 2: for Netperf TCP, it was much more sig­ni.cant: Bandwidth dropped from over 834 MB/s to 401 MB/s.
Relationship: contrasting
Domain: Networks
Sentence 1: Results obtained in November, 1999, showed a relatively small fraction (15%) of 700 popular Web sites using more than one server to serve content for their home pages [14].
Sentence 2: in August, 2000, we did a follow-up study of the home pages for 312 popular sites (not a strict subset of the previous set) and found that 63% of these sites used more than one server to serve the objects on the home page.
Relationship: contrasting
Domain: Networks
Sentence 1: However, a common assumption of the aforementioned worksisthatnodes arestatic andhaveat anyinstanceglobal knowledge of the network state.
Sentence 2: in the present paper multicostroutingisimplementedin afullydistributed fashion, andmobilityistakeninto accountbothintheimple­mentation of the algorithm and in the performance results taken.
Relationship: contrasting
Domain: Networks
Sentence 1: Note that the total storage of EBF is too large to possibly fit on chip, necessitating back and forth off-chip communication during lookups.
Sentence 2: the total storage space of Chisel is small enough to fit the entirely on-chip (with technologies such as embedded DRAM), and in fact is only twice as large as just the on-chip storage requirement of EBF.
Relationship: contrasting
Domain: Networks
Sentence 1: Table 3 shows results of a 3-class classi.cation combining own class, and could happily co-exist with bulk data.
Sentence 2: in 1000 950 900 850  packetsize (bytes) packetsize (bytes) 800 750 700 300 650 200 600 100 550 0 500 0 50 100 150 200 250 300 350 400 duration (seconds) duration (seconds) (a) LDA.
Relationship: contrasting
Domain: Networks
Sentence 1: Speci.cally, for two users with available channel sets Vi,Vj , [12] guarantees rendezvous in O(|Vi|2) (suppose |Vi|= |Vj |) time slots when each user has a distinct iden­ti.er and [7] guarantees rendezvous in O(|Vi||Vj | log log n) time slots.
Sentence 2: all these works are proposed for single­radio CRN setting, which means each user can only access 1 channel in each time slot.
Relationship: contrasting
Domain: Networks
Sentence 1: This kind of aggregation is typically accomplished by applying an associative and commutative operator to values supplied by group members.
Sentence 2: if the group is large, it is impractical for a single node to col­lect all the input and perform the computation; if the group members are anonymous, it is di.cult to impose a structure that would allow the result to be computed by the group in a distributed fashion.
Relationship: contrasting
Domain: Networks
Sentence 1: Composition Theorems Without Pre-Established Session Identi.ers Ralf Küsters University of Trier Trier, Germany kuesters@uni-trier.de ABSTRACT Canetti s universal composition theorem and the joint state com­position theorems by Canetti and Rabin are useful and widely em­ployed tools for the modular design and analysis of cryptographic protocols.
Sentence 2: these theorems assume that parties participat­ing in a protocol session have pre-established a unique session ID (SID).
Relationship: contrasting
Domain: Networks
Sentence 1: One possible solution would be to attach each sensor node to a surface buoy, by means of wires whose length can be reg­ulated to adjust the depth of each sensor node.
Sentence 2: although this solution enables easy and quick deployment of the sensor net­work, multiple .oating buoys may obstruct ships navigating on the surface, or they can be easily detected and deactivated by enemies in military settings.
Relationship: contrasting
Domain: Networks
Sentence 1: We hope that as a group, those trained will act together to supervise use and mitigate against use of the voice services by the TA at the exclusion of other com­munity members.
Sentence 2: we are very aware that although younger people in the community tend to be critical of the TA, they are also reserved in voicing critique and may be shy when visiting an elder s home.
Relationship: contrasting
Domain: Networks
Sentence 1: This node continues to check whether the route content field of RD-request includes its address; if so, the node discards this RD-request to avoid the infinite loop.
Sentence 2: if the address of this node is not included in the route content field of the RD-request, the node will then check whether the value of n is not smaller than three, or whether the timer, Tc, is timeout; if so, the node will discard this RD-request.
Relationship: contrasting
Domain: Networks
Sentence 1: recommend that MinChannelTime and MaxChannelTime can be set to 1ms and 10.24ms separately.
Sentence 2: using the same .xed MinChannelTime and MaxChannelTime for all channels is not suitable, because we canpredict the next available chan­nelsaccordingtotheformerscanor receiveneighboringAPs information from the current AP using inter-AP communi­cation.
Relationship: contrasting
Domain: Networks
Sentence 1: Three di.erent approaches are proposed in [11], two synchronous approaches focus either on TTR minimization or even distribution of the rendezvous points in terms of time and channels, and third approach being an asynchronous method.
Sentence 2: the last one is designed for systems with only two distinct RDV channels (randomly chosen from a set of channels), i.e., one selected based on minimal cyclic QS, second based on majority cyclic QS, and other/s selected randomly (for remaining slots that do not belong to any quorum set) from the list with other available channels.
Relationship: contrasting
Domain: Networks
Sentence 1: We de.ne the cost of communicating from u to v using radius R as cR(u, v)= R2 .
Sentence 2: (1) For example, the cost of sending a packet from u to v at a .xed transmission range R0 is ( R02 , if ||u - v|| = R0 cR0 (u, v)= (2) 8, o.w if the transmission range can be chosen anywhere in the range [0,Rmax], then the cost of sending the packet is ( ||u - v||2 , if ||u - v|| = Rmax cR(u, v)= (3) 8, o.w The cost function in (1) captures both energy and through­put related e.ciency.
Relationship: contrasting
Domain: Networks
Sentence 1: One way to handle such heterogeneous subcarrier quality is to use differ­ent modulation andPHY-layerFEC on each subcarrier(e.g., as in [24]).
Sentence 2: this may require mapping the symbols within a PHY FEC group onto the same subcarrier, since different subcar­riers may simply use different FEC codes.
Relationship: contrasting
Domain: Networks
Sentence 1: The small triangles/circles/lozenges alongthe curvesindicatethejumps ofthe CDF curves; hence they reveal furthermore that there is a signi.­cant number of various non-canonicalkeylengths,i.e.,keylengths that are neither apower of 2(e.g.,2,048) nor the sum of twopow­ers of2(e.g.,768).
Sentence 2: their shareis extremely small, as the CDFlinesdo notexhibit any signi.cant changes attheselocations.
Relationship: contrasting
Domain: Networks
Sentence 1: In the fourth experiment, we find that in the less-frequent-update scenarios (Fig 27, 28 and 30, 31), PCC still outperforms DynTTR considering the traffic overhead, whereas DynTTR is a little better considering the consistency.
Sentence 2: in the more-frequent-update scenarios (Fig 26, 6 and 28, 7), DynTTR outperforms PCC in both consistency and traffic overhead.
Relationship: contrasting
Domain: Networks
Sentence 1: For instance, source compression based on Slepian-Wolf coding has been studied in [13] and [14], motivated by the goal of reducing energy consumption in WSN by reducing the number of bits sent.
Sentence 2: in contrast, as shown below, the scheme C utilizes a simple trade off between the number of nodes in a CHCN and the amount of bits sent utilizing the division of responsibility across the nodes.
Relationship: contrasting
Domain: Networks
Sentence 1: We distinguish attacks due to excessive use, in which the adversary only acts as an ordinary participant, but can deplete the resources of honest principals by repeated execu­tion at lower cost.
Sentence 2: there are instances of malicious use where the adversary interferes with the pro­tocol, resulting in at least one message reception di.ering from normal use (more formally, we consider violation of in­jective agreement [14]).
Relationship: contrasting
Domain: Networks
Sentence 1: The CVSS (Common Vulnerability Scoring System) [1] is a tool to quantify the severity and risk of an individual vulnerability to an information asset in a computing environment.
Sentence 2: a software product usually contains multiple vulnerabilities, and CVSS could not be used directly to assess the security level or trustworthiness of a software product due to its design goal targeting individual vulnerabilities only.
Relationship: contrasting
Domain: Networks
Sentence 1: CELLULAR ASSISTED MOVEMENT DETECTION There is a straightforward way to implement our power-saving scan algorithm which requires location: first obtain the geographical location for mobile phone, and then calculate the distance of the locations.
Sentence 2: localization at meters granularity for both indoor and outdoor is not easy: existing GPS (Global Positioning System) only works at outdoor and it costs additional power to obtain location information continuously.
Relationship: contrasting
Domain: Networks
Sentence 1: Even if the switching time is not constant, as long as the pattern of the inter­ferenceispersistent(e.g., onedatapacket,followedby one ack), the MIMO node can monitor the medium and immediately switch every time the mediumgoesidle.
Sentence 2: if the receiver of the competing technology is not bidirectional, an 802.11n device has no way to compute its channel ratio, and hence cannot cancel its signal at the receiver of the competing technology.Theimpact of suchinterference willde­pend on the competing technology.
Relationship: contrasting
Domain: Networks
Sentence 1: When the intermediary-node is on the optimal path between both ends, the path stretch will be 1.0, but, most of the time it may not be the case, if we assume that the intermediary-node is in a fixed location while the end-nodes are free to move in a large scope.
Sentence 2: when the locations of intermediaries are not fixed, path stretch may be kept relatively low, with the cost of generating more mapping dynamics.
Relationship: contrasting
Domain: Networks
Sentence 1: It turns out that these two performance measures are two speci.c instances of a natural family of performance mea­sures (hence the complicated notation) with the most im­mediate interpretations and relevance.
Sentence 2: by them­selves, they reveal only a partial picture of DPF perfor­mance, and the other metrics serve to complement and pro­vide a more accurate evaluation.
Relationship: contrasting
Domain: Networks
Sentence 1: The current OM-NeT++ implementation distinguishes the di.erent bitrate applied at the PHY header and the MPDU, as de.ned in the IEEE 802.11 standard.
Sentence 2: only a single minimum SNR value is used, which can lead to di.erent BERs com­pared to evaluating all phases with di.erent SNRs.
Relationship: contrasting
Domain: Networks
Sentence 1: When a station holds its position at P1, the SFER remains almost zero in all subframe locations regardless of the employed MCS, because the channel quality between AP and the station is consider­ably good.
Sentence 2: when the station moves at an average speed of 1 m/s, MCS 4 and MCS 7 employing both ampli­tude and phase modulation (i.e., 16-QAM and 64-QAM, re­spectively) show higher SFER in the latter part of A-MPDU, while MCS 0 and MCS 2 which use only phase modulation (i.e., BPSK and QPSK, respectively) achieve stable SFER across the entire subframe locations.
Relationship: contrasting
Domain: Networks
Sentence 1: Real-Time Ethernet-based protocols (RTE), such as PROFINET, EtherCAT, Ethernet POW-ERLINK and TTEthernet, are emerging as the de facto communication technologies for NES, taking advantage of the appealing attributes of the underlying Ethernet technol­ogy.
Sentence 2: currently available RTE protocols do not em­ploy e.cient server-based scheduling policies, e.g., policies as those developed for CPU scheduling.
Relationship: contrasting
Domain: Networks
Sentence 1: Despite the rate control, at 80% load, the high initial .ow rates and aggressive retransmissions cause a ~4.3% packet drop rate in the fabric (excluding drops at the source NICs which do not waste bandwidth), almost all of which occur at the last hop (the destination s access link).
Sentence 2: at such high load, a small amount of wasted bandwidth can cause a disproportionate slowdown for the large .ows [4].
Relationship: contrasting
Domain: Networks
Sentence 1: Speci.cally, selfP uses periodic Hello messagestolearntheirimmediate(1-hop)neighborhood, andfrom thatdecide which nodes shouldforward a message.
Sentence 2: indominantP,the Hello messagesincludeinformationabout the 2-hop neighborhood (i.e., each node can learn who are the neighbors of its neighbors).
Relationship: contrasting
Domain: Networks
Sentence 1: In this case the value gxy is not even well-de.ned.
Sentence 2: since in this case we will have that the value X = g x was chosen by a real (and honest) player then the value Y x is well de.ned and it is this value that we actually refer to as the right gxy (conversely, when X is the value chosen by the attacker and Y = gy is chosen by the honest player then the real value of gxy refers to Xy).
Relationship: contrasting
Domain: Networks
Sentence 1: Underwater localization can be achieved by leveraging the low speed of sound in water, which permits accu­rate timing of signals, and pairwise node distance data can be used to perform 3D localization, similar to the 2D localization demon­strated in [16].
Sentence 2: low-complexity acoustic techniques to solve the underwater localization problem with limited energy ex­penditure in the presence of measurement errors need to be further investigated by the research community.
Relationship: contrasting
Domain: Networks
Sentence 1: Considering di.erent data packet delivery of the di.er­ent parts of the stream which may provide di.erent quality level, we introduce an important factor Wp to indicate the importance of data packet p. Our goal of minimizing the overall weighted latency is translated into minimizing the sum of weighted latency for all packets in the system: X Min DpNpWp (1) p.Packets in the system The most intuitive way of scheduling is to queue the data based on their received order, or in the reversed order to push out the latest information.
Sentence 2: when the connec­tion bandwidth could not satisfy the data rate temporarily because of congestion or .uctuation, data will be delayed at peers.
Relationship: contrasting
Domain: Networks
Sentence 1: If all sensors have ri = 0, the calculated out­put map can arbitrarily be translated, rotated, and .ipped without a.ecting its cost S. The purpose of the map is to show the relationships between sensors data, and as such, translation, rotation, and .ipping do not change the mean­ing of the map.
Sentence 2: if the user will view many maps in sequence over time, it would be confusing if each subsequent map was nearly identical but with arbitrary rotation.
Relationship: contrasting
Domain: Networks
Sentence 1: Second, .ltering of WRAP packets can be done with conventional wire-speed .lters (similar to TCP/UDP-level .lters).
Sentence 2: relaying or .ltering of traditional LSRR packets incurs the overhead of processing the variable-length IP op­tions .eld, which typically requires forwarding the packet to the router s CPU [3].
Relationship: contrasting
Domain: Networks
Sentence 1: From this table we can conclude that both properties (price subadditivity and 102 102103 104 105 104 106 the 95th-percentile billing) in.uence the total savings by a non-trivial amount.
Sentence 2: the exact break­down of the impact of these two properties on the total savings depends on the volume of the tra.c and other factors.
Relationship: contrasting
Domain: Networks
Sentence 1: Afterwards, the configuration of an IP address for intra-PAN communication, so-called PAN scope address, is performed; this approach guarantees stability with respect to IP connectivity within the PAN, since such IP address is maintained independently of potential changes in the PoA of the PAN.
Sentence 2: in order to acquire external access through the current PAN gateway, for IPv6 each device dynamically configures a global address; for IPv4, the PAN scope address can still be used as the PAN gateway performs NAT.
Relationship: contrasting
Domain: Networks
Sentence 1: If this recommendation was fol­lowed, MOAS conflicts would not occur, with the possible exception of a few unique cases discussed further in Sec­tion VI-D. Berkowitz[ 131 discussed the potential causes of Huston uses the term multiple-origin prefixes in place of our term MOAS conflicts 31 MOAS conflicts.
Sentence 2: the discussion is not complete and no implications of MOAS conflicts are analyzed.
Relationship: contrasting
Domain: Networks
Sentence 1: The increased delay can lead to a drop  66 x 10 x 10 3 3 0.025 0.025 2.5 0.02 0.02 2 0.015 0.015 1.5 0.01 0.01 1   Throughput (bits/second) Throughput (bits/second) 0.005 0.5 0.005 0 Figure 2: Slight decrease in throughput due to the rate anomaly problem.
Sentence 2: because the low data rate link transmits for a much longer dura­tion, the end-to-end delay is increased signi.cantly for both links.
Relationship: contrasting
Domain: Networks
Sentence 1: Using commodity WiFi hardware for non-WiFi RF device detection: Commercial spectrum analyzers or software radio platforms have specialized capability of providing raw signal samples for large chunks of spectrum (e.g., 80-100 MHz) at a .ne-grained sampling resolution in both time domain (O(105) to O(106) samples per second) and frequency domain (as low as 1 kHz bandwidth).
Sentence 2: commodity WiFi hardware, can provide similar information albeit at a much coarser granularity.
Relationship: contrasting
Domain: Networks
Sentence 1: On the other hand, the use of sector antennas mitigates this prob­lem yet still results in throughputs as low as 24% of the targeted value of the reference model due to inef.ciencies and signi.cant spatial bias introduced by TCP.
Sentence 2: simulations with the Inter-TAP Fairness Algorithm show that a multi-hop layer 2 algo­rithm can achieve near-perfect fairness and 76% and 71% of the total available capacity for CSMA and CSMA/CA respectively.
Relationship: contrasting
Domain: Networks
Sentence 1: Felice et al [6] evaluated various TCP versions such as TCP Reno, New Reno, Vegas and Sack in a cognitive multi-hop ad hoc network under varying PN workload, sensing duration and heterogeneity of channel bandwidth.
Sentence 2: they do not consider the impact of channel switching on TCP performance and ignore the impact of channel (re-)assignment on performance.
Relationship: contrasting
Domain: Networks
Sentence 1: Since the session is not present locally nor in cluster C1, MUSC-P is requested to send a SessRequest message, containing the SOBJ (which includes the QSPEC object of the session-flow), towards the source S1 with IP Alert enabled (since C1 is a multi-homed cluster, this message can exit through Q3MA-C or Q3MA-D.
Sentence 2: the interior routers forward the message to Q3MA-C.
Relationship: contrasting
Domain: Networks
Sentence 1: In contrast to the delay-security pairs in [4] that takes no statistical history into account, we adopt a pro.ling scheme based upon the usage history of the end hosts in order to obtain the QoS delay and security levels to be o.ered to U1.
Sentence 2: when U1 establishes a connection with U2 for the .rst time, it sends a UDP echo request to U2.As U2 receives this echo request, it sends a response packet back to U1.By com­puting the Round Trip Time (RTT) for this echo request­response operation, the average end-to-end delay between U1 and U2 can be estimated as follows: 1 .avg = · RT T (4) 2 .avg does not provide an accurate information about the individual end-to-end delays along the uplink and downlink directions of U1 and U2.
Relationship: contrasting
Domain: Networks
Sentence 1: When Procrastinator does not fetch unnecessary bytes from the network, it should reduce energy con­sumption by cellular radios since that depends on how much the radio is transferring and how long it is awake for.
Sentence 2: when Procrastinator delays the transfer of network objects, it can poten­tially increase energy consumption  the radio may have gone to sleep due to network inactivity and may need to spend energy wak­ing up, and now the radio may be up for longer than when network objects were batched under prefetching behavior.
Relationship: contrasting
Domain: Networks
Sentence 1: In 1-hop solutions [14, 9, 11, 12] nodes are at a distance of 1 from the clusterhead and the maximum diameter of clusters is 2.
Sentence 2: in k-hops so­lutions [15, 4] nodes can be located at a distance of k from the clusterhead and the maximum diameter of clusters is 2k.
Relationship: contrasting
Domain: Networks
Sentence 1: Poster: Reliable TCP for Popular Data in Socially-aware Ad-hoc Networks Hannan Bin Liaqat, Feng Xia, Qiuyuan Yang, Li Liu, Zhikui Chen, Tie Qiu School of Software, Dalian University of Technology, Dalian 116620, China f.xia@acm.org ABSTRACT Reliable social connectivity and transmission of data for popular nodes are vital in multihop Ad-hoc Social Networks (ASNETs).
Sentence 2: congestion may occur and hence pop­ular nodes might not achieve required bandwidth when mul­tiple senders share data with a single receiver.
Relationship: contrasting
Domain: Networks
Sentence 1: The communication overhead of the GMAC scheme can be written as the summation of the overhead due to the authenticity tag and the sanitization tags.
Sentence 2: according to Algorithm 1, the size of the authenticity tag can be written l nh+s as |t | = l- h. the sanitization ranl tags are vectors in an n-dimensional vector space over Fq.
Relationship: contrasting
Domain: Networks
Sentence 1: We are confident the corrected speed of light (s) is sufficient since the distance between roaming object and access points would be less than 500 meters at the longest.
Sentence 2: now assuming that: tdelay is the delay time in responding to a request; tpropagation is the time required for the signal to arrive to its destination (2 tpropagation will be required for single round-trip); Then; t - t round -trip delay range =× s 2 (22) since there is a small ranging error due to frequency bias in the oscillators used by both access point and roaming vehicle, we can estimate two sources of errors.
Relationship: contrasting
Domain: Networks
Sentence 1: Aggressively invoking fast dormancy for target transfers bene.ts Pandora by bringing signi.cant reduction of radio energy by up to 40% with signaling overhead of no more than 5%.
Sentence 2: fast dormancy is notapplicable to Dict because the costof achieving a saving of 5% of radio energyis thehigh signaling overhead of35%.
Relationship: contrasting
Domain: Networks
Sentence 1: GARP BRMM 11.545 BMMM 10.788 RDMM 5.273 RWMM 5.909 1.017 1.112 0.970 0.965 0.079 0.074 0.036 0.041 0.006 0.006 0.003 0.003 1.102 19.682 1.192 20.068 1.009 20.496 1.009 19.899 tra.c also consumes little bandwidth; even if the mesh client reassociates with a new AR every 2 seconds, the GARP traf­.c rate is 0.112 Kbps per CN.
Sentence 2: the GARP tra.c grows linearly with the number of the correspondent nodes; it is still quite small.
Relationship: contrasting