sadat2307/MSciNLI huggingface dataset:
Domain: Networks
Sentence 1: .Ti nTi Thus, the user s Nash equilibrium is (T,..., T) and the op­timal tari.
Sentence 2: is CP = CP (W)= W/T.the payo.s to the provider and spectrum owner turn into vP (W, CW )= (1 - CW )W, vA(W, CW )= CW W, and the result follows.
Relationship: reasoning
Domain: Networks
Sentence 1: Low-power radios without frequency diversity, we conjecture, are all likely to have similar multi-path rejection capabilities, although they may have widely di.erent ranges if they use di.er­ent modulation schemes (the Chipcon radio on the newer motes uses frequency shift keying and is reported to have a longer reach).
Sentence 2: unless sensor network nodes start using spread spectrum radios (which may use higher power transceivers and which are di.cult to architect in an ad­hoc setting because they require fairly complex lower layer self-organization mechanisms that manage frequency or code acquisition), we believe the existence of the gray area will continue to hold qualitatively in these networks.
Relationship: reasoning
Domain: Networks
Sentence 1: 2 Q(t )+ .d(t ) a 2 ([Qmax(t ) - 1]+)a Now if Q(t ) is large enough, Qmax(t) is large enough, and aM(Qmax+1)a-1 2 · can be made arbitrarily small.
Sentence 2: the ([Qmax(t)-1]+)a conditional expectation of the second term on the RHS of (10) can be made arbitrarily small for large enough Q(t).
Relationship: reasoning
Domain: Networks
Sentence 1: The most straightforward approximation to the through­put of class-i .ows is to approximate the throughput by the available capacity of the bottleneck link along the route of the class.
Sentence 2: the throughput function Gi(c)is given by   ()-1 1 Gi(c)= max , (2) l.Ri cl -rl where c denotes the vector of link capacities and ci its ith component.
Relationship: reasoning
Domain: Networks
Sentence 1: Note that, in this case, the throughput is insensitive to the value of k. This is because when the maximum transmitted power is large, a MH can easily deal with the interference caused by other MHs.
Sentence 2: in each time step, it is possible for a large number of MHs to transmit simultaneously, each at their respective rate boundary (the assigned number of spreading codes to a MH is at the maximum allowable level).
Relationship: reasoning
Domain: Networks
Sentence 1: Thus, the running time for calculating R*(i,n) is O(C(mi; n)log C(mi; n)).
Sentence 2: the run­ l L ning time of Step 6 is O( C(mi; n)log C(mi; n)) since i=1 there are l objects cached and C(mi; n)= mi!/(n!
Relationship: reasoning
Domain: Networks
Sentence 1: With Lemma 4 and Corollary 1 we get: IvtI=Ivt " I (13) f(S, v)= f(S)+ IvtI (14)  v Figure 3: Illustration for the proof of Lemma 7 Equations (12) and (14) then yield: f(S, v) - f(S, w)= IvtI-Iwt " I (15) Part II: Since w .B(T ) and since S are the nodes reachable from edge vw, Lemma 6 implies IvwI=IvtI.
Sentence 2: we can consider a point w " on the line vt which satis.es: IvwI = Ivw " I (16) IvtI = Ivw " I + Iw " tI (17) Set a = v, b = w " c = t, d = t " ,and x = w. With equation (13), (16), and (17) the preconditions of Lemma 1 are satis.ed.
Relationship: reasoning
Domain: Networks
Sentence 1: Note that the .ows that leave the cell, must then enter one of the 8 adjacent cells on that channel (as the corresponding backbone link for a .ow leaves the current cell, and enters an adja­cent cell).
Sentence 2: .ows leaving the cell on a channel can be no more than 8 times the maximum number of .ows entering a cell on any v one channel, which has been established as O(na(n))in Lemma c 23.
Relationship: reasoning
Domain: Networks
Sentence 1: De.nition 1 (Pointwise relative distance) For any two probability distributions a,ß on the same set S, their pointwise relative distance, denoted by r(a,ß), is de.ned as r(a,ß) = min{E= 0 | a= (1 - E)ß}.
Sentence 2: r(a,ß) is the smallest E, such that a(x) = (1 - E)ß(x) holds for every x .
Relationship: reasoning
Domain: Networks
Sentence 1: Each .ow fcontending for an output link makes a re­source reservation characterized by three parameters, a per­hop delay bound D f, a long-term bandwidth requirement hf, and a maximum data burst size Pnf, which is used to h derive the temporal allocation granularity off.
Sentence 2: the .ow fis eligible for at most Pnfunits of service over a time period of b, which we call the service cycle.
Relationship: reasoning
Domain: Networks
Sentence 1: Since estimated distance from the farther mote provides less accuracy generally than the closer anchor motes [23], among the three RSSI values, the first two highest RSSI values can offer a better reliability than the third one.
Sentence 2: in M-MMSE, only two anchor motes with biggest RSSI values are involved in the MMSE estimation process and we get two possible estimated positions.
Relationship: reasoning
Domain: Networks
Sentence 1: In order to take into ac­count the limited communication capabilities of sensors, we stated that the social term involves the position that enjoys the maximum consensus within each node s neighborhood, where a neighborhood is composed only of the sensors within its transmitting/receiving range.
Sentence 2: we assume that at each iteration of the modi.ed PSO algorithm, the sensors exchange information and determine the maximum consen­sus in their neighborhood.
Relationship: reasoning
Domain: Networks
Sentence 1: That means the two camera sets covering these two sub-regions di.er by only one ele­ment, which further implies that one of the two sets includes the other.
Sentence 2: if the sub-region covered by the larger set is chosen to be working, the other sub-region can be covered Figure 8: S1,S2,S3 all cover R and S3 is redundant because the unsafe region of S1 and S2 does not in­tersect with R. at no additional cost.
Relationship: reasoning
Domain: Networks
Sentence 1: However, we can assign at most 2 regular carriers to each user in C. Hence at least 3n -3|A|-2|C|= n-|A|regular carriers are assigned to users in B.
Sentence 2: objectives (2) and (3) can be upper bounded as follows.4 OBJ2 X = Qis min{Qsi ,µi} i = 3 ·(3|A|+(2 + e)|B|+(1 -e)(n -|A|)+2|C|) =3 ·(e|A|+(2 + e)(|T |-n)+(3 -e)n) (4) and OBJ3 X =(Qis)2 -(Qie)2 i = 9|A|+(9 -(1 -e)2)(|B|-(n -|A|)) +9(n -|A|)+8|C| = (2e -e2)|A|+(9 -(1 -e)2)|T | +(2(1 -e)2 -1)n (5) We now consider two cases.
Relationship: reasoning
Domain: Networks
Sentence 1: However, once we insert this level of indirection (through the label in the packet), the service offered by a new routing system need not resemble traditional routing; for instance, such a mechanism might offer a pub/sub interface (as in DONA [11], CCN [10], and other Information-Centric designs).
Sentence 2: oPAE s general approach enables the incremental introduction of new interdomain service models.
Relationship: reasoning
Domain: Networks
Sentence 1: l l2Pl2P ij Similarly,thebandwidththatmustbereservedonlink(j,i) inthedirectionfromjtoicanbeshowntobeCT(j,i) PP BinBout minf(i,j) ,(i,j) g.NotethatCT(i,j)may ll l2Pl2P ij notbeequaltoCT(j,i).
Sentence 2: thetotalbandwidthreservedfortreeTisgivenby P CT CT(i,j)(notethat(i,j)and(j,i)arecon­ (i j)2T sideredastwodistinctlinksinT).Further,sinceweare interestedinminimizingthereservedbandwidthfortreeT, theproblemofcomputingtheoptimalVPNtreebecomes thefollowing: ProblemStatement:GivenasetofVPNendpointsP, andtheiringressandegressbandwidths,computeaVPN treeTwhoseleavesarenodesinPandforwhichCTis minimum.
Relationship: reasoning
Domain: Networks
Sentence 1: If clienta is be­hind other types of NAT, e.g., Address and Portd or Connectiond , the external port of clienta s trial connections will keep changing.
Sentence 2: a trialconnection willbe rejectedby clientb sNAT(because of Address andPort.ltering) evenifitdoeshitthe rightdestination port.
Relationship: reasoning
Domain: Networks
Sentence 1: Otherwise at least one packet from one of the nodes within the distance r from R would not be receivable successfully due to the insu.cient amount of data rate, or in other words, a timely overlapping of at least two packets would not be avoidable.
Sentence 2: the derived ratio is an upper bound on the achievablebit ratepernodewhenconsidering afairdistribu­tion of available bandwidth.
Relationship: reasoning
Domain: Networks
Sentence 1: However, to model the effects of virtual channel multiplexing the mean message latency has to be scaled by a factor, F, representing the average degree of virtual channels multiplexing, that takes place at a given physical channel.
Sentence 2: we can write L, as L,, -- (S,, +F/,) V (1) Before describing how to determine the quantities $,, W~, and V', we determine first the traffic rate on a given network channel, Calculation of g~: Adaptive routing distributes traffic evenly across network channels as it enables messages to use channels in any order that bring them closer to their destinations.
Relationship: reasoning
Domain: Networks
Sentence 1: ER : crl,r - crl,r,p = 0 (3h) Most of the constraints are related to the constraints al­ready known from the basic edge-based routing encoding with slight adaptions and the usage of the new cr,rl,p vari­ables.
Sentence 2: equations (3a) (3g) have the same purpose as Equations (2a) (2g).
Relationship: reasoning
Domain: Networks
Sentence 1: 3.1 Listening Interval Adjustment for PSM From the power profiling in Section II, we know that Wi-Fi consumes low power on PSM state, and it s not always helpful to shut-down Wi-Fi frequently even with paging radio as suggested in previous work [2], simply because one initial startup stage costs power that can sustain PSM for tens of minutes.
Sentence 2: we propose to just use PSM when Wi-Fi gets connected and there is no traffic, and use the longest listen interval granted by AP to save power.
Relationship: reasoning
Domain: Networks
Sentence 1: On the other hand, the mobility pattern used in parks or air­ports is not constrained by the path-ways, and thus can be represented by using the random-waypoint model [6,15,23].
Sentence 2: we consider Pedestrian model and Random Waypoint model to evaluate the performance of the camera recon.gu­ration policies for di.erent target mobility patterns.
Relationship: reasoning
Domain: Networks
Sentence 1: Since the convolutional output bit is produced by taking XOR operations among the current input bit and some past input bits, there always exists some input bit value (i.e., could be 0 or 1) such that the output bit has the desired value.
Sentence 2: we try  5.5.2 Pilot restoration For 802.11g, the four pilots are inserted at the following sub­carriers: 7, 21, 43 and 57.
Relationship: reasoning
Domain: Networks
Sentence 1: The load balancer objective is to minimize the difference be­tween all link utilizations, we choose RMSE root mean squared error (the Euclidean distance) of the maximum link utilization along each server-switch path in the network.
Sentence 2: if the maxi­mum link utilization over every server-to-switch path is equal, our RMSE metric is 0.
Relationship: reasoning
Domain: Networks
Sentence 1: Furthermore, the cost of signaling traffic Csig can be roughly estimated by the reciprocal value of the mean channel holding time [6] 1 Csig "~ E{T~h} " (8) The channel holding time is defined as the time how long a new call or handover call occupies a channel in a radio cell [17] In mobile communication systems, the channel holding time often is a fraction of the call duration T~ which is assumed to be exponen- tially distributed for voice services: fT~ (t) = Dc exp(--#~t) with /~ = 1/E{T~}.
Sentence 2: the channel holding time is the dwell time or the time of the call duration whichever is less Tch.
Relationship: reasoning
Domain: Networks
Sentence 1: At each spot, iLocScan Magnitude (dB) Magnitude (dB) -10 -20 may at most detect 5 AoAs for a given AP; this may not be suf.cient to achieve accurate estimations.
Sentence 2: we of­ten take two observations at each spot, by moving iLocScan slightly off the spot for one meter.
Relationship: reasoning
Domain: Networks
Sentence 1: From (11) and LH using p1 = e z1 ,p2 = e z2 , we have (for z1 >z2), PL * = (d12)a * (d12 )a , PH = .
Sentence 2: k((1/p1 )1/a+(1/p2)1/a)a k((1/p2)1/a-(1/p2 )1/a)a *** PL = P = PH (15) On the ML estimate circle, the locations which give values ** PL and PH respectively are depicted in Figure 2.
Relationship: reasoning
Domain: Networks
Sentence 1: INTRODUCTION In the last decade the crowdsourcing paradigm emerged as a valid technique to solve large-scale problems: the key idea is to delegate to the crowds those tasks that are too costly or time consuming to be handled with traditional ap­proaches.
Sentence 2: recently, crowdsourcing-based systems have Permission to make digital or hard copies of all or part of this work for per­sonal 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: reasoning
Domain: Networks
Sentence 1: To model this choice, we de.ne the random variable X where sent packets represent the possible realiza­tions of this variable.
Sentence 2: mathematically we can write: n n P (X = xi) = 1 (3) i=1 In terms of packet categories, the equation (3) can be written as: P (Data) + P (Ack) + P (RT S) + P (C T S ) = 1 (4) Where P (Data), P (Ack), P (RT S ) and P (C T S) are the respective probabilities that the transmitted packet is of type Data, Ack, RTS and CTS respectively.
Relationship: reasoning
Domain: Networks
Sentence 1: On the other hand, .eld tests are costly and time-consuming and thus have a medium-term or long-term orientation.
Sentence 2: a simulation ap­proach seems to be adequate, motivating us to study the impacts of a selected car-to-x application aiming at the improvement of traf­.c ef.ciency with the help of the commercial road traf.c simulator AIMSUN.
Relationship: reasoning
Domain: Networks
Sentence 1: Though Theorem 4 provides useful guidelines for decid­ing which user to probe, we note that in general the ran­dom variables Wj and Wi may notbe stochastically ordered even when R(Ci) =st R(Cj) for certain values of Qi and Qj.
Sentence 2: moreover, since the weight Qi corresponds to thequeue length of user i, we can not assume any speci.c structure on the values of Qi s. the complete characterization of the optimal policy through Theorems 3 and 4 is available only in limited cases.
Relationship: reasoning
Domain: Networks
Sentence 1: There are at most W subsets found by the algorithm (stored in keep[i,w]), and all of them satisfy the weight summa­tion constraint.
Sentence 2: we only need to show that if none of these selected subsets can satisfy the weight balance con­straint, there does not exist a legal decision subset in D. The key point is, given a weight summation w, there may exist multiple valid subsets, and among them, the subset (denoted by D*(w)) whose last decision has the smallest weight is the most likely to satisfy the weight balance con­straint.
Relationship: reasoning
Domain: Networks
Sentence 1: (nk)) |vip| 2 do not overlap and that Pi and Pp are separated.
Sentence 2: since there is at least one sender vk in Pp and |vivk| < .r(nk), collision must occur between vi and vk.wl,ij (nk)=0 when nk >n * .In other words, wl,ij (nk)= o( 1 )or r2(nk) equivalently wl,ij (n) r1 ).
Relationship: reasoning
Domain: Networks
Sentence 1: Somewhat surprisingly, we .nd throughalargesetof comparison runsthat IEISS matchesthe MIITS-P resultsextremely well.Acloserexaminationof the graph-theoretic structure of our networks explains this wel­come phenomenon: it turns out that, at least for highly ranked wirecenters, their removal usually results in cutting the re­maining graph into disconnectedcomponents that simply dis­allow calls to be routed between manypairs of nodes at any time of day.
Sentence 2: the time-varying and shifting call loads do not matter much.
Relationship: reasoning
Domain: Networks
Sentence 1: To be more precise, the payoff the player gets is v =[v1,v2,...,vN ], where vn equals wn minus the number of times the server attempts the job from client n. By Lemma 1, the demand of a client n is met if the server attempts its jobs at least wn = qn/pn times per interval on average, or equivalently, the client has a non-positive time­based debt.
Sentence 2: to establish the optimality of the largest time-based debt .rst policy, we only need to show that the set A := {z =[z1,z2,...,zN ]|zn = 0, .n} is approachable under this policy.
Relationship: reasoning
Domain: Networks
Sentence 1: The last phase gener­ates an activation plan as such the activation of the current task tq by (uq,rq), satis.es the static as well as the dynamic constraints.
Sentence 2: the authorisation history H is ex­tended to a new valid history H @.q where user(s) = uq ' '' and .k(s ) = .k-1(s ) for all s .
Relationship: reasoning
Domain: Networks
Sentence 1: CHANNEL MAPPING VERIFICATION In this work we do not focus on the analysis with the same number of channels (analysis conducted in our previous work [16]) only with a di.erent number of available channels, thus di.erent period sizes.
Sentence 2: we need to de.ne the Rotation Closure Property for maps with di.erent period sizes (we call it NMmap-RCP).
Relationship: reasoning
Domain: Networks
Sentence 1: For instance, the Multimedia Streaming facilityusestheMobilityAwareness&#38;Managementtocheckthe channel status and to manage the handoff process.
Sentence 2: mobility-awareservices,e.g.,theaudioguide,canhandlestreams viatheMultimediaStreamingfacilitywithouttheneedofexplicit context monitoring and mobility management.
Relationship: reasoning
Domain: Networks
Sentence 1: Fortu­nately, in the context of path switching, estimating the exact val­ues of and is not required, because we are mainly interested in the quality difference between two (or more) paths.
Sentence 2: when computing the difference in PSNR between two paths, the only contributing parameters are the loss factors of the two paths, which can both be estimated in real-time.
Relationship: reasoning
Domain: Networks
Sentence 1: This is possible only if the previous LP requests were not dropped and they include the document actually intended by the user.
Sentence 2: the arrival rate of request batches that cause a queue state net movement of (k, 0), where 0 =k =|xD|, given the current state (j, n),is |xD| L .k,0|j,n = .pW PL[k] PL[i]P {C|i}(1 -P {DL|j, n}) , i=1 (8) where pW is the probability that the inter-request time is less than the WLAN residence time, i.e., .
Relationship: reasoning
Domain: Networks
Sentence 1: With this .exibility, ALPHA signatures can adapt to both infrequent low­volume signaling tra.c and high-volume data transfers, including changes of a data .ow between di.erent traf­.c patterns.
Sentence 2: forged and modi.ed packets can be detected early and .ooding-based DoS attacks can be mitigated e.ectively.
Relationship: reasoning
Domain: Networks
Sentence 1: For simplicity only 3 base stations are assumed to be present in the network, though the model can be extended to any number of base stations.
Sentence 2: the probability of the signal strength at a location (x,y) being (q1,q2,q3) due to the base stations can be expressed as: 1 2 3 Px,y(q1,q2,q3)= Px,y(s = q1).Px,y(s = q2).Px,y(s = q3) where qi is the signal strength value and P i (s) is the signal x,y strength probability distribution function at location (x, y) corresponding to the ith base station.
Relationship: reasoning
Domain: Networks
Sentence 1: case(#payloadip)of TCPfsource,dst,...g=> if((#offsetip)=0)then ... Figure2:AnML-styledescription.Thesyntax#fieldvar isfeldselectionfromarecord.Thetermontheleftof=> isapattern,herematchingthedatatypeTCP.
Sentence 2: possibletypesofpayloadagivenpacketmaybeasked tocarry.thissolutionisnoteasilyextensible.
Relationship: reasoning
Domain: Networks
Sentence 1: It has been discussed in Section 6.2.1 that the methods in [3] require each node to participate in two complete floodings of the field and a number of localized floodings (we assume only one).
Sentence 2: so, the total number of messages transmitted by each node is at least three, and the number of messages received by a node equals 3*d. the total energy dissipation of the sensor field during this process is given as EFlooding = (Esend *3* N) + (Ereceive *3* d * N) where, N =pr2 EFlooding = 3pr2[Esend + (Ereceive * d )] (10) Esend /Ereceive are the energies required to send/receive a message.
Relationship: reasoning
Domain: Networks
Sentence 1: In Table 4, we need to select a vertical borderline to check distance, i.e., the left side of this borderline (number of observed .i >.
Sentence 2: is smaller or equal to this value) is regarded as u,vd dist(lu,lv)d. the false positive probability is the total probability of its right side cells for case of same location, while the false negative probability is the total probability of its left cells for the case of nearby locations.
Relationship: reasoning
Domain: Networks
Sentence 1: Let us further assume that the iSCSI connections have negotiated to allow 64 Kbytes of unsolicited data to be sent for each SCSI Write command and the maximum data size allowed in each PDU is 8 Kbytes (These are fairly typical values).
Sentence 2: each SCSI Write command in the command window requires up to 9 PDUs.
Relationship: reasoning
Domain: Networks
Sentence 1: (n)= cf(n) is feasible) < 1. n.8 The distribution of nodes in random networks is uniform.
Sentence 2: if there are n nodes in a unit square, then the density of nodes equals n.Hence, if |S| denotes the area of space region S, the expected number of the nodes, E(NS), in this area is given by E(NS)= n|S|.Let Nj be a random variable de.ning the number of nodes in Sj .
Relationship: reasoning
Domain: Networks
Sentence 1: 5.3 Experimental Results Using Selected Features It is natural and necessary because as discussed in Section 3, the performance of TCM-KNN algorithm might deteriorate when meeting the curse of dimensionality , thus, by doing this, we can validate if our algorithm is robust and effective under the circumstance of adopting feature selection to reduce computational cost.
Sentence 2: for the next experiment, we have performed feature selection on KDD 99 to acquire the most relevant and necessary features from the 41 features.
Relationship: reasoning
Domain: Networks
Sentence 1: The necessary accuracy for such a mecha­nism is on the order of milliseconds (1 ° 8 5ms).
Sentence 2: even if in the current experimental setup the positioning sup­port is using all the bandwidth available for evenly spaced SS sampling, it is possible to ameliorate this by a number of methods: 1. employ user tra.c for sampling; 2. broad­cast the angle periodically from the base station (no RTS, CTS, or ACK overhead); 3. reduce the sampling rate.
Relationship: reasoning
Domain: Networks
Sentence 1: (4) Note that we must have pE(0, 1) and tE(0, 1).
Sentence 2: the probability that at least one of the n stations attempts to transmit in a given slot, ptr, can be expressed as Ptr =1 - (1 - t )n , (5) and the probability of have a successful slot given that a station transmits, ps, is given by nt(1 - t )(n-1) ps = .
Relationship: reasoning
Domain: Networks
Sentence 1: This in turn determines (i) the network links that see broadcast traf.c of the VLAN, and (ii) the hops traversed when a host in the VLAN commu­nicates with its gateway router.
Sentence 2: it is important to place the root-bridge judiciously to lower broadcast traf.c in the network and reduce inef.ciencies in data communication.
Relationship: reasoning
Domain: Networks
Sentence 1: Firstly, the browser sends the Client Hello with the cipher suites modified by the attacker, then the WAP gateway replies with Fatal Alert message handshake_failure, which indicates the gateway was unable to negotiate an acceptable set of security parameters given the options available.
Sentence 2: the browser sends a Critical Alert message connection_close_notify, which notifies the gateway that the sender will not send any more messages using this connection state.
Relationship: reasoning