sadat2307/MSciNLI huggingface dataset:
Domain: Networks
Sentence 1: Given the number of sectors, we should choose the minimum beamwidththathasgood coverage(e.g.,forfour sectors, 35. antennas should be used) since this o.ers the stronger angular separation.
Sentence 2: we propose that directional clients that are primar­ily used in indoor environments should be equipped with multiple narrow beam antennas: 35. or 65. patch antennas, along with an omni-directional antenna to handle the sce­ 100 80 60 40 20 0 Coverage (%) Coverage (%) Beamwidth (a)Indoor 100 80 60 40 20 0  20 40 60 80 100 120 Beamwidth (b)Outdoor Figure 3: Coverage of Directional Antennas nariowherenoneof thedirectional sectorscanprovidestrong signal strength.
Relationship: reasoning
Domain: Networks
Sentence 1: To achieve forwarding e.ciency for push based informa­tion dissemination, we try to reduce the time required for name resolution and complex protocol exchange at every hop in the overlay.
Sentence 2: we prefer that the COPSS forwarding engines be present only at critical positions (i.e., edge of a domain and local rendezvous points (RPs)) and leave intermediate routers to only focus on forwarding.
Relationship: reasoning
Domain: Networks
Sentence 1: Note that Tf (i) is an increasing function of i, since the lower-priority forwarding candidate al­ways needs to wait and con.rm that no higher-priority candidates have relayed the packet before it takes its turn to relay the packet.
Sentence 2: the total medium time needed for a packet delivered from the sender to the ith forwarding candidate is ti = Ts + Tf (i) (4) In the following subsections, we will give examples to illus­trate how the candidate prioritization, selection and coordi­nation will a.ect the expected packet advancement, reliabil­ity and medium time cost, which in turn a.ect the one-hop throughput.
Relationship: reasoning
Domain: Networks
Sentence 1: For 802.11b, we use the speci.­ cations for the OrinocoTM wireless NIC which can be found at http://www.orinocowireless.com better-than-average channels) are typically at least multiple packet transmission times.
Sentence 2: when a mobile user is granted channel access while encountering a high­quality channel, OAR grants the user a channel access time that allows multiple packet transmissions.
Relationship: reasoning
Domain: Networks
Sentence 1: Switch spoofing: Some of network engineers in the surveyed networks neglected to disable trunk negotiation, and also neglected to ensure that ports not meant to be trunks are explicitly configured as access ports.
Sentence 2: an attacking host can imitate a trunking switch by speaking a trunking protocol like IEEE 802.1Q and therefore is able to access traffic from all VLANs.
Relationship: reasoning
Domain: Networks
Sentence 1: In particular, the widespread adoption of .rewalling has made some ports far easier to use than others (i.e., the commonly open ports such as TCP port 80, used for HTTP traf.c, TCP port 25, used for SMTP, and UDP port 53, used for DNS).
Sentence 2: to en­sure connectivity, there is an increasing incentive to simply use these ports for arbitrary applications, either directly or using the native protocol as a tunneling transport layer.
Relationship: reasoning
Domain: Networks
Sentence 1: The fact that TCP relies solely on end-to-end mea­surements of packet loss or delay as the only sources of feedback from the network means that TCP can, at its best, have a very limited view of the network state (e.g., the trajectory of available bandwidth, congested links, network topology, and tra.c).
Sentence 2: a natural question here is: Can we build a system that observes the state and dynamics of a computer network and adapts TCP s behaviour accordingly?
Relationship: reasoning
Domain: Networks
Sentence 1: This observation is easy to explain since CAN s diameter 1/2dN1/d is a strictly convex function with a unique minimum located at d =lnN (e peers per dimension).
Sentence 2: keeping in mind that each dimension must contain an integer number of peers, the best practical diameter is achieved for d =log3N.for N =106,the optimal number of dimensions d is 12(k =24neighbors) and the optimal diameter is 19.
Relationship: reasoning
Domain: Networks
Sentence 1: Suppose the period of a 0-1 pulse wave is T with pulse time t. The Fourier series expansion for this pulse wave is 8 t 2 pnt 2pn f(t) = + sincost(3) T np TT n=1 Above equation indicates that the emission power of the LED is spread over the baseband (the .rst AC component) and all the harmonics.
Sentence 2: it is nontrivial to measure the over­all received energy.
Relationship: reasoning
Domain: Networks
Sentence 1: i.ALI V Ee Before step 2b we have that fi <ne +1 +1/c.
Sentence 2: p i.ALI V Ee the total increase of CON in step 2b of the algorithm does not exceed X X 1 fi fipi = < 2+1/c nepi ne i.ALI V Ee i.ALI V Ee It follows that the total increase of CON in a weight augmen­tation step is at most 3 + 2/c.
Relationship: reasoning
Domain: Networks
Sentence 1: Figure 8(d) Savings (%) Savings (%) 40 30 20 40 30 20 shows that less than quarter of the savings are due to large full packet matches, while 20 % of the savings are due to matches of size less than 150 bytes.
Sentence 2: while full packet matches provide 20-50% in overall sav­ings, in order to get the maximum bene.t of redundancy elimina­tion, we need to index the vast majority of small packet matches of size less than 150 bytes.
Relationship: reasoning
Domain: Networks
Sentence 1: When using an Axon network, however, the additional cut-through latency added by each Axon is minimal, and thus the .le system perfor­mance remains nearly constant as the network size increases.
Sentence 2: % Packets routed by CAM 100 80 60 40 20 0 20 21 22 23 24 25 26 27 28 29210 211212 213 214   Size of CAM (number of entries) Figure 5: CAM E.ectiveness At Varying Sizes theperformancepenalty of using centralized network storage is signi.cantly reduced with an Axon network.
Relationship: reasoning
Domain: Networks
Sentence 1: Each network link is allocated to an IEEE802.1q VLAN for early implementation, but this method cannot accept enough network links because the maximum number of IEEE802.1q VLAN tags is 4,096.
Sentence 2: all network links will be allocated on a single .at VLAN, and each net­work link is separated by IP address ranges using an IP alias on the current implementation.
Relationship: reasoning
Domain: Networks
Sentence 1: Consequently, c0 v 2n 12c0 Prnd Pr X =| Area(T )|· = 1 -v 2 a t n · k · ln n .
Sentence 2: using Lemma 3, similar to the proof of Lemma 9 (by de.n­ing variable Xi,j,f ), we can show that the number of nodes that will get a copy of the data for multicast within nodes U1' , with high probability, is at most v 2nf 2nf | Area(T )|· = (2r · .c5 ka + k · p · r 2/2) · a2 · Ca2 · C v v rf = (4c5.
Relationship: reasoning
Domain: Networks
Sentence 1: For ex­ample, even with k8and m10, if the separate attack paths diverge such that there are 10 completely independent edges per attacker, this will require roughly a billion combinations to be con­sidered.
Sentence 2: there is a design tension in the size of k per-packet space overhead is reduced by a larger k, while compu­tational overhead and robustness bene.ts from a smaller k. 5.2 IP header encoding To allow for practical deployment requires that we overload ex­isting header .elds in a manner that will have minimal impact on existing users.
Relationship: reasoning
Domain: Networks
Sentence 1: Proof: Disconnecting the communication graph G of a set of sen­sors creates (at least) 3 disjoint sets of nodes, the set of nodes W that is removed, and two sets of nodes V1 and V2, such that there are no edges from any node in V1 to any node in V2 in G. By Theorem 1, if it is possible to draw a continuous path between two nodes so that every point on the path is sensor-covered, then there exists a communication path between those two nodes.
Sentence 2: to disconnect the graph it is necessary to create a sens­ing void, so that it is impossible to draw a continuous covered path connecting a node in V1 to a node in V2.
Relationship: reasoning
Domain: Networks
Sentence 1: The NP-hardness of such a problem clearly derives from the NP-hardness of the channel assignment and routing prob­lem.
Sentence 2: we propose a heuristic that seeks to minimize the maximum total utilization among all the collision do­mains in the attempt to make the total utilization of all the collision domains below 1 and tries to turn o. as many radios as possible.
Relationship: reasoning
Domain: Networks
Sentence 1: In the type of bursty con­vergecast as experienced by Lites and ExScal [2], it is more dif.­cult to perform data aggregation at the mote level because motes detecting an event can be multiple hops away from one another and the length of a single sensor data entry is more than half of the packet length.
Sentence 2: the current implementation of RBC is based on the paradigm of implicit-ack to reduce the number of packets competing for channel access.
Relationship: reasoning
Domain: Networks
Sentence 1: 4.2 Realization of the MHD and DTD Algorithms with Lower Overhead However, a node which is ready for packet propagation should know the remaining energy level of its successor or node n0 in advance, which will provoke extra energy con­sumption.
Sentence 2: in order to avoid additional energy cost, the adaptive algorithms will introduce the proportion P (ni), two counters CM (ni) and CD(ni) for node ni during the whole lifetime.
Relationship: reasoning
Domain: Networks
Sentence 1: Let Q denote the number of vehicles in the waiting queue, and the length of the queue (denoted by lq) can be calculated as: lq = Q · .d, where .d denotes the average spacing of each vehicle in the queue.
Sentence 2: the message delivery delay along this road segment includes two parts: (1) carrying delay (denoted by dc): the message is carried by the vehicle on the road un­til catching up with the waiting queue at the downstream signalized intersection with the speed of the vehicle; (2) for­warding delay (denoted by df ): when the vehicle catches up to the queue, the message can be immediately forwarded to the downstream intersection by the vehicles in the queue with the speed of wireless communication.
Relationship: reasoning
Domain: Networks
Sentence 1: The response time increases al­most linearly with D. However, as the value of cnt increases and becomes comparable to the total number of vehicles in the target road-segment, a VITP request would have to cover a large percentage of the target vehicles in order to satisfy the Return Condition.
Sentence 2: the query mes­sage would have to re-visit many vehicles before succeed­ingto discover unvisited vehicles.
Relationship: reasoning
Domain: Networks
Sentence 1: The user-centric service creation and execution model will repel the operators for a number of reasons: loosing total control over the customers and the deployed services, revolutionary changes to the existing IMS service model, dependency on the expertise of the end users, etc.
Sentence 2: an IMS service model that secures the interests of all three parties the operator, SPs and the end users is needed to build.
Relationship: reasoning
Domain: Networks
Sentence 1: According to Kanaparti [3], in order to allow an enterprise to create unified communications solutions designed to work with its own set of applications and technologies, adherence to open standards is key.
Sentence 2: enterprises will continue to have a choice: to install multiple applications from a single vendor or have the option to incorporate best-of-breed products from proprietary and open source domains, considering that both adopts open standards.
Relationship: reasoning
Domain: Networks
Sentence 1: In other words, if an attacker has spent 10 hours get­ting the secrets from one node, he/she might have to spend another 10 hours to do the same thing for another node.
Sentence 2: achieving non-repeatability is a unique objective for code obfuscation in sensor networks because of the large number of sensor nodes in typical sensor-network applica­tions.
Relationship: reasoning
Domain: Networks
Sentence 1: the virtual sensor is T k 1 Ev = kev k2Q( v )(et + er) (32) ks 2 0.1 The threshold vTwhich evokes cooperation decreases as Non-cooperative k max =2 k max =3 k max =4 k max =5   0 200 400 600 800 1000  ks Global Missing Probability the number of cooperating nodes k increases.
Sentence 2: q( vT) increases with k. We have Ev >k3Q(T/s)er/2, ks thus the virtual sensor energy consumption is at least O(k3).
Relationship: reasoning
Domain: Networks
Sentence 1: Speci.cally, if destination Y allocates a smaller guarantee than sender X (i.e., BX.Y >BX.Y ), and X Y if Y marks this .ow as unbounded3, meaning that Y allocates to X.Y its maximum fair share, the sender simply deems the demand of the .ow as the destination s guarantee and hence sets BX.Y = BX.Y X Y for the next epoch.
Sentence 2: our approach ensures that taking the minimum of source and destination VM-to-VM guarantees does not limit VMs from achieving their hose model guarantees.
Relationship: reasoning
Domain: Networks
Sentence 1: theglobaltopologyolletionandsheduledistributionre­quirementsofUxDMArenderitimpratialformobilead honetworksorlargeadhonetworks.
Sentence 2: anumberoftopology-transparentshedulingmethodshave beenproposed[6][18][19]toprovideonfit-freehan­nelaessindependentlyoftheradioonnetivityaround anygivennode.Thebasiideaofthetopology-transparent shedulingapproahisforanodetotransmitinanumberof timeslotsineahtimeframe.Thetimeswhennodeitrans­mitsinaframeorrespondstoauniqueodesuhthat,for anygivenneighborkofi,nodeihasatleastonetransmis­sionslotduringwhihkandnoneofk'sownneighborsare transmitting.withinanygiventimeframe,any neighborofianreeiveatleastonepaketfromionfit­free.Thelimitationofthetopology-independentsheduling approahesdesribedtodateisthathoosingashedulede­pendsonthesizeofthenetworkandthemaximumdegree ofthenetwork,whihislesssalable.
Relationship: reasoning
Domain: Networks
Sentence 1: The cross-traf.c intensity at link Li is denoted by .i.We assume .i <Ci for 1= i= N. Since none of the links in P is congested, the arrival rate of .ow jat any link it traverses is xj.
Sentence 2: we have .i =xri <Ci, 1= i= N. (4) We further de.ne the path con.guration of P as the fol­lowing 2× Nmatrix C1 C2 ... CN H =.
Relationship: reasoning
Domain: Networks
Sentence 1: Then, by the shortest path property, we have cvu+Dud =Dvd<cvw+Dwd (12) This implies that Dvd;Dwd <1 (13) c vw and Dvd;Dud =1 (14) c vu Using equations (13) and (14), we get Dvd;DudDvd;Dwd (15) cc vuvw Using equation (15) and the fact that V(x)is a monotonically increas­ing linear function of x, we conclude that V(Dvd);V(Dud)V(Dvd);V(Dwd) (16) cc vuvw In other words, the force in the direction of uis maximum and positive.
Sentence 2: sPP chooses uas the next hop.
Relationship: reasoning
Domain: Networks
Sentence 1: (b)Two-Round Scheme you transmit redundancy, r1 , in addition to the native packet then you can deliver p(r1 ) fraction of packets.
Sentence 2: we want to choose the r1 that maximizes p(r1 ) max (1) r 1 + r1 We solve this optimization numerically for the empirical CDF of the amount of redundancyrequired to recover a partial packet using a symbol size of8bits, i.e., the graph inFigure 15(a).
Relationship: reasoning
Domain: Networks
Sentence 1: Communication is commoly assumed to dominate the en­ergy consumption of each sensor and, thus, we disregard any other energy spent in other tasks as sensing, processing and when the sensorisidle[4].
Sentence 2: thelifetime(andthe energy hole problem) is closely related to the total amount of messages transmitted by the nodes situated either one hop away from the sink or H-sensors 3 .
Relationship: reasoning
Domain: Networks
Sentence 1: (2) The solution of the equation is Xa = 0or Xd = 0, i.e., either Node a or Node dmust be collinear with Nodes band c. This contradicts the fact that Nodes a, b, c and d form two triangles.
Sentence 2: if Lad is known, one can readily determine whether Node a and Node dare on the same side of Edge bc.
Relationship: reasoning
Domain: Networks
Sentence 1: jC-t = (jA -t)dFX(x) (j-1)C+A-t .
Sentence 2: jC-t = (jA -t) dFX(x) (j-1)C+A-t = (jA -t)[FX(jC -t)-FX[(j-1)C + A-t]] = (jA -t)FX(jC -t)-(jA -t)FX[(j-1)C + A-t]  .
Relationship: reasoning
Domain: Networks
Sentence 1: QSI1 and QSI2, on the other hand, target the product of lasR and lasI tran­scription, namely, the LasR receptor and AI, which have signi.cantly higher molar concentrations compared to the lasR gene in the cells; this requires a much larger amount of QSI for e.cient inhibition.
Sentence 2: since we use the same degradation rate and the same dosage for all three QSIs, QSI3 can remain e.ective for much longer than QSI1 and QSI2.
Relationship: reasoning
Domain: Networks
Sentence 1: In other words, I is the collection of the subsets of .. which can transmit successfully at the same time over the same channel.
Sentence 2: note that .. can be regarded as a generalization of the conventional con.ict graph of the underlying SC-SR wireless network by adding a self-loop at each link and assigning each edge a weight speci.ed by the function ...I is essentially the collection of the independent sets of links in the underlying SC-SR wireless network.
Relationship: reasoning
Domain: Networks
Sentence 1: you imagine parameter A to model the CR s power output and parameter B to be its data rate, it becomes evident that parameter A and B cannot be assumed to operate in isola­tion.
Sentence 2: we have to populate our model with additional terms that account for any interactions between any set of variables, thus r = wA * fa + wB * fb + wC * fc + wA:B * fA:B + wA:C * fA:C + wB:C * fB:C + wA:B:C * fA:B:C  or in the general case: P r = w0 + i wifi .i .
Relationship: reasoning
Domain: Networks
Sentence 1: To study the impact of propagation RTT on the RD ser-Link z1-z2 Link y1-y2 vices, we vary M from 80 ms to 1.5 s. As the maximum propagation RTT grows, the per-.ow amount of packets in­ side the network increases.
Sentence 2: the TCP .ows enjoy lower loss rates.
Relationship: reasoning
Domain: Networks
Sentence 1: Figure 4(a) shows the percentage of back-of.ce traf.c of the to­tal Web traf.c for each vantage point as a stacked bar plot.
Sentence 2: we depict the volume of back-of.ce traf.c found with the different methods: (a) information from the CDN only (the bottom bar), (b) information from the IPs-CDN and IPs-DPI+Manual (the sum of the bottom and the middle bar), (c) all information including ZMap (the sum of all bars).
Relationship: reasoning
Domain: Networks
Sentence 1: Search in Maude-NPA In this section we give a high-level summary of the general ap­proach advocated in this paper for formally analyzing protocols modulo theiralgebraicproperties, withparticularattentiontothe way this approachisimplementedinMaude-NPA.Forfurtherin­formation,please see[21,22].
Sentence 2: given a protocol P,statesare modeled aselementsof anini­tial algebra TSP /EP ,where SP isthesignaturede.ningthe sorts andfunctionsymbols(forthe cryptographicfunctions andforall the state constructor symbols) and EP is a set of equations spec­ifying thealgebraic properties ofthecryptographicfunctions and thestateconstructors.astateisan EP -equivalence class [t] .
Relationship: reasoning
Domain: Networks
Sentence 1: Otherwise, we can verify rq (0) x that DecryptNode(CT,SK,x)= e(h, g) .
Sentence 2: the decryption algorithm begins by simply calling the function on the root node R of the access tree T. If the tree is satisfied by S, then we set A= rq (0) rs DecryptNode(CT,SK,R)= e(h, g) R = e(h, g) .
Relationship: reasoning
Domain: Networks
Sentence 1: Observe that rv is the mean of this distribution.
Sentence 2: since by linearity of w expectation variance is additive, the sum of k - 1 indepen­ v dent estimations of rv has standard deviation T(J /(Bk)), w implying that we have a constant probability that an error in this order occurs.2 with probability 1/2, any ap­ 1If messages of v are triggered by messages of w or other nodes, the error gets even larger.
Relationship: reasoning
Domain: Networks
Sentence 1: Figure 4: Vulnerability distance with respect to the correlation of keys in VANETs For decreasing the probability of track attack and mini­mizing the storage cost, we set the best pseudonym changing ' interval ta little larger than the time that a vehicle moves ' do+2×r within the vulnerability distance: tvo sec.
Sentence 2: furthermore, in order to prevent attackers from knowing the right timing to broadcast bogus messages, we let the pseudonym changing interval Tp be uniformly distributed ' between [0, 2t]: { 1 '2×t" , 0 = tp = 2 × t' fTp (tp)= ,E(Tp)= tsec (3) 0,otherwise the attackers cannot acquire the exact pseudonym changing time, and choose a proper timing bene.cial to it to send bogus messages without being evicted.
Relationship: reasoning
Domain: Networks
Sentence 1: In the above model, the number of losses Lt seen by a .ow is i determined by the queue management algorithms used.This fact is discussed in greater detail in the next section.
Sentence 2: it should be noted, however, that we do not claim that this model is realistic.We only claim, and show in our later results, that it reproduces the TCP Game behavior seen in the more realistic simulations.it appears to capture the aspects of reality most relevant to the question we are addressing.
Relationship: reasoning
Domain: Networks
Sentence 1: Crucially, the recipient cannot distinguish between hash values and random bitstrings, and thus has no way of knowing whether a given value in the proof is the label of an inner node or a dummy node.
Sentence 2: a bit proof does not leak any information about the presence or absence of any pre.xes in the MTT, other than the speci.c pre.x to which the bit belongs.
Relationship: reasoning
Domain: Networks
Sentence 1: Each source node is creating data tra.c with a .xed data rate .
Sentence 2: bps, that must be delivered to one of the destina­ [] 4aD2W d C(n) =n log n. (6) log 2 we have that: 1 o= d, when 0 <d< , 2 1 1 =o=d, when <d<1.
Relationship: reasoning
Domain: Networks
Sentence 1: Assume that signal power decays as 1/da, with the distance d and path-loss exponent a, the maxi­mum range A in dB attenuation corresponds to a maximum dis­tance dmax as « Psend A =10log=10a logd.
Sentence 2: 10 10 Precv we can estimate the proportional increase in range stem­ming from a .A dB increase in maximum attenuation (say, from 10A2/(10a) .A/(10a) A1 to A2)as d2 = 10A1/(10a) =10.
Relationship: reasoning
Domain: Networks
Sentence 1: Each node maintains a path list in its route cache and the path, following the rule that the first node is destination node and the last is source node, is recorded.
Sentence 2: assume that the link (D, E) is broken, there is no other path to the nodes A, B, C, O, P and Q. the states of those paths travel (D, E) will be set to fail and node E will notify its upstream node F. First, node F checks its route cache and updates the states of the paths, which travel (D, E), to be fail.
Relationship: reasoning
Domain: Networks
Sentence 1: Whenever the bu.er level falls below a speci.c threshold, both links will be fully utilized until the bu.er level exceeds the threshold f. Thereafter, the 3G mo­bile link will be disabled and only the Wi-Fi link is utilized again.
Sentence 2: the required throughput can only be set to either maximum bandwidth or 0.0 Mbps.
Relationship: reasoning
Domain: Networks
Sentence 1: However, as most exist­ing systems like Vivaldi [3] are based on a Euclidean dis­tance model, the Triangle Inequality Violations (TIVs) have been a major cause of inaccuracy in estimation.
Sentence 2: several studies have been made to attenuate the impact of TIVs, among which is the two-layer NC systems like Pharos [2].
Relationship: reasoning
Domain: Networks
Sentence 1: For each request, rl, we can compute a distance dl that is the num- ber of positions up the stack that the requested document is moved.
Sentence 2: a request string rl,r2,.., r .... Can be con- verted into a distance string dz, d2,.., d,... that preserves the pattern of activity, but does not depend on document names.
Relationship: reasoning