sadat2307/MSciNLI huggingface dataset:
Domain: Networks
Sentence 1: If one manages to prove the protocol in such a setting, then it is guaranteed that the protocol is computationally secure, roughly because all models are considered that do not violate the axioms, which includes the computational model.
Sentence 2: to every successful computational attack, there is a corresponding successful symbolic attack: all computa­tional attacks are symbolically accounted for, and that is why we call our symbolic attacker computationally complete symbolic at­tacker.
Relationship: entailment
Domain: Networks
Sentence 1: The ef.ciency at tens of centimeters may look low, however to the best of our knowledge, our ef.ciency numbers are the high­est for magnetic resonance at such distances with a small receiver coil that .ts in the back of a phone.
Sentence 2: the Witricity base­line is reported to have a maximum ef.ciency of 86% for distances less than 2cm [36], which is lower than MagMIMO.
Relationship: entailment
Domain: Networks
Sentence 1: However, such a combination does not yield ideal performance in many situations.
Sentence 2: the sender­initiated rendezvous protocol introduces unnecessary syn­chronizations between the sender and the receiver, requires more rounds of messaging than needed in common situa­tions, and has a limited capability for supporting commu­nication and computation overlaps [2, 15, 16, 18].
Relationship: entailment
Domain: Networks
Sentence 1: In addition, it can be shown that C-1 8 C-1 i2(k+j) XX XX yi(k+j)= f(k+j-C(i+1))=N/C-1.
Sentence 2: j=0 i=0 j=0 i=i1(k+j)  in any C consecutive time slots, the aggregate num­ber of uploading to super peers equals the number of super peers minus one.
Relationship: entailment
Domain: Networks
Sentence 1: First, a large fraction of the links have an intermediate delivery ratio in at least one di­rection.
Sentence 2: they are likely to deliver some routing protocol Delivery Ratio Delivery Ratio 1 0.75 0.5 0.25 0 1 0.75 0.5 0.25 0 (a) Pairwise delivery ratios at 1 mW Link number (b) Pairwise delivery ratios at 30 mW Link number Figure 4: One-hop packet delivery ratios between each pair of hosts at 1 mW (above) and 30 mW (below).
Relationship: entailment
Domain: Networks
Sentence 1: Learning from large amounts of feature selection experiments for TCM-KNN using all the three methods discussed above, we found that in most cases, the accuracy and effectiveness of filter based method are almost the same as those of wrapper based and hybrid method, while the consumed time of them are greatly different.
Sentence 2: we can adopt the most time-saving filter based method for anomaly detection without obvious loss of performance.
Relationship: entailment
Domain: Networks
Sentence 1: The channel ef.ciency drops abruptly with increasing dis­tance, and with varying packet size.
Sentence 2: i) the aver­age number of packet retransmissions increases as the packet size increases, ii) the ef.ciency decreases as the number of retransmissions increases, and iii) the ef.ciency increases as the packet payload size increases.
Relationship: entailment
Domain: Networks
Sentence 1: (5) 1 2 E 1 = prrij Lij + aij Lij with aij =1 - prrij , L1 =min{ei,Ej l }, L2 =min{ei,ej }, and ei being the residual energy of a node i. ij ij ER+1 With Ei l being equal to l , the lifetime measure of a node i for the single-link case is then prrij L1 Ei = + a Lij .
Sentence 2: (6) l ij R+1 2 R+1 ij (1 - aij )/(1 - aij ) Ei l refers to the expectation of the minimum residual energy of nodes that are affected if the node i forwards a packet to a neighbor j, which in turn forwards the packet towards the sink.
Relationship: entailment
Domain: Networks
Sentence 1: In this paper we use wire virtualization method to con­struct new optimal protocols for a wide range of parameters using previously known optimal protocols.
Sentence 2: we design, for the .rst time, an optimal 1-round (0,d)-SMT protocol for n = (2+ c)t, c = 1 t , where n is the number of paths between the sender and the receiver, up to t of which are controlled by the adversary.
Relationship: entailment
Domain: Networks
Sentence 1: Therefore, we de.ne a variant of the M3model that does not rely on physical distance between nodes.
Sentence 2: we will say that a pair of links LAB and LC D interfere if there is a 2 hop (or shorter) path from C to B, or from A to D.the modi.ed model says that a pair of links will interfere if the sender of one link is within two hops of the other link s receiver.
Relationship: entailment
Domain: Networks
Sentence 1: Denote s(l)and d(l)thesource anddestination nodes of session l .L and r(l)the minimum rate requirement(in b/s) of session l. Suppose that our objective is to maximize a scaling factor K for all sessions requirements.
Sentence 2: for each each session l .L, Kr(l) amount of data rate is to be transmitted from s(l) to d(l).
Relationship: entailment
Domain: Networks
Sentence 1: This re­quires IEEE 802.11 to incorporate functionality that is untraditional for MAC sublayers, in order to meet reliability assumptions and to handle QoS traf.c in a manner comparable to wired LANs.
Sentence 2: iEEE 802.11 MAC functions is a super set of 802.3 MAC functions, and many management functions will get lost when em­ulating IEEE 802.11 device as 802.3 device.
Relationship: entailment
Domain: Networks
Sentence 1: We use the .nal list of scanners manually generated by Sridharan et 4.1 TRWSYN under Sampling First, we discuss how TRWSYN performs when its input data is sampled using four di.erent methods.
Sentence 2: we are interested in identifying the potential sources of inac­curacy in estimating tra.c features that can a.ect its per­formance.
Relationship: entailment
Domain: Networks
Sentence 1: For our theoretical results, we to show that in both cases, one of the points of C1 would be within distance r of one of the points of C2, contradicting the assumption that C1 and C2 are distinct components of the graph Gh,r,.. De.ne a break to be the gap between two consecutive good components.
Sentence 2: a break is a partition of the set of good components into two classes, those on the left of the break, and those on the right, which is compatible with the left-right ordering of the good components.
Relationship: entailment
Domain: Networks
Sentence 1: M-FARA is not at this point a complete architecture; it de.nes some, but not all, of the mechanisms that FARA leaves unspeci.ed.
Sentence 2: m-FARA was designed to explore and illustrate the implications of FARA for mobil­ity and addressing domains, so it provides a speci.c set of mechanisms for addressing, forwarding, FD management, and security.
Relationship: entailment
Domain: Networks
Sentence 1: Recalling that stealth nodes are always the origin of any messages they send through the DHT, then it is obvious that reducing the routing information in stealth nodes to the .rst row of the routing table will have very little impact on routing performance while greatly reducing state overhead.
Sentence 2: the service nodes that handle the join message for a stealth node should only provide such node with routing information contained in the .rst row of their routing table (as opposed to information from the full routing table).
Relationship: entailment
Domain: Networks
Sentence 1: 3.1 FSO Link Engineering As a .rst step, we demonstrate that it is possible to engineer an FSO optical link using commodity DC-grade optical networking equipment that can achieve high data rates, at ranges suf.cient for DC-scale deployment, and with suf.cient (mis)alignment tol­erance.
Sentence 2: we can avoid the additional overheads in commercial FSO devices as concerns about outdoor environmental factors largely disappear in the indoor controlled DC setting.
Relationship: entailment
Domain: Networks
Sentence 1: In addition, we control the highest and lower predicted values using parameter 6 and rede.ne the criterion as: z t - 6 · z t > y t + 6 · y t (4) Note that in absence of better APs on the current (or the overlapping channels), all three of the above schemes do not force any action.
Sentence 2: if there are no better APs operating on the current channel, then the above schemes do no trigger a hando.
Relationship: entailment
Domain: Networks
Sentence 1: If b = a ' , then, by Corollary 7, q received u s message by the end of phase b + 2(RM - LM +4b)/(m - 2) + 11 = a ' + 2(RM - LM +4a ' )/(m - 2) + 11  a ' .
Sentence 2: u has not transmitted by the end of phase pa!
Relationship: entailment
Domain: Networks
Sentence 1: The rightmost plot in Figure 5 combines bias and variance, and we see the trade­offs at work: the relative overall performance of different schemes changes with x.
Sentence 2: as bias becomes stronger for its com­petitors at load ratios above 0.12, Poisson begins to outperform Periodic, but continues to be outdone by the Uniform renewal with wide support.
Relationship: entailment
Domain: Networks
Sentence 1: The differenceis that, the probability that the attack on the weakest protected player(s) is successful is now dependent on the security level min ei chosen.
Sentence 2: j 1 - ei if ei = min(ei,e-i), H(ei,e-i)= (7) 1 otherwise, so that j M - piLi(1 - si)(1 - ei) - biei - cisi if ei = min(ei,e-i),Ui = M - biei - cisi otherwise.
Relationship: entailment
Domain: Networks
Sentence 1: To start, we de.ne a rank-1 binary matrix: given binary vectors a and b, a rank-1 binary matrix X is given by Xij = ai ×bj .
Sentence 2: a rank-1 binary matrix is the outer product of two binary vectors and can be thought of as a block of 1s (after reordering of rows and columns).
Relationship: entailment
Domain: Networks
Sentence 1: Here, we consider a client to have an alternative AP if it is currently associated to an AP that has been (or will be) involved in oscillatory behavior at some point that day.
Sentence 2: if there exists some client, C, that oscillates between APs X and Y at any point in the day, we consider any clients (not just 0 5 10 15 20 C) associated with either X or Y to have alternatives.
Relationship: entailment
Domain: Networks
Sentence 1: For this example, all the coef.cients are nonzero.
Sentence 2: if we write 99 1 2 ) X(t)= X(k) cos (pk(t+ 1 ) 100 100 k=0  -5 0 -10 0 10 20 Time (hour of week) 30 40 50 60 70 80 90 0 -5 10 20 30 40 50 60 70 80 90 100 Frequency (a) An example signal X which has a short repre­sentation over the redun­dant dictionary D. (b) The discrete transform (DCT) example signal X. cosine of the Traffic volume 5 10 0 5 Figure 1: The example signal X and its discrete cosine transform (DCT).
Relationship: entailment
Domain: Networks
Sentence 1: All times are est expressed in milliseconds.
Sentence 2: requests at the server such that the response times predicted by the model (R) match accurately those measured of the real system (Rmeas) for all possible numbers of users N. due to the large role of caching which a.ects the behavior of the ERP system very di.erent at light and heavy loads, we specify the service demands as a function of the number of users N in the model, i.e., E[D] = E[D](N).
Relationship: entailment
Domain: Networks
Sentence 1: In Figure 2 (a.1), sharing results in an improvement of 15-22%, 2-13% for high in a setting of 25 hosts, NP, P and FW outperform FIS by and medium transmission power, respectively and has no ef­55%.
Sentence 2: in P-P, 99.9% of hosts will acquire the fect for low transmission power.
Relationship: entailment
Domain: Networks
Sentence 1: An edge (vi,vj )is bidirectional if both (vi,vj )and (vj ,vi)are in E, i.e., d(vi,vj )= min{ri,rj}.
Sentence 2: the edge (vi,vj ) is bidirectional if vi is in the disk Dj centered at vj with radius rj and vj is in the disk Di centered at vi with radius ri.Fig.1 gives an example of a DG representing a network.
Relationship: entailment
Domain: Networks
Sentence 1: In our exposition of IMCA we shall first consider bit-asynchronous chip­synchronous networks over frequency non-selective Rayleigh fading channels corrupted with additive white Gaussian noise.
Sentence 2: for the chip-synchronous case the received signal after sampling with one sample per chip results in the following (Nx1) vector r whose kth element is given by Ks Ks +Kp (1) r [] =L [][] js (m ) +L bjc js ( j bjc [][] m ) +n k ik iiki ikiiki k i =1 i =K +1 s bj[ -1] k m and ii bj[] = ik bj[] k >m ii where ci = | ci | exp(j8i) is the complex Gaussian fading coefficient for user i , bi is the bit of user i (bi = ±1 for BPSK modulation), bik is the bit of user i that affects the kth chip, si is the spreading code of user i, j is the bit index and nk is the thermal AWGN signal with zero mean and variance i2.
Relationship: entailment
Domain: Networks
Sentence 1: The connectivity graph is then used to unfold a number of connection links between users for each time instant.
Sentence 2: we use the connectivity graph as a basis for a time-varying graph of instant connectivity for each instant t. In these time-varying graphs (one for each time instant), each link is either active if the two hosts are colocated, or is not present if the two are not.
Relationship: entailment
Domain: Networks
Sentence 1: When a modified RREP packet is received by a node on the reverse path to the source, the receiver compares, for each channel which is not busy, the CU field announced in the RREP message with the locally stored CU value and chooses the lowest utilized channel to be allocated to its outgoing link towards the source.
Sentence 2: the channel i .C to be allocated to the link is calculated as in the following: (CUJRREP_snd + CUJRREP_Jev c= min )(2) J .C,J avaJlable 2 where CUJRREP_snd is the channel utilization value for channel i,RREP_Jev is as contained in the received RREP message, and CUJthe locally stored channel utilization for channel i.
Relationship: entailment
Domain: Networks
Sentence 1: While these indi­vidual functionalities are typically provided by di.erent de­vices, there is currently great interest in merging some of them to reduce overall costs and use the acoustic propaga­tion medium more e.ectively [7].
Sentence 2: synergies between communication and navigation for mobile under­water systems have been noted by several researchers; au­tonomous underwater systems invariably require the abil­ity to communicate with other assets and to derive loca­tion information using acoustic positioning systems.
Relationship: entailment
Domain: Networks
Sentence 1: Therefore for each node, the number of primary channels should be smaller than that of the secondary.
Sentence 2: we require that for any two channel codewords ccu and ccv ,there existatleasttwo channels k1 and k2 such that k1 is primary to ubut secondary to v,and k2 is secondary to ubut primary to v.we can always .nd out a channel that is primary to one node and secondary to another node when the two corresponding chan­nel codewords are different.
Relationship: entailment
Domain: Networks
Sentence 1: RTForensicLucidEncoder is the module that is the very .rst to be invoked to parse and encode the ini­tial RT ticket into a claim.
Sentence 2: it extracts the date, hostname, IP, switch, and port context point data that are used for subsequent lookups in the re­lated logs, live data, and database entries that follow to gather all relevant contextual evidence surround­ing the initial RT report.
Relationship: entailment
Domain: Networks
Sentence 1: At the same time, choosing four one week-long periods from the nine months long sFlow measurements results in four snapshots that  as seen from Table 1 capture some of the churn that our IXP faces on the medium to large time scales.
Sentence 2: we note a steady increase in the number of members of our IXP and in the traf.c volume they generated during the nine months long measurement period.
Relationship: entailment
Domain: Networks
Sentence 1: Hence, we are forced to take a somewhat heavy-handed approach in dealing with them (yet as we will .nd, one that appears to be necessary, and one that our results indicate is practical).
Sentence 2: our design uses a simple replication-based approach: instead of running one instance of routing software, our design uses a router hypervisor1 to run multiple virtual instances of rout­ing software in parallel.
Relationship: entailment
Domain: Networks
Sentence 1: Cooperative Game Theory Framework for Energy Ef.cient Policies in Wireless Networks* Matteo Sereno Dipartimento di Informatica, Università di Torino, Corso Svizzera 185, 10149, Torino, Italia matteo@di.unito.it  ABSTRACT In this paper we focus the attention on the energy-aware co­operative management of cellular access networks that offer service over the same area.
Sentence 2: we propose an ap­proach based on the cooperative game theory to address is­sues, such as stability of the cooperation, and sharing of the bene.ts derived from cooperative behaviors.
Relationship: entailment
Domain: Networks
Sentence 1: The di.culty relates to the de.nitions of m.b.c stochastic arrival curve and stochastic service curve.
Sentence 2: the .rst two terms on the right hand side of (15), 19), (21), (24) and (27) are generally dependent no matter whether the .ow(s) and the server(s) are independent.
Relationship: entailment
Domain: Networks
Sentence 1: The existing literature has studied di.erent problems 300 250 200 150 100 50 0 Number of transmitters/receivers for radar sensor networks, including waveform design and diversity [14], radar scheduling [15], data management [16], for a variety of ob jectives, such as target detection [17] and localization [18].
Sentence 2: bRs have also been consid­ered in [18].
Relationship: entailment
Domain: Networks
Sentence 1: We capture a fairly general correlation structure by letting the current channel state be impacted by the channel states in previous l time slots, where l can be any number.
Sentence 2: as the number of receivers n approaches in.nity, we show that the throughput is nonzero only if the coding block size K increases at least as fast as log n. if c " limn.8 K , the asymp­  log n totic1 throughput is positive whenever c> 0.
Relationship: entailment
Domain: Networks
Sentence 1: Also note that these delays are only incurred at the incep­tion of network operation; once the tree has been formed, new nodes typically join the network within one IPI.
Sentence 2: these should be viewed as one-time delays that are experienced when the tree has to be built from scratch, but they are not applicable in the case of recovery from route breakage, as we have seen in Section 4.3.2.
Relationship: entailment
Domain: Networks
Sentence 1: To overcome the above di.culties, we .rst conduct a theoretical study by modelling and analyzing the electric­ity charging behaviors in a large-scale network of EVs and charging stations.
Sentence 2: a performance upper bound (i.e., the lower bound of charging waiting time) has been found by assuming the presence of a central server which knows all information about the road system, the electricity charging stations, and the EVs.
Relationship: entailment
Domain: Networks
Sentence 1: The groups that are oriented towards uniting participants of real political actions are becoming the authoritative information source, even for those who did not initially consider the prospect of directly participating in them.
Sentence 2: it can be seen through the example of the community The Coordination of Protest Actions of St. Petersburg , whose activities are closely monitored by the maximum number of members of the protest community localized in Saint Petersburg about 24,000 people.
Relationship: entailment
Domain: Networks
Sentence 1: The wide discrepancies between supported data rates mean that a low rate .ow is unable to achieve a throughput compara­ble to a high rate .ow in the long term.
Sentence 2: the strong path-loss component means that a device that has a data rate of 6 Mbps is unlikely to attain long-term fair­ness if it competes with a device transmitting at 54 Mbps.
Relationship: entailment
Domain: Networks
Sentence 1: To solve this issue, in this sec­tion we introduce an approach for .nding a valid TEMP IP based on the SIP presence model.
Sentence 2: we call Requesting STA (R-STA) the STA which needs to .nd a TEMP IP and Assisting STA (A-STA) the STA which will help the R-STA to .nd such a TEMP IP.
Relationship: entailment
Domain: Networks
Sentence 1: Taken together, these design tenets begin to define a shared, evolvable soft state support subsystem within the Internet architecture.
Sentence 2: the goal of controlled transparency may be best achieved with some careful use of state in the network, so that the first packet in a transfer carries some extra trust-defining information, which is cached and reused on subsequent packets, and which can be reconstituted if it is lost.
Relationship: entailment
Domain: Networks
Sentence 1: However, our goal is to show that we can consolidate large numbers of servers into fewer locations, and how we select servers for consolidation is immaterial as long as we .nd the perfor­mance of the consolidated platform comparable.
Sentence 2: imperfect clustering makes our .nding conservative: Better clustering could lead to a better-constructed consol­idated platform with even fewer data centers.
Relationship: entailment
Domain: Networks
Sentence 1: It is true that some links in the Internet will always be congested, but asserting that "we" need to "provide for the possibility of dealing with congested links" in such cases undermines the justification for a complex, end-to-end QoS architecture, as described in the body of the RFC.
Sentence 2: defining Quality of Service as a technique for coping with the possibility of isolated congestion reduces the scope of the concept substantially.
Relationship: entailment
Domain: Networks
Sentence 1: This can easily be done by indexing the hash function used for the computation of the level-4 leaves using the identity of the access point that the recommendation corresponds to.
Sentence 2: instead of letting this leaf s value be computed as hash(n), where n is the value of its child, one would let it be computed as hash(n, id), where id is the identity of the access point.
Relationship: entailment
Domain: Networks
Sentence 1: In the protocol description, we do not care about details of the hash and simply use the hash result pw (in the exponent space) as the e.ective password instead: any­one knowing pw is actually able to impersonate the client or the server, and the security proof shows that attacking the protocol reduces to .nding pw.
Sentence 2: at the protocol level, pw is the password needed for authentication and password is just a way to remember it.
Relationship: entailment
Domain: Networks
Sentence 1: original trace than those of the previous two traces.
Sentence 2: 1.2 1.2 1 1 1 0.9 0.8 0.8 0.8 0.7 0.6 0.6 CDF 0.6 0.5 CDF 0.4 CDF 0.4 0.2 0.2 0.3 0.2 0 Original data 0 Original data Synthetically generated trace 0.1 Original traces Synthetically generated trace -0.2 Synthetically generated traces -0.2 00.51 1.522.533.54 0 0.51 1.5 2 2.5 3 Fully observed inter-contact times (in seconds) x 1000 0.5 1 1.5 2 2.5 3 3.5 4 4.5 Fully observed inter-contact times (in seconds) x 10 4 4 4 Censored observations of inter-contact times (sec)x 10 (a) Fully observed inter-contact times for (c) Fully observed inter-contact time (b) Censored observations for (SN_SA, SN_SA) (SN_SA,SN_SA) (SHUTTLE,SHUTTLE) Figure 10: Model .tting results for mean-weight-restricted mixture normal model 0.8 1 1 Agg.
Relationship: entailment
Domain: Networks
Sentence 1: In these cases, the applications need to have access to several data sources, and it would make sense for the spreadsheet application to mediate access to the content-based network through a uniform inter­face.
Sentence 2: it would make sense to (1) derive content-based communication predicates from formu­las in the spreadsheet, and (2) to feed data extracted from messages directly into the appropriate positions in the spreadsheet.
Relationship: entailment
Domain: Networks
Sentence 1: C. Contour Plots The following diagrams plot the scaling behavior of the subgraphs induced by P routing for the topologies ob­served via the CAIDA trace data, assuming that each of the CAIDA sources and destinations reflects a randomly chosen vertex in the graph.
Sentence 2: we study the be­havior of the function VG(k,m) as Ic and m vary.
Relationship: entailment