sadat2307/MSciNLI huggingface dataset:
Domain: Networks
Sentence 1: These included (i) devices like microwaves that are activated for short durations and (ii) device instances with low signal strengths (.-75 dBm) that appeared intermittently at the locations where the signal analyzer was placed.
Sentence 2: for 25% of the cases, the devices were active for more than 5 minutes and in some traces, devices like game controllers (e.g., Xbox) were active for durations of up to 1.8 hours.
Relationship: contrasting
Domain: Networks
Sentence 1: TR also distributes the large number of packets to 11b, but distributes the larger num­ber of packets than RR to 11a and 16, which of packet loss probability is much lower than 11b, i.e., the TCP retrans­missions in TR is caused mainly by out-of-order packets and it reduces the upward trend of TCP retransmissions in com­parison with SL and TR.
Sentence 2: the TCP re­transmissions of the proposal is low stable in comparison with the others.
Relationship: contrasting
Domain: Networks
Sentence 1: One of the few standard­ized, cross-platform interfaces to transport-and network-layer in­formation is through the Simple Network Management Protocol (SNMP) [16], which allows applications to access standardized sets of information about network-and transport-layer information, such as TCP statistics [7].
Sentence 2: sNMP is not typically avail­able on most hosts, and requiring its use for applications to acquire information about their own transport connections is an extremely cumbersome solution.
Relationship: contrasting
Domain: Networks
Sentence 1: Without any additional bandwidth, a targeted BER of was achieved by the proposed system at approximately 7.35 and 3.9 dB for full and single user load, respectively.
Sentence 2: an equivalent system using MMSE equalization achieved that targeted error rate at higher power demands of 8.7 and 5.17 dB for full and single user load, respectively.
Relationship: contrasting
Domain: Networks
Sentence 1: For example, when there is a single background traffic source, , that is generated with a packet size of 1400B , the video client fails at time 1310sec which corresponds to a traffic load of 2.2Mbps.
Sentence 2: for the same number of background traffic sources but using a packet size of 512B , the video client fails at 860sec and corresponds to a background traffic load of 1.45Mbps.
Relationship: contrasting
Domain: Networks
Sentence 1: In the .rst and third condition, since the collision probability is independent of the sampling rate, it remains a constant value that equals 0.22 and 0.68 when the sampling rate ranges between 0.92 and 0.94Mbps and 0.51 and 0.78Mbps, respectively.
Sentence 2: in the sec­ond and fourth conditions where the sampling rate ranges between 0.78 and 0.9Mbps; and 0 and 0.5Mbps, the colli­sion probability behaves as a curve instead of a straight line parallel to the rate axis.
Relationship: contrasting
Domain: Networks
Sentence 1: In addition to ex­tending the range that can be covered by using multiple hops, mesh networks provide the opportunity of using alter­native routes, thus increasing resilience to radio environment changes.
Sentence 2: mesh networks are expensive in terms of energy consumption due to a higher overhead at each node for additional activities, namely relaying messages for other nodes and, in systems with distributed planning, calculating new routes.
Relationship: contrasting
Domain: Networks
Sentence 1: As depicted in Figure 4, at arrival rate of 1 job/s and packet size of 500 Bytes, the average buffer size required is about 100 and 200 Bytes using the proposed handoff with i-ARD method and FMIPv6, respectively.
Sentence 2: the buffer size increases dramatically with FMIPv6 method by increase of arrival rate, while the buffer size in the proposed method merely reaches 2 packets (1000 Bytes) at the rate of 25 job/s.
Relationship: contrasting
Domain: Networks
Sentence 1: This increases search times only slightly (less than 0.5ms per metadata structure scanned) because it takes longer to read it from Flash, so we do not consider it to be an issue with this implementation.
Sentence 2: in a di.erent implementation in which the meta­data needs to be transmitted to allow other nodes to search the data, there would be an energy penalty associated with larger metadata structures.
Relationship: contrasting
Domain: Networks
Sentence 1: If, however, the stations are not uniformly dis­tributed, it is still the case that stations in the smallest ball with sum of probabilities at least C1 could receive many message after prob­abilities pv are scaled up to cepv.
Sentence 2: the situation in a (very) sparse e-ball B is as follows (by sparse e-ball we mean a ball with sum of probabilities much smaller than the average): The probability that v .
Relationship: contrasting
Domain: Networks
Sentence 1: Because tokens are encrypted, we can assume malicious peers cannotfake tokens, and tokens can  2500 1 0.7 0.6 2000 0.8 0.5 1500 0.6 0.4   Number of peers 0.3 1000 0.4 0.2 500 0.2 0.1 0 0 0 Time uploading bandwidth (kbps) uploading ratio (%) Figure 3: Population of peers viewing Figure 4: average fi,p for peers with Figure 5: average fi,p for peers with streaming data in the PPLive systemdifferent uploading bandwidthdifferent uploading ratio parameter default value k 10 n 10 d 500kb ti,p 10min Max(f) 1 Def(f) 0.3 Min(f) 0.1 Table 2: Default values of parameters peersdownloadadvertisements,they arekeptinthe local cache.If the amount of downloaded advertisement is more than the amount of advertisement a peer has to view, some downloaded advertise­ments would not be displayed.
Sentence 2: if the amount of downloaded advertisement is less than the amount of advertise­ment a peer has to view, some downloaded advertisements would be repeated.
Relationship: contrasting
Domain: Networks
Sentence 1: The existing Internet architecture has been very suc­cessful in providing end-to-end connectivity using high­speed routers that provide a bare minimum of func­tionality to move packets from one node to another [8].
Sentence 2: this architecture shows shortcomings in the context of emerging technologies: sensor networks can­not communicate using standard Internet abstractions due to their inherent processing and power limitations, security protocols (e.g., to protect from DoS attacks) are di.cult to deploy inside the network, new network­ing concepts that deviate from client-server paradigms Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for pro.t or commercial advantage and that copies bear this notice and the full citation on the .rst page.
Relationship: contrasting
Domain: Networks
Sentence 1: For the cases considered, laser chirps of 125 and 150 MHz/mA can be tolerated, for 3.86 MHz and 10 MHz electrical filters, respectively.
Sentence 2: it can be noticed that an increase of ~3× in the bandwidth of the filter only results in a maximum CER increase of ~20%, showing also the dependence on the coding used.
Relationship: contrasting
Domain: Networks
Sentence 1: In the original set of DHT proposals, some algorithms made this choice of neighbors purely deterministic (i.e., given the set of identi.ers in the system, the neighbor tables were completely determined), and others allowed some freedom to choose neighbors based on other criteria in addition to the identi.ers; most notably, proximity (i.e., latencies) have been used to select neighbors.
Sentence 2: the question is not whether the initial proposal included this feature, but whether the basic routing geometry precludes it.
Relationship: contrasting
Domain: Networks
Sentence 1: =1, which means PS = PR = 21 Ptot, shows a performance degra­dation compared to the dual-RX antenna system while the DF cooperative diversity system with PS = PR = Ptot shows a performance improvement over the entire range of co-channel reuse factor, D/R.
Sentence 2: the total power of the latter system is double that of the dual-RX antenna sys­tem.
Relationship: contrasting
Domain: Networks
Sentence 1: In these cases PacketOPP can take advantage of multiple forwarding nodes and more oppor­tunities to use long links providing throughput gains of a factor of two or more.
Sentence 2: due to its self­adaptive characteristics, Hybrid protocol is able to select the routing option most suitable for both particularly dis­advantaged .ows and .ows with the highest throughputs.
Relationship: contrasting
Domain: Networks
Sentence 1: 10000 e ¢ i / sooo c~ eooo N E 4OOO d d~ 2000 ,jw .... -.i .......... ::-: ............ ; ............ ;-: .......... ;-......... ; .... 10 20 30 40 50 60 Picture (c) Cellular connectivity - CDPD Figure 8: Energy consumed by digital camera using Rangelan 2 and CDPD network 80  A number of systems [13, 31, 32, 33] have used transcoding to fit images to the current operating environment.
Sentence 2: there has been little formal work in conducting a systematic study to mea- sure the information loss associated with a given transcoding, so previous systems performed ad hoe transcoding without an explicit understanding of the tradeoffs and potential gains.
Relationship: contrasting
Domain: Networks
Sentence 1: To solve the problem of learning from dis­ (a) d on energy (LP=2) (b) d on accuracy (LP=2) tributed data sets, people have designed methods that can 35 80 learn multiple classi.ers from local data sets in a distributed  1 1/2 1/3 1/4 1/2 1/3 1/4 25 environment and then combine local classi.ers into a global model [32, 33, 34].
Sentence 2: these methods still focus on Energy (Joule) Accuracy 20 15 learning from a training set with suf.cient labeled examples.
Relationship: contrasting
Domain: Networks
Sentence 1: Speci.cally we used the inexpensive os­cillators[21]that comestandard withtheUniversalSoftware Radio Peripherals (USRP); these have frequency o.sets on the order of ±10 parts per million.
Sentence 2: high qual­ity ovenized oscillators with frequency tolerance of around 20 parts per billion are now available [25] for around 400 dollars.
Relationship: contrasting
Domain: Networks
Sentence 1: By looking at (1) we .nd that when the bu.er length q(t) matches the target bu.er length qT (t), the throttle per­centage T (t) is equal to 100% and r(t) matches l(t).
Sentence 2: when the error qT (t) - q(t) increases, T (t) increases accordingly in order to allow r(t) to increase so that the bu.er can be .lled quickly.
Relationship: contrasting
Domain: Networks
Sentence 1: Finally, it is essential for users to be proactive, such as turning the device to non-discoverable mode in unknown areas and only 'pair' with know devices.
Sentence 2: this does not assist with the vulnerability of WPANs to DOS attacks, which could render the network unusable for a period of time although use of scatternets can assisting in defeating DOS attacks.
Relationship: contrasting
Domain: Networks
Sentence 1: results depicted in Figures 5 and 6 clearly show that the context­based opportunistic proposal can closely follow the energy consumption levels obtained with the optimum configuration and the Full Knowledge technique, independently of the location of the source node.
Sentence 2: the energy consumption levels of opportunistic MCN-MR communications increase if the MR is not adequately selected ( MR close BS and MR close SN schemes).
Relationship: contrasting
Domain: Networks
Sentence 1: Note that when the two-lobe beam pattern is formed, due to the power split across the lobes (explained in Section 3), the RSSI of the weaker client A falls by 3 dB, resulting in a maximum rate of 2 Mbps.
Sentence 2: in topology 2, the optimal schedule consists of two transmissions, one to clients A and C using a two­lobe beam pattern at 2 Mbps, and the other to clients B and D using another two-lobe beam pattern at 11 Mbps rate.
Relationship: contrasting
Domain: Networks
Sentence 1: KKT conditions suggest that based on complimentary slackness property for strong duality, we have .1 (ki * Ei + xi * (Ei - a)) = 0, (15) .2 (ni - ki * + xi * )=0, (16) where ki * and x * i are the optimal transmitted amount of data and parity symbols.
Sentence 2: with the channel is in state Si, and maximum network utilization of ni symbols, the amount of transmitted data symbols is bounded above by ki = |Ci|Ri = ki * , where Ri is a channel coding rate.
Relationship: contrasting
Domain: Networks
Sentence 1: 5.3 Traf.c Analysis Inthissection,wepresentinitialresultsofastatisticalanal­ysisofthetrafcdemands.Wefocuson:(i)statistical characteristicsofinboundandoutboundtrafc,atdiferent levelsofaggregation(point-to-multipointdemands,orcor­respondingpoint-to-pointloadsonedgerouters),(ii)time­of-dayvariations,and(iii)variationsatcoincidingtimein­tervalswithinthetwoweeks.
Sentence 2: anetworkwithmanyaccessandpeeringlinkshasalarge numberofpoint-to-multipointdemands.avery smallproportionofthesedemandscontributethemajor­ityofthetrafc.InFigure6,werankpoint-to-multipoint demands(orpoint-to-pointloads)fromlargesttosmallest, andplotthepercentageofthetotaltrafcattributableto each.Theseplotsarerestrictedtotheuppertailofthedis­tribution,accountingfor80%ofthetotaltrafc.Werefer totheparticulardemands(orloads)inthisuppertailasthe heavyhitters.Wefoundtheplotstobenearlylinearonthe log-logscale,asischaracteristicofaZipf-likedistribution, wherethecontributionofthek-thmostpopularitemvaries as1/ka ,forsomea.Wefoundthisgeneralpatterntohold foralldatasetsandatalllevelsoftemporalandspatialag­gregation.Figure6(b)showsgreaterconcentrationoftrafc overfewerheavyhittersinoutboundversusinboundtrafc.
Relationship: contrasting
Domain: Networks
Sentence 1: From line 13 of the subroutine, on one hand, if the difference of the power scaling factors between different length classes is the same, because we have introduced the processing gain m as the denominator in the base, the deleted links must be fewer than its counterpart in NPAN.
Sentence 2: since (dik 1) / (/ log(3 nßm) 1 1) / + a ) n / -+ a 2n /a (3nß/ m) =(3nß/ m = , and since (d 1) / a (/ log( 4 ßn) 1 1) / -+ a a (4nß) ik + =(4nß) n = 2n / , the deleted links must be at most equal to its counterpart in NPAN.
Relationship: contrasting
Domain: Networks
Sentence 1: 1 Sieving DSTADDR 0.061 0.047 0.032 0.011 SRCADDR 0.064 0.049 0.033 0.012 DSTPORT 0.077 0.067 0.037 0.016 SRCPORT 0.076 0.060 0.037 0.017 Table 2: Trace 3: Mean relative error in S estimate Distribution Sample Sample&#38;Hold Algo.
Sentence 2: 1 Sieving DSTADDR 0.198 0.192 0.013 0.013 SRCADDR 0.054 0.049 0.017 0.004 DSTPORT 0.116 0.109 0.016 0.015 SRCPORT 0.069 0.062 0.016 0.005  6.2 Error in estimating entropy Recall from our discussion in Section 2, that it may be the case an accurate estimation of S does not necessarily translate into an accurate estimate of H. we .nd from our evaluations that the streaming algorithms can yield very accurate estimates of H as well.
Relationship: contrasting
Domain: Networks
Sentence 1: At .rst, it may appear that a large share of the DSRC (6out of 7 channels) is available for non-safety communica­tions.
Sentence 2: continuous non-safety communication on a SCH would be possible only if all DSRC devices were capa­ble of simultaneously monitoring the CCH while exchang­ing non-safety data on SCH.
Relationship: contrasting
Domain: Networks
Sentence 1: As discussed in the RCS [9], the ACCT cannot be greater than RCCT because there is no bu.er in the cell.
Sentence 2: in the current network scheme, we make the following two observations: (1) the ACCT can be greater than the RCCT and (2) the call may be incomplete even if the ACCT is greater than the RCCT.
Relationship: contrasting
Domain: Networks
Sentence 1: In fact Ptolemy and El Greco provide a more sophisticated hierarchical synchronous modeling framework including both dataflow, and finite state machines, where static (or quasi static) scheduling techniques are applied if possible.
Sentence 2: for the purpose of this case study, their quasi­static scheduling strategy and synchronous semantics makes the mapping of individual functional blocks onto a distributed heterogeneous architecture like ours problematic.
Relationship: contrasting
Domain: Networks
Sentence 1: The average desync error de­creased exponentially with time, reaching an error of less than 1 ms within 18 rounds (note that the desired slot size is T/n = 100 ms).
Sentence 2: the total normalized through­put was high (~ 92%, or 57.8 kbps) and roughly constant throughout the experiment, regardless of the desynchroniza­tion error.
Relationship: contrasting
Domain: Networks
Sentence 1: For a secure routing protocol in GVG - RP, the prob­ability of route discovery success Pr[RRE P received by source] must be 1 - E(N), while the probability of route discovery failure Pr[RRE P not received by source] must be E(N).
Sentence 2: as we illustrate later, AODV and DSR are not in GVG- RP under severe routing attacks like the rushing attack [11].
Relationship: contrasting
Domain: Networks
Sentence 1: The improvement is small for the shuf.e workloads where traf.c is distributed across many links, and we saw similar trends for Staggered Prob (not shown) where traf.c is typically isolated near the network edges.
Sentence 2: in the other workloads, the improvement of PlanckTE over Poll-1s ranges from 24.4% (random) to 53% (stride), and the improvement over Poll-0.1s ranges from 11% (random) to 33% (random bijection).
Relationship: contrasting
Domain: Networks
Sentence 1: ICIS 2009, November 24-26, 2009 Seoul, Korea Copyright &#38;#169; 2009 ACM 978-1-60558-710-3/09/11... $10.00" other words, in IntServ or MPLS, a Resource ReSerVation Protocol (RSVP) Path [1] or Label Switching Path (LSP) [3] between each source-destination pair must be established beforehand to guarantee users QoS requirements.
Sentence 2: the network scalability is greatly reduced due to the connection­oriented characteristic.
Relationship: contrasting
Domain: Networks
Sentence 1: von-Neumann decomposition implies that every C-bounded demand matrix can be scheduled, cell by cell, in C scheduling opportunities (or, equivalently, in IC/Sl time-slots) when permutation Pi dictates the scheduling in opportunity i.
Sentence 2: such a scheduling may violate the packet-mode restrictions, since there is no relation between adjacent permutations in the sequence.
Relationship: contrasting
Domain: Networks
Sentence 1: More than 20% of them have hostnames that include either ggc or google.cache.
Sentence 2: these results sug­gest that Google is reusing infrastructure from the Google Global Cache (GGC), Google s content distribution network built primarily to cache YouTube videos near users.9 It is 6when we submitted the paper in May, only 13% were in the US or Europe.
Relationship: contrasting
Domain: Networks
Sentence 1: Like RCP, WebTP is a fully receiver-centric transport protocol where the receiver is responsible for .ow control, congestion control, and reliability, while the sender merely transmits whatever packet the receiver requests.
Sentence 2: since WebTP is primarily designed for the wired environment, it does not address the issue of request losses, which RCP handles through the use of the cumulative mode and the cyclic buffer as we discussed in Section 3.3.1.
Relationship: contrasting
Domain: Networks
Sentence 1: The subgroup controllers USCi in our proposed scheme con­sume slightly higher energy than the subgroup controllers Up of NHS when N = 100 and 1000.
Sentence 2: when N> 1000, the subgroup controllers Up of NHS consume slightly higher energy than the subgroup controllers USCi in our proposed scheme due to the larger number of messages to be received when N increases.
Relationship: contrasting
Domain: Networks
Sentence 1: 3.1 D-Grouping based on PINGs Unlike k-means which uses client coordinates (or posi­tions) to partition them, we partition clients using the pair­wise round-trip times (RTTs) between them, which can be easily retrieved by PING before the session starts.
Sentence 2: just like k-means, given the desired number of groups, D-Grouping aims to put clients with a low pairwise RTT into a same group.
Relationship: contrasting
Domain: Networks
Sentence 1: Digital Signature-based Authentication Framework in Cognitive Radio Networks Sazia Parvin Farookh Khadeer Hussain Omar Khadeer Hussain School of Information SystemsDecision Support and e-ServiceSchool of Information SystemsCurtin Business School Intelligence Lab, Quantum Curtin Business School Curtin UniversityComputation and Intelligent Systems Curtin University saziap@yahoo.com School of Software University of Technology, SydneyO.Hussain@curtin.edu.au Ultimo, NSW, 2007 Farookh.Hussain@uts.edu.au ABSTRACT Due to the rapid growth of wireless applications, Cognitive Radio (CR) has been considered as a technology to solve spectrum source deficiency by improving effective utilization of limited radio spectrum resources for future wireless communications and mobile computing.
Sentence 2: the unique characteristics of CRNs make security a greater challenge.
Relationship: contrasting
Domain: Networks
Sentence 1: Voice calls (associated components not shown in the .gure) and data traf.c are tunneled via the eNB-GW to the same set of network components as with the macro cells.
Sentence 2: small cells can use LIPA [1] (Local IP Access) as de.ned in the standard to access services and computation local to the subnet in which they are deployed (such as in a home, coffee shop, or enterprise).
Relationship: contrasting
Domain: Networks
Sentence 1: Predicting the stations which do not receive the fake re­gions while still being positioned within the AP s trans­mission range represents a signi.cant problem to the at­tacker and random probing for such positions decreases its attack rate.
Sentence 2: such arti.cial regions, i.e., regions made only from certain stations with high spa­tial distribution, are never de.ned through monitoring of the wireless neighborhood, thus they are not used by legiti­mateclients(e.g.
Relationship: contrasting
Domain: Networks
Sentence 1: In fact, the transaction is carried out anonymously with R only learning required attributes of A.
Sentence 2: in case of a violation of the terms and conditions of the car rental agency as well as if the user commits illegal actions (e.g., violation of traf.c regulations), the agency wants to ensure accountability of A, e.g., by being able to obtain her name and address information.
Relationship: contrasting
Domain: Networks
Sentence 1: It is possible to develop techniques that predict the likely current location using the past few location samples, but we didn t experi­ment with that idea because the scan and association times are cur­rently a relatively small fraction of the overall idle time.
Sentence 2: such an optimization may be even more bene.cial for 802.11a than for 802.11b, because of the larger number of channels in 802.11a.
Relationship: contrasting
Domain: Networks
Sentence 1: 2.1 Cluster-Aware Communication Giventhisclusteringandthediversity ofapplicationsinVANETs, many different kinds of applications may coexist, each character­ized by different requirements and goals.
Sentence 2: these appli­cations can be divided into two c ategories: node-centric and con­tentcentric.
Relationship: contrasting
Domain: Networks
Sentence 1: Uniform-3VC achieves loweraverage packet latency than uniform-2VC and so more VCs need tobe allocated even using our algorithms to achieve the same targetlatency.
Sentence 2: we see high reductions of up to 51% for greedydeletion and 48% for greedy addition, compared to the 192 VCsrequired by the uniform con.guration.
Relationship: contrasting
Domain: Networks
Sentence 1: =280 5.2 Compromising A Partial Set of Pairwise Keys We have shown that, if the system parameters are chosen appropriately, an adversary has prohibitively high complex­ity to break fi(x,y)(i=0,··· ,m-1) to compromise all the pairwise keys.
Sentence 2: the adversary may attempt to com­promise part of the pairwise keys.
Relationship: contrasting