sadat2307/MSciNLI huggingface dataset:
Domain: Networks
Sentence 1: How­ever, given that we used a real network topology, along with a real demand schedule from that network, we feel reasonably con.dent that in the 10 to 30% threshold range, we would see similar perfor­mance in other scenarios.
Sentence 2: it would be advantageous to set the thresholds at the high end of the (10 to 30%) range to reduce the number of messages.
Relationship: reasoning
Domain: Networks
Sentence 1: The radius of an AS, the distance from the center, is computed based on the out-degree of the AS that is a number of its outgoing links (shown in Equation 1) so that ASes with higher out-degree are placed closer to the center.
Sentence 2: the AS Core Map allows to identify AS structures by the geographic locations of ASes and their coreness based on the out-degree.
Relationship: reasoning
Domain: Networks
Sentence 1: When local minima oc­cur frequently, the shortest path length may also be grow­ing, so the stretch does not necessarily change monotonically with K. Nevertheless, as our analysis and simulation will show, K (and hence LMD) can serve as a convenient con­trol knob for an algorithm s performance, which typically meets its worst case either at the ends (e.g., O(N)) or right v in the middle (i.e., O( N )of K s complexity range, and changes monotonically elsewhere.
Sentence 2: the TA model not only provides a framework for us to derive an algorithms scaling properties, which may otherwise be elusive to ob­tain, but also o.ers an easily controllable tool for average case performance evaluation.
Relationship: reasoning
Domain: Networks
Sentence 1: In this case the number of links traversed, can be calculated as the average time to absorption by the last node L, starting from 0, at the following Markov chain of Figurel 1. i p 'i-/~ ...... X ~ Figure 11. packet-hops for a uniform chain Let E i be the average time to absorption by state L, given that we are in state i.
Sentence 2: being in state E i means that the packet coming from the source was dropped just before the node i. Et.=O, EL-I =1 +pEo, EL.2 = 1 +pEo+(1-p)EL-I ..... Eo= 1 +pEo + (1 -p)El E° (1 - p)L ~ (I - p)/.-I ¢- "'" + ~ = p -1 (2) This procedure can also be applied to a non-uniform chain.
Relationship: reasoning
Domain: Networks
Sentence 1: 3.1 Simple Random Network Coding Algorithm(SRNC) Using the SRNC algorithm, the sender is assumed to have no knowledge about which packets are at which receivers.
Sentence 2: at every time slot, the sender generates and broad­casts a mixed packet c = v1p1 + v2p2 + ··· + vDpD, where vi s are drawn uniformly at random from the .nite .eld GF (F).
Relationship: reasoning
Domain: Networks
Sentence 1: Moreover, if a roadside router RRi that is supposed to forward the FTQoSRep msg detects the failure of the link to the next RRj that is also supposed to forward the message, then, RRi sends the FTQoSRep msg with a force broadcast .ag.
Sentence 2: all the neighboring road compo­nents that will receive the FTQoSRep msg with the force broadcast .ag activated, will forward the FTQoSRep msg even if they are not closer to the requester than the sending RR.
Relationship: reasoning
Domain: Networks
Sentence 1: According to this de.nition, we could rank the features into classes for the features of which hold same number of high correlated features.
Sentence 2: we rank the revealing example in Section 3, and .nd that f2 , f3 , f4 and f5 can be categories into a class, and f1, f6, f7 can be classi.ed into another class.
Relationship: reasoning
Domain: Networks
Sentence 1: 2.2 One-Packet Techniques BellovinandJaobsonusetheone­paketdelaymodeltode­velopatehniqueformeasuringlinkbandwidths.Although Equation1speifestheone­waydelay,BellovinandJaob­soninsteadusetheround­tripdelaytosuessiverouters alongapath.Theround­tripdelayanbemodeledasthe sumoftheone­waydelayfortheinitialpaketandthatof itsaknowledgement.
Sentence 2: bellovinandJaobsonresolvetheproblematiassumption aboutnoqueueingbyobservingthatqueueingausedby additionaltraÆanonlyinreasedelays.the minimumofseveralobserveddelaysofapartiularpaket sizeftsthemodel.Theirtehniqueistosendseveralpak­etsforeahofseveraldiferentpaketsizes,plotthedelays ofthesepaketsversustheirsizes,andthenuselinearre­gression(Figure2)toobtaintheslopeofthegraph.The inverseoftheslopeisthebandwidth.
Relationship: reasoning
Domain: Networks
Sentence 1: The total number of bits to be matched is 8 times the number of bytes considered at a time (B).
Sentence 2: equa­tion 7 becomes « NBLSM 8 · B = (11) Nsubset b And Equation 8 will be rK/kl 8·B/b X X T (k, b, B ) = ' ij · (k + e · eij ) (12) j=1 i=1 with eij = =log2 ' ij = (13) and e(b) = 2b (14)  4.
Relationship: reasoning
Domain: Networks
Sentence 1: The MRDS uses the link-layer data frame checksum to de­tect errors in the MRD-ACK packet.
Sentence 2: the size of the MRD-ACK payload is small (25 bytes in our implementation).its overhead is largely domi­nated by the preamble and header associated with the 802.11 frame.We can potentially decrease overhead further by pig­gybacking MRD-ACK packets on data frames being trans­mitted in the same direction.
Relationship: reasoning
Domain: Networks
Sentence 1: Interestingly, we were not able to .nd evidence that Maude-NPA was generating any in.nite paths in its search.
Sentence 2: rather, the use of homomorphic encryption gave the intruder so many opportunitiesfor generatingdifferent typesof statesthatit overwhelmedthetool.thisprotocoldid turn outtoprovide anexcellent opportunityforstresstesting, andlikely willbe useful forbenchmarkinginfuture work.
Relationship: reasoning
Domain: Networks
Sentence 1: Packets re­ceived on an incoming interface are passed to NetEm which processes the packets according to the con.gured impair­ment factors before enqueuing them on the outgoing in­terface.
Sentence 2: as indicated in the .gure by means of distinct impairment function symbols, NetEm impairment parameters can be set on a per-interface base, which is a pre-requisite for modeling unidirectional links.
Relationship: reasoning
Domain: Networks
Sentence 1: However, it increases system s complexity and re­duces the access reference locality of anygiven .le, since requests are spread across manydeltas.
Sentence 2: from our data, we can observe that 90% or more of all users can be satis.ed by very few deltas of re­centversions(e.g.2-3).averysmallsetof deltasissuf.cient to patchmost users, thereby,decreasing the need for publishing and archiving a large number of older deltas per .le.
Relationship: reasoning
Domain: Networks
Sentence 1: The goal is not to facil­itate generic programmability of the access point, but to  Figure 3: Conceptual model of the Router Core run a light-weight messenger between layer-2 of the AP and layer-3 of the access router.
Sentence 2: its tasks include: (1) Monitoring the state and channel quality for each of its as­sociated hosts, as reported by the device driver.
Relationship: reasoning
Domain: Networks
Sentence 1: NetLord mostly ignores anytenant-visible L3 issues (except as discussed in sections 3.2 and 3.9).
Sentence 2: by placing no re­ strictions on how tenants assign L2 or L3 addresses, NetLord pro­vides full address-space virtualization: multiple tenants can use the same address without having their packets mis-routed.
Relationship: reasoning
Domain: Networks
Sentence 1: To see how this is possible, recall that in traditional, determinis­tic forwarding, a link is selected to forward data packets if it makes good progress toward the desired destination, and can support the desired bit-rate with an acceptable prob­ability of success.
Sentence 2: deterministic forwarding neglects links that can deliver packets closer to the desired destination, but that have large transmission error proba­bility.
Relationship: reasoning
Domain: Networks
Sentence 1: This is be­cause, for the pedestrian model, even if the cameras are not con.gured with optimal FoVs, as long as they are focused on the streets, the moving targets themselves will enter the FoV region, eventually.
Sentence 2: irrespective of camera and target density, Greedy can be a policy of choice for tracking targets moving on streets, since it provides near optimal coverage based on purely local decision (i.e.
Relationship: reasoning
Domain: Networks
Sentence 1: According to the result of the polynomial-based key predistribution, as long as no more than t polynomial shares of a bivariate polynomial are disclosed, an at­tacker knows nothing about the non-compromised pairwise keys established through this polynomial.
Sentence 2: the security of our scheme depends on the average number of sensors sharing the same polyno­mial, which is equivalent to the number of sensors that are expected to be located in the corresponding cell and its four adjacent cells.
Relationship: reasoning
Domain: Networks
Sentence 1: Badinteractionwith TCPForwardRTO-Recovery(F-RTO) SincePAWSmakes thebufferedpackets useless tothe receiver, we were wondering whether letting the receiver accept the buffered packet would reducethenegativeimpact ofbuffering onTCPper­formance.
Sentence 2: wedisabledtheTCPtimestampoption onthe sender side and repeatedthe experiments to measurethedownload­ing time.
Relationship: reasoning
Domain: Networks
Sentence 1: Let N denotes the preset number of turbo iterations.
Sentence 2: in the SL-PC, 2TMSN(k-1) (MS + 1) arithmetic additions is required to update variables in (12) and (13), while in LLR-PC, TMSN(k -1) log2 |S| arithmetic additions is required to up­date variable in (17).
Relationship: reasoning
Domain: Networks
Sentence 1: However, certainly these differences are lower bounded by k(1 - e)B/2 for some e « 1, since hardware clocks progress roughly at the rate of real time.
Sentence 2: inserting this bound, the error of the scheme is dominated by the absolute value of the random variable mD X := 4 ..(Xi+k/2, j - Xi, j) k2(1 - e)B i=1 j=1 with expectation E[X]= 0.
Relationship: reasoning
Domain: Networks
Sentence 1: We say that A is larger than B or A > B, if and only if FAA.NEA > FAB.NEB or PAA.NEA > PAB.NEB while FAA.NEA = FAB.NEB or IDA > IDB while PAA.NEA = PAB.NEB and FAA.NEA = FAB.NEB  According to assumption 7 in section 4, the routing Protocol already has information on all neighbor locations.
Sentence 2: by counting the messages from neighbors, instead of using time schedule, we can trade the chance of having breaching points in the network with a bit more control messages.
Relationship: reasoning
Domain: Networks
Sentence 1: x 104 12000 (TCP) will be a.ected by the routing protocol.
Sentence 2: we 10000 see that that de.ciencies pertaining to the end-to-end-ness 8000 of the routing protocol can only be pointed out using TCP 60003 .ows for evaluation and we should try to improve the routing 40002 protocol s behavior such that it a.ects TCP performance 1 2000       TCP UDP 5 10 15 20  Pkts.
Relationship: reasoning
Domain: Networks
Sentence 1: We define a multicast flow as a collection of flows along di- rected trees (rooted at the source and reaching all receivers) obeying the capacity constraints for each arc.
Sentence 2: for a network G = (N,A) with node set N, are set A, arc ca-pacities cij, source s and set of receivers R C_ N -{s}, any multicast flow is identified with a collection of directed trees {T1, T2,... , Te} rooted at s and reaching all nodes in R and associated flows {xl,x2,...,xe} obeying the following ca- pacity constraints: Z f(i,j, Tk)xk < cij V (i,j) E A l<k<~  where 1 and cycles; the cycles don't send arty additional flow from source to destination and hence can be ignored.
Relationship: reasoning
Domain: Networks
Sentence 1: Our centralized al­  (a) Divide the space into 11 cones radius r2 k can be placed inside the disk R(vk,3a).
Sentence 2: there ex­ists a node set in V1 with size at least |Vk 1|/(6a+1)2 such that k each node in the set interferes with each other.
Relationship: reasoning
Domain: Networks
Sentence 1: In the following, we will use the notation .G T (q) to access the correlated workload release times of the tuple, which .G(q) returns, and .G W (q) to access the correlated workload arrival.
Sentence 2: the minimum distance between the .rst and the last frame of a sequence of any q workload correlated frame arrivals of G can be de.ned.
Relationship: reasoning
Domain: Networks
Sentence 1: (MGF Envelope for Arrivals) An arrival process A(t) is bounded by an MGF envelope, with rate r and scaling factor M, for some choices of a parame­ter .> 0, if for all 0 = s = t .A(s,t)= Me.r(t-s) Ee .
Sentence 2: tra.c is by de.nition essentially unknown but subject to regularity constraints [12].
Relationship: reasoning
Domain: Networks
Sentence 1: To change the directions of edges in path from sj1 to sjy in T2,the transmission power of Sji must be adjusted to p(sji-1), 2 = i =y by Lemma 5.
Sentence 2: if the power p(sjy )of Sjy is less than the power p(sjy-1) of its parent node Sjy -1 in T2, then, the extra power (except the powers used in X1' ) for this tree merge is p(sjy-1) -p(sjy ) =p(sjy-1).
Relationship: reasoning
Domain: Networks
Sentence 1: We then compute the signaling density, de.nedbyNtrans/Npackets,for eachtype of network applications whose Npackets is greater than 0.1% of the overall uplink traf.c observedfromtheRNC.Thisavoidshaving avery largeratiodue tothe very small number ofpackets observed.
Sentence 2: an application is signaling-prone ifNtrans/Npackets ishigh, or signaling-averse if Ntrans/Npackets is low.
Relationship: reasoning
Domain: Networks
Sentence 1: Since nij are independently dis­tributed Gaussian noise with variance s2 , the sum of nij will be a Gaussian noise with variance of ks2 .
Sentence 2: the false alarm probability of the virtual sensor is: k X v pfv = P{ nij > kT } j=1 v kT = Q( v )= pfp (16) ks2 the virtual sensor has the same false alarm probability as the physical sensors.
Relationship: reasoning
Domain: Networks
Sentence 1: In LQS, failed connection attempts to previously o.ered services are not considered as the OP S and CPS tables keep track of previously open ports in the monitored network.
Sentence 2: the high detec­tion rate in LQS is not at the cost of high false positive rate (the same can also be inferred from our empirical evaluation on both datasets; see Section 5).
Relationship: reasoning
Domain: Networks
Sentence 1: Theprevi­oussectionshowedhowvariousfactors such astopology,SNR of alink,carriersensing rangeand receiversensitivity determinethe interactionbetweentwolinks, andhencedecidetheperformance of the network.
Sentence 2: the approach we take(InteractionEngineering) controls one or more of the transciever parameters to control the interaction modesbetween the competinglinks.
Relationship: reasoning
Domain: Networks
Sentence 1: 0 2s Over the same interval, the amount of .uid in Q2 at time t is given b2 +(s - µ)t. Thus, the total congestion cost lT0 incurred at Q2 over [0,T0]is c(b2 +(s - µ)t) dt = 0 () cb1b2 cb21 µ +1 - .
Sentence 2: now, the amount of .uid in Q2 at s 2ss ()µ time T0 is B2(T0)= b2 + b1 1 - .Q2 drains com­ s 'B2(T0) pletely at time T0 = T0 + and the amount of .uid in µ Q2 at time t for t .
Relationship: reasoning
Domain: Networks
Sentence 1: 6, the paging areas are modeled as identical mesh planes.
Sentence 2: the number of subnets considered in a paging area, Np, can be obtained as follows: ( ) Np = minN, 4Ns 2 +4Ns +1 (8) Cis denoted as the total signaling costs when an MN idle is in the idle mode in the DP-MIPv6 scheme.
Relationship: reasoning
Domain: Networks
Sentence 1: The probability of .nding a point inside a small area element dA about r *Aat a random time instant is proportional to E[p .dA]where p denotes an arbitrary line segment.
Sentence 2: e[(p .dA)/(v ·v(r))]f(r)= E[T ]·dA E[(p .dA)]·E[1/v]·1/v(r) E[(p .dA)] = = .
Relationship: reasoning
Domain: Networks
Sentence 1: Under contention, a node has to wait for a certain number of idle slots chosen at random in the range of [0,cw -1], where cw is the so-called con­tention window.
Sentence 2: the total delay until retransmission = D+ DMAC,where DMAC is the component in­ is Dtotal curred by the contention resolution algorithm of the MAC layer.
Relationship: reasoning
Domain: Networks
Sentence 1: 3.2 Shortest temporal distance In essence, shortest temporal distance (tij ) provides the minimum time (using epidemic forwarding) it would take for some information to travel from node i to node j.
Sentence 2: to compare e.ciency of an underlying forwarding scheme to send requests to di.erent nodes in network, we simply com­pare this lower bound on the propagation time.
Relationship: reasoning
Domain: Networks
Sentence 1: A similar property can be observed in our case: in Figure 2, we plot the average aggregated throughput (the system throughput) obtained by 5 cheaters, all of which use the same contention window size; the simulation setup used here are described in Section 4.1.
Sentence 2: we conclude that our game admits a unique CWopt solution CWiopt = j ,i,j =1,··· ,C. We apply this property to our game model and assume that the contention window (CW) size for all nodes are the same so COST is reduced to COST ={cost =(Cost1,··· ,CostC ): Costi = fi(CWi),i =1,··· ,C; CWi .
Relationship: reasoning
Domain: Networks
Sentence 1: Vehicle arrivals and departures during a tagged vehicle s sojourn time T the (j-1) vehicles left behind is the number of new vehicle arrivals during our tagged vehicle s sojourn.
Sentence 2: n(t) is a random process with (i-1) down-steps and (j-1) up-steps, starting with N(0) = i, and ending with N(T)= j.
Relationship: reasoning
Domain: Networks
Sentence 1: Recall that ord(ai) = 2 and e is an odd number (due to e .
Sentence 2: z* f(n) ' ' se )e and f(n) = 4pq), so we have ¯A = (aih(m)d mod n = aih(m) mod n. Bob can get the value of ai by computing ai = ¯Ah(m)-1 mod n. It is well known that se with the knowledge of such a non-trivial element of order 2, Alice s RSA modulus n can be easily factored, i.e., (ai - 1) and (ai + 1) are the two prime factors of n. Consequently, Bob can get Alice s private key d by using extended Eu­clidean algorithm, and then obtain the value sA by comput­ing sA = h(m)d mod n. Based on the above discussion, we conclude that case (c) does not happen in the real world unless Alice wants to re­veal her private key.
Relationship: reasoning
Domain: Networks
Sentence 1: But Pmax,BS and Pmax,MS are adjusted to receive the constant value at the BS from the MS which is in the edge region of the cell, and vice versa.
Sentence 2: when re is .xed and d increases, Pmax,BSneighbor and increase in proportion to the .th power Pmax,MSneighbor of the neighbor cell coverage.
Relationship: reasoning
Domain: Networks
Sentence 1: The.rstmethodistopartitionlinksintog(L) differentgroupssuchthatthespreadoflinksineachgroupisconstant,hereg(L)= log .
Sentence 2: (L) isthelengthdiversity.wecandesignamethodforweightedlinkschedulingwithaconstantapproximationratioforlinksinagroup.Thesecondmethodistopartitionlinksintoanotherdifferentgroupssuchthattheweightsoflinksinanygrouparewithinaconstantfactorofeachother.Again,wecandesignamethodforweightedlinkschedulingwithaconstantapproximationratioforlinksinagroup.
Relationship: reasoning
Domain: Networks
Sentence 1: In particular, even with a median 3.7 cm error on points along the trajectory, the shape of the overall trajectory is still preserved, because this error only re.ects the coherent stretching or squeez­ing of the trajectory.
Sentence 2: the handwritten characters re­constructed by RF-IDraw are correctly recognized by MyScript Stylus in 97.5% of the cases, and the words reconstructed by RF-IDraw are correctly recognized in 92% of the cases.
Relationship: reasoning
Domain: Networks
Sentence 1: of less than 2 of the probability for any other node.
Sentence 2: now as men- tioned above, the number of nodes at level d + 1 and beyond is at least some constant, say '7, times the number of nodes in levels d - 1 and d. the expected number of nodes in levels d + 1 and beyond that connect to s2 is at least a constant fraction (around -~) of the expected number of nodes in levels d -1 and d that connect to s2.
Relationship: reasoning
Domain: Networks
Sentence 1: Temperature information can be obtained by the temperature sensor and the clock skew is obtained based on timestamp exchange [1].
Sentence 2: the TSF at the i-th TSF estimation period can be updated as: g(.a[i]) T SF [i] = f(.T [i], T0) g(.a[i]) and f(.T [i], T0) express the temperature varia­tion and the clock skew variation during the i-th TSF esti­mation phase.
Relationship: reasoning
Domain: Networks
Sentence 1: A} The probability of the Markov chain (Xn)n=0 ever ends at A after starting from state i is: hAi = Pi(HA < 8).
Sentence 2: the mean time taken for (Xn)n=0 to reach A is given by KiA = Ei(HA)= n<8 nP(HA = n)+8P(HA = 8).
Relationship: reasoning
Domain: Networks
Sentence 1: (V M S T (c|3d3)) + d3 = 2M -(M -E) + M - E = 2M and the utility of terminal v3 becomes u3(c|3d3) = 2M - (M + E) = M - E, which is larger than u3(c) = 0.
Sentence 2: vCG mechanism based on VMST is not strategy-proof.
Relationship: reasoning
Domain: Networks
Sentence 1: We have chosen to emulate web tra.c on nodes B through E because we assume that the wired Internet is not the bottleneck.
Sentence 2: since the access tier bandwidth is not accounted for in our multihop experiments (that is, there is no access tier contention), if node A were also em­ulating web users, the only e.ect would be an increase in load over the wired connection to the Internet.
Relationship: reasoning
Domain: Networks
Sentence 1: Proof of Theorem 5: From Lemma 7 and Corollary 1 results that at each iteration the load balancing algorithm detects the current load and fairness bottleneck groups,de­noted as Lk and Fk,and their user-AP association.
Sentence 2: at each iteration,the algorithm reduces the size of the AP and user sets until a complete min-max load association is detected.
Relationship: reasoning
Domain: Networks
Sentence 1: SYSTEM MODEL The network model consists of N equal-capability nodes with unique IDs, randomly distributed in 2D plane.2 The transmission range of all nodes is R [meters].
Sentence 2: two nodes are referred to as 1­hop neighbors (or simply as neighbors) and can communicate directly if the distance between them is less than R. the network can be modeled as a Unit Disk Graph (UDG).
Relationship: reasoning
Domain: Networks
Sentence 1: The di.erences are that (i) the messages are sent in the oppo­site direction (the initiator is the STA, while in the 4WH it is the AP), (ii) the .rst message is authenticated, while in the 4WH it is not and (iii) PMK is negotiated by the .rst two messages.
Sentence 2: assuming that PMK is secretly distributed, our protocols, together, are more secure than the 4WH, which is considered secure.
Relationship: reasoning
Domain: Networks
Sentence 1: Then, the predictive control system Jc min­imizes the energy consumption and tries to reach the refer­ence signal RT =[11...1]r(k), where [11...1] is a 1 × 2Np s identity vector; we assume that the reference signal re­mains constant in the optimization window, where r(k)= [rl (k) rg(k)]T , rl (k) is the indoor luminance reference and rg(k) is the re.ected glare angle reference at kth sample.
Sentence 2: the objective is to .nd the best actuation vector (in Lux) .U =[.u(k) ....u(k + Nc - 1)]T such that we mini­mize Jc, where u =[ul ub]T , ul is the arti.cial luminance actuation (in Lux), ub is the blind tilt angle (in arc-degree), .u(k)= u(k) - u(k - 1) and Nc is the control horizon.
Relationship: reasoning
Domain: Networks
Sentence 1: fd(q,q )= max ,, (10) q *(d)q(d) where q(d) = max{d,q} and q * (d) = max{d,q *}.
Sentence 2: q and q * are treated as being not less than d, and having done this, the error factor is the maximum ratio, upwards or downwards, by which they di.er.
Relationship: reasoning
Domain: Networks
Sentence 1: These selection rules except rule (1) must be implemented in all border routers as the standard and should not be changed in design­ing the routing control architecture.
Sentence 2: the VR architec­ture which modi.es local pref and next hop attributes can control the forwarding addresses of the next hop in the path to the destination, and therefore can control conventional routers exter­nally without any protocol extensions.
Relationship: reasoning