sadat2307/MSciNLI huggingface dataset:
Domain: Networks
Sentence 1: Consider a unit disk graph G =(V, E) which corresponds to the following set of n points in the plane:   ..k .f S = {r =(0.5, 1)}{ {(i/f, 2j)}} j=1 i=1 where n - 1= fk.The optimal k-clustering of G has exactly one cluster.
Sentence 2: consider the BFS spanning tree T for G rooted at r. The order of the optimal k-clustering on T is f +1.
Relationship: contrasting
Domain: Networks
Sentence 1: Our question then reduces to whether the network operates e.­ciently at these Nash equilibria.
Sentence 2: our .ndings are twofold.First, in more traditional environ­ments where end-points use TCP Reno-style loss recovery and routers use drop-tail queues the Nash Equilibria are reasonably e.cient.when endpoints use more recent variations of TCP (e.g., SACK) and routers employ either RED or drop-tail queues, the Nash equilibria are very ine.cient.This suggests that the Internet of the past could remain stable in the face of greedy end-user behavior, but the Internet of today is vulnerable to such behavior.Second, we .nd that restoring the e.ciency of the Nash equilibria in these settings does not require heavy­weight packet scheduling techniques (e.g., Fair Queuing) but in­stead can be done with a very simple stateless mechanism based on CHOKe [21].
Relationship: contrasting
Domain: Networks
Sentence 1: Strictly following the TCP specification, if the second SYN's se- quence number is inside the allowable window (which it will be if the SYNs arrive in order) then a RST should be generated, otherwise the remote host should respond with a tmre ACK (indicating the SYNs arrived out of or- der).
Sentence 2: in practice, this portion of the TCP spec- ification: is poorly understood and the most common im- plementations always respond to a second SYN with a RST, allowing reordering to be inferred simply as shown in Figure 4.
Relationship: contrasting
Domain: Networks
Sentence 1: Diffserv aims to achieve scalability by "aggregating traffic classification state" through "IP-layer packet marking" [3], and it can be implemented on a very modest scale, perhaps "at a single bottleneck" [8].
Sentence 2: such minimalism is a far cry from the Grand Unified style of QoS exemplified by Integrated Services, and it also presents fewer operational risks.6 it is doubtful that minimalist Diffserv can provide the rich service model envisioned by most QoS advocates and architects.
Relationship: contrasting
Domain: Networks
Sentence 1: Therefore, to avoid the data traffic from exceeding the capacity limit of a cellular base station (BS), cellular operators have been trying to install cellular femto cells (local BSs) or wireless LAN access points (APs) in restaurants, cafes, user s houses, etc., to divert data traffic from the cellular radio access link to the fixed­line such as x-DSL and FTTH.
Sentence 2: the traffic levels extremely change in a day, even locally, due to the mobility of users.
Relationship: contrasting
Domain: Networks
Sentence 1: For instance, for the subcarrier set from the experiment in Section 7.2.1, if we put a known data value on subcarrier 10, the resulting constellation diagram under 25% clock rate will degenerate to 8-QAM instead of 16-QAM.
Sentence 2: using more subcarriers will reduce the effec­tive data throughput.
Relationship: contrasting
Domain: Networks
Sentence 1: Many other techniques for ef.cient broadcast communication in wireless sensor networks and in wireless ad hoc networks have been studied (e.g., [7,19,19,21,24,25]).
Sentence 2: in contrast to these techniques, a node in DW-MAC wakes up on de­mand during a Sleep period; scheduling frames during the Data pe­riod explicitly coordinate nodes when to wake up during the Sleep period to transmit or receive a packet.
Relationship: contrasting
Domain: Networks
Sentence 1: In OFDMA cellular networks, intra-cell interference within a single cell is mostly elimi­nated due to the orthogonality of subcarriers.
Sentence 2: se­rious inter-cell interference (ICI) occurs when the frequency reuse factor equals to one, resulting in reducing system ca­pacity, and substantially degrading the performance of cell edge users (CEUs).
Relationship: contrasting
Domain: Networks
Sentence 1: When the reporting timer expires, the first-hand reputation information FRij about node j from node i is updated as follows: FRij = v· FRij_old + (1- v)·FRij_new where v is a weight value.
Sentence 2: during inactivity periods, we periodically decay the value as follows: FRij = v· FRij_old + (1- v)·FR_initial.
Relationship: contrasting
Domain: Networks
Sentence 1: Forexample,thereismuch interestinuseof wirelessandmobile sensor/actuator networks and such edge networks that may not use IP.
Sentence 2: anIdenti.er value could be used in sensor/actuator devices, especiallyone formedintheIEEEEUI-64 syntax,inorder to allow state to be maintained across network realms.
Relationship: contrasting
Domain: Networks
Sentence 1: The substitution of the ATM trans­port in the UTRAN by IP (IP-RAN) has already been proposed and speci.ed by 3GPP for Release 5 [1], Figure 1 depicts the IP-RAN architecture.
Sentence 2: this substitution raises several issues in or­der to make an ef.cient use of the network that have not been fully addressed yet by 3GPP: The protocol overhead increases signi.cantly when IP transport is considered as compared to ATM.
Relationship: contrasting
Domain: Networks
Sentence 1: In the mean time, D generates MACKDCA on the iden­tity of the reader IDR,the challenge, the element of the chain that was sent to the reader ci, and the value of i.
Sentence 2: once computed, this is also sent to the reader R. MACKDCA is not expected to be veri.ed by the reader R but to be forwarded to CA for veri.cation and auditing.
Relationship: contrasting
Domain: Networks
Sentence 1: Ten­ant machinesarearrangedingroupsof size S, resultingin N S groups.VMsin agroup are connectedby bidirectionallinks of capacity Bto a(virtual)group switch.Thegroup switches are further connected using a link of capacity B ' = S*B to O a(virtual) root switch.
Sentence 2: the resulting topology has no over­subscriptionforintra-group communication.inter­group communication has an oversubscription factor O, i.e., the aggregate bandwidth at theVMsis O timesgreater than the bandwidth at the root switch.
Relationship: contrasting
Domain: Networks
Sentence 1: We note that in the protocol model solution, the .ow rate from node 8 to node 11 is 117.84, i.e., the computed capacity is 100% utilized.
Sentence 2: theinterference from node 13 at node 11 is g13,11 · p132 ,9 =0.2403· .W, which is not zero.
Relationship: contrasting
Domain: Networks
Sentence 1: Since in the ad­hoc mode the beacon generation process is distributed and follows a random algorithm, and since the inter-beacon time can be changed by the user, the actual time required to de­tect the beacons may vary.
Sentence 2: even in the worst case, the autocon.guration process is not expected to last more than a couple of seconds, which is quite acceptable for our purpose.
Relationship: contrasting
Domain: Networks
Sentence 1: To achieve stationary target coverage maximization, centralized, distributed, and semi-centralized camera con.guration policies are proposed in the literature [2,25].
Sentence 2: answering the latter ques­tion is non-trivial: in addition to the target mobility and/or velocity, it also needs to consider the wireless communication overhead that can potentially restrict the coverage policy to realize its full potential.
Relationship: contrasting
Domain: Networks
Sentence 1: Fourth, when di.erent schedules within the net­work can be implemented independently here we imagine separate non-interfering network components , for Back-Pressure, messages must be shared between the separate components in order to determine the di.erences in queue sizes.
Sentence 2: for the Proportional Scheduler, the opti­mization relevant to the policy will decompose into an in­dependent optimization for each component which can then be solved separately.
Relationship: contrasting
Domain: Networks
Sentence 1: Additionally, all the individual NHs associated with this pre.x should be writ­ten into the associated SRAM.
Sentence 2: changing one non-leaf pre.x triggers the update of at most N virtual pre.xes (where N is the number of FIBs) in the TCAM of thenon-sharedlookuppath(e.g., see pre.x 100* in Fig­ure 11(d)), as well as N NHs in the associated SRAM.
Relationship: contrasting
Domain: Networks
Sentence 1: Figure 14 shows that the delivery rate of Original Greedy increases by using more retransmissions and since the lowest reception rate of a neighbor is 1%, in.nite retransmissions do not cause delivery failures due to losses, but delivery fail­ures could still happen due to greedy disconnections.
Sentence 2: the energy e.ciency of Original Greedy de­grades with more retransmissions, due to the extra overhead of retransmitting on bad links.
Relationship: contrasting
Domain: Networks
Sentence 1: http://dx.doi.org/10.1145/2645672.2645682.
Sentence 2: especially in such DTWSNs, application data is of­ten rather small, such as measured sensor data [11, 3], while the available upper limit for the payload imposed by lower layers is also often limited, e. g. 127 bytes over IEEE 802.15.4 links [10].
Relationship: contrasting
Domain: Networks
Sentence 1: (e, t) (6) sw(u, v) := (7) e.P .2 · .v,w else u,w  Following this de.nition, we then de.ne the aged simi-In the .rst case the decision can easily be reached using larity s(u, v) as the sum of the similarities of all common the betweenness value, while in the third case the higher neighbors i between node u and v. similarity will be the best choice.
Sentence 2: the second case X s(u, v) := sw(u, v) (8) might be critical as the similarity might not be meaningful enough and a high betweenness could possibly lead in the wrong direction when reaching the proximity of the desti­ w.N1(u)nN1(v) nation.
Relationship: contrasting
Domain: Networks
Sentence 1: From Toys to Products: A Step Towards Supporting the Robust Reuse and Integration on the Web Peng Gao Tokyo Institute of Technology, Japan gao@tt.cs.titech.ac.jp ABSTRACT UI component based mashup at client side is a new trend of information/knowledge integration method on the We­ b.
Sentence 2: without a systematic and robust composition mechanism, the widespread of such mashups is still a beau­tiful wish.
Relationship: contrasting
Domain: Networks
Sentence 1: In fact, numerous proposals have been developed that use asynchronous hop-by-hop communications to avoid the need for an end-to-end path (1) and thereby (implicitly) also address the is­sue of (2).
Sentence 2: these usually force the applications into the DTN-inherent asynchronous communication paradigm and often require speci.c application protocols designed for this purpose.
Relationship: contrasting
Domain: Networks
Sentence 1: Forexample,anambulaneadhonetworkonanemergeny allmayonnettothehospitalinfrastrutureasneessary forommuniatingwiththedotor.Inthiskindofmesh topology,atleastonenodediretlyonnetstotheinfras­truturenetworks.Moreover,nodesinthismeshnetwork haveminimalornomobility.Thus,aproativeroutingpro­toolisdeemedmoresuitableforsuhameshnetwork.
Sentence 2: theaforementionedfeaturesanbewellapturedbya tree-basedrouting(TBR)protool[I,2],whihisattain­inginreasedattentionasaviableroutingprotoolforthe MeshWLANs.BasedontheTBRprotool,theroot(mesh portal)onstrutstree-typepathsefientlyandquiklyin theMeshWLAN,wherebyallthepartiipatingnodesare linkedtoit.Inaddition,theTBRprotoolisproposedbased onthepremisethattrafaremostlydiretedto/froman infrastruturenetworkthroughtheroot,inwhihitworks efetivelyinhandlingthetrafommuniationstowards theroot.whentheamountoftrafinsidemesh networkinreasessignifantly,theintra-meshtrafaround therootoftheMeshWLANbeomessoheavythattheover­allnetworkperformaneanbedegradedrapidly.Routing intra-meshtrafthroughtherootnotonlyaggravatethe saidweakpointofTBRprotool,butalsowasteefientus­ageofnetworkresouresduetothephysialharateristis ofwirelessonstraints.Indeedallthisforwardingofintra­meshtrafthroughtherootmightfowovertheroutes withoutusingthebest-metri.
Relationship: contrasting
Domain: Networks
Sentence 1: Therefore, the receiver will suc­cessfully decode the original message using this estimation Theoretically, the attacker can set an arbitrarily small delay (e.g, 1 nanosecond) to create a much richer virtual multipath e.ect at the receiver.
Sentence 2: modern channel estimation algorithms estimate only resolvable paths whose inter-arrival durations are no less than one symbol duration, and it has been shown that using the estimation of resolvable paths is su.cient to compensate the channel e.ect for sig­nal demodulation.
Relationship: contrasting
Domain: Networks
Sentence 1: We formally i express these relationship in the next section.
Sentence 2: also Cif corresponds 3.2 Simpli.ed Model to the queue size qif from Section 2 on all nodes i used by .ow f. We next consider the simpli.ed, suboptimal version of (4): in this case we do not queue Cif packets per node and per .ow, but only P f , which is signi.cantly smaller, as we will maximize Uf (yf ) subject to (1), (2), (7).
Relationship: contrasting
Domain: Networks
Sentence 1: Monetary Incentive with Reputation for Virtual Market-place based P2P Krit Wongrujira School of Electrical and Telecommunication University of New South Wales Sydney, Australia krit@student.unsw.edu.au ABSTRACT One of the underlying assumptions on the design of peer-to­peer (P2P) network is that each peer trusts each other for forwarding transit messages.
Sentence 2: with the growth of P2P application, especially in business model, some peers may behave as sel.sh, irrational nodes due to con.ict of interest or for conservation bandwidth.
Relationship: contrasting
Domain: Networks
Sentence 1: Figure 4 shows distributions of the delay contribution of the di.erent factors contributing to Tlong .It shows that failure detection contributes the most, closely followed by route invisibility (both contribute around 10 seconds in 90% of events).
Sentence 2: path exploration contributes least in MPLS VPNs, as opposed to the Internet environ­ment where it is the dominant factor.
Relationship: contrasting
Domain: Networks
Sentence 1: Common approaches that also explore the message routing within a DSE tend to express and determine the routing hop-based with the help of one two-dimensional routing matrix of all resources and communication hops for each of the included messages.
Sentence 2: the disadvantage of those approaches is that the number of decisions for the routing of every message scales with the number of resources 1The network topology as well as the message routing are also explored and optimized during the DSE and the number of hops that are allowed to be taken for a routing.
Relationship: contrasting
Domain: Networks
Sentence 1: Unfortunately, the path followed by messages from the common source to [gigj ] is likely to be different; hence the order in which messages were sent by the source is likely to be lost.
Sentence 2: if the source sends a sequence of messages to gi, waits until it is received by [gigj ], and then sends a sequence of messages to gj , the order in which the sequences of messages have been sent will not be lost.
Relationship: contrasting
Domain: Networks
Sentence 1: Since the transmit pattern is oblivious to channel state information, directional beams are affected by multipath propagation and have been shown to be less effective in indoor environments [11, 16].
Sentence 2: beamforming is a closed-loop technique that uses the channel information at the Tx to modify the transmitted signal such that the signals received through the multiple paths are rein­forced at the Rx thereby improving the link Signal to Noise Ratio (SNR).
Relationship: contrasting
Domain: Networks
Sentence 1: Decentralized Group Key Management for Dynamic Networks Using Proxy Cryptography Junbeom Hur Korea Advanced Institute of Science and Technology(KAIST) 383-1, Guseong-dong, Youseong-gu Daejeon, Rep. of Korea jbhur@nslab.kaist.ac.kr  Youngjoo Shin Korea Advanced Institute of Science and Technology(KAIST) 383-1, Guseong-dong, Youseong-gu Daejeon, Rep. of Korea yjshin@nslab.kaist.ac.kr Hyunsoo Yoon Korea Advanced Institute of Science and Technology(KAIST) 383-1, Guseong-dong, Youseong-gu Daejeon, Rep. of Korea hyoon@nslab.kaist.ac.kr ABSTRACT Decentralized group key management mechanisms o.er ben­e.cial solutions to enhance the scalability and reliability of a secure multicast framework by con.ning the impact of a membership change in a local area.
Sentence 2: many of the previous decentralized solutions reveal the plaintext to the intermediate relaying proxies, or require the key distribution center to coordinate secure group communications between subgroups.
Relationship: contrasting
Domain: Networks
Sentence 1: Table 1 also shows that SProbe is the only tool that exploits the(v,k)-TWP(withv =0 and k =1) to mea­sure reverse capacity.
Sentence 2: sProbe dispatches an HTTP GET request to induce a pair of Sr-byte TCP data packets from a web server for the measurement, where Sr de­pends on the negotiated TCP maximum segment size (MSS).our empiricalevaluation ofSProbe(to bepresentedin§5)shows that its reverse-path measure­ment is often inaccurate, because the response packets are not dispatched consecutively.
Relationship: contrasting
Domain: Networks
Sentence 1: In Panama, if an IP packet does not require additional pro­cessing, its forwarding path is an interrupt-free pipeline co­ordinated by network processors lying on the packet s for­warding path.
Sentence 2: when a packet needs high-level processing, it is asynchronously posted to the computation path, which in turn asynchronously returns the packet to the forwarding pipeline after processing it.
Relationship: contrasting
Domain: Networks
Sentence 1: 6.1.2 Accuracy gain The only parameter of the adaptive method is the picture size,andby settingittothreedi.erent values,namely1024, 2048, and 4096, the same high accuracy score is observed, 0.99, 0.98, and 0.99, respectively.
Sentence 2: the number of reported alarms decreases as the picture size increases, which is 373, 173, and 117 events respectively.
Relationship: contrasting
Domain: Networks
Sentence 1: Energy-Ef.cient Low Power Listening for Wireless Sensor Networks in Noisy Environments Mo Sha, Gregory Hackmann, Chenyang Lu Department of Computer Science and Engineering Washington University in St. Louis One Brookings Drive, Box 1045 St. Louis, Missouri 63130, USA {msha, ghackmann, lu}@wustl.edu ABSTRACT Low Power Listening (LPL) is a common MAC-layer tech­nique for reducing energy consumption in wireless sensor networks, where nodes periodically wakeup to sample the wireless channel to detect activity.
Sentence 2: lPL is highly susceptible to false wakeups caused by environmental noise being detected as activity on the channel, causing nodes to spuriously wakeup in order to receive nonexistent trans­missions.
Relationship: contrasting
Domain: Networks
Sentence 1: 1) Open problems Our conclusion is that a PIFO DSM router is less complex than a PIFO CIOQ router (has lower memory bandwidth, fewer memo­ries, a simpler scheduling algorithm, but slightly higher crossbar bandwidth).
Sentence 2: it seems that the PIFO DSM router has two main problems: (1) The departure times of each packet must be determined centrally with global knowledge of the state of the queues in the system, and (2) A sequential scheduler must find an available memory for each packet in turn.
Relationship: contrasting
Domain: Networks
Sentence 1: In Speed, each AP picks the data rate to be used at the beginning of the timeslot by comparing the current SINR level to the minimum required SINR thresholds for the di.erent rates.
Sentence 2: during thetimeslotthe selected rate may not be supported due to an inaccurate SINR model, un­calibrated RSSI levels, short-term fading, or mobility in the environment.
Relationship: contrasting
Domain: Networks
Sentence 1: 2.1.2 Locator/Identi.er separation Decoupling locators from identi.ers provides inherent support for (end-host) mobility and avoids issues such as provider lock-in.
Sentence 2: a new architectural component a mapping service is needed: Given a certain identi.er it returns the current locator(s), see Section 2.3.
Relationship: contrasting
Domain: Networks
Sentence 1: A Toolkit for Automating and Visualizing VLAN Con.guration Sunil D. Krothapalli, Xin Sun, Yu-Wei E. Sung, Suan Aik Yeo and Sanjay G. Rao School of Electrical and Computer Engineering, Purdue University West Lafayette, Indiana, USA {skrothap, sun19, sungy, yeo, sanjay}@purdue.edu ABSTRACT Virtual Local Area Networks (VLANs) are extensively used in en­terprise networks.
Sentence 2: their con.guration remains an ad-hoc, complex and error-prone process today.
Relationship: contrasting
Domain: Networks
Sentence 1: Some pioneer 3HUPLVVLRQ WR PDNH GLJLWDO RU KDUG FRSLHV RI DOO RU SDUW RI WKLV ZRUN IRU SHUVRQDO RU FODVVURRP XVH LV JUDQWHG ZLWKRXW IHH SURYLGHG WKDW FRSLHV DUH QRW PDGH RU GLVWULEXWHG IRU SURILW RU FRPPHUFLDO DGYDQWDJH DQG WKDW FRSLHV EHDU WKLV QRWLFH DQG WKH IXOO FLWDWLRQ RQ WKH ILUVW SDJH 7R FRS RWKHUZLVH WR UHSXEOLVK WR SRVW RQ VHUYHUV RU WR UHGLVWULEXWH WR OLVWV UHTXLUHV SULRU VSHFLILF SHUPLVVLRQ DQG RU D IHH %2'<1(76  6HSWHPEHU 2FWREHU  %RVWRQ 8QLWHG 6WDWHV &#38;RSULJKW k  ,&#38;67     '2,   LFVW ERGQHWV medical projects promise grant opportunities to Cloud.
Sentence 2: security concerns of Cloud escalate due to the life-threatening situations related to healthcare applications.
Relationship: contrasting
Domain: Networks
Sentence 1: In the no­saturation case, the number offrames transmitted(with suc­cess orfailure) at theMAC sublayer with slottedCSMA/CA is the same as with adaptive slotted CSMA/CA.
Sentence 2: thechannel accessfailure rateof adaptiveslottedCSMA/CA is lower than with the original slotted CSMA/CA.
Relationship: contrasting
Domain: Networks
Sentence 1: An e.cient heuristic approach is adopted to divide the sensors into a maximal number of disjoint sets [8], in which only one set can monitor all the targets and transmit the collected packet during a period of time, and the others are all in the sleep mode.
Sentence 2: it has to be noted that if one of the sensors fails, the solution might not be optimal anymore and more likely the sensors remaining in that set might not cover all the targets.
Relationship: contrasting
Domain: Networks
Sentence 1: The averagedistance inthe transmissionfrom theithto (i +1)st relay node xi and xi+1 is N -.|Ci+1| ZZ di,i+1pri,i+1  E(svc) (1-e ) dxidxi+1 (5) |Ci||Ci+1| Ci+1 Ci The .rsttermisduetotheprobabilitythatatleastone node existsin the cell Cj.If nonode existsinthecell Cj,direct communication with the destination node is needed.
Sentence 2: the probability of successful transmissionsin this caseis very small andyield on av­erage close to zeroprogress.
Relationship: contrasting
Domain: Networks
Sentence 1: Obviously, it is more complicated in the wireless ad hoc environment than in the wired network, and only the last situation, i.e., packet dropping caused by a full buffer queue is resulted from network congestion.
Sentence 2: tCP relies on the packet loss to detect the congestion and thus TCP may probably take a wrong reaction to packet loss, which is caused not only by network congestion.
Relationship: contrasting
Domain: Networks
Sentence 1: Meanwhile, security research has shown that communities of related entities, such as companies within an industry, can be used effectively for network intrusion detection and resilience by applying anomaly detection [4], [5], outlier detection in evolving communities [6], [7], classi.cation of malicious net­work traf.c [8], [9], or behavioral analysis [10].
Sentence 2: the precondition for these methods is knowing the members of the community to be protected.
Relationship: contrasting
Domain: Networks
Sentence 1: We can conclude that LDC algorithm is an e.cient inter­ference mitigation technique for low data rate UWB com­munication since the FER of wideband OFDM systems is improved with decreasing of the duty-cycle of LDC-UWB.
Sentence 2: lDC cannot suppress interference to wideband OFDM systems completely.
Relationship: contrasting