sadat2307/MSciNLI huggingface dataset:
Domain: Networks
Sentence 1: On the downlink (i.e., from the switch to the N links), the merge network needs to be able to forward packets from any of the K switch ports to any of the N downlinks and be able to forward up to K downlinks simultaneously.
Sentence 2: an important requirement of the merge network is that it operate entirely in the analog domain.the merge network in no sense receives packets.
Relationship: entailment
Domain: Networks
Sentence 1: On the other hand, the cognitive wireless device part including RF and media access control performs radio sensing, RX/TX, digital signaling process, and media control in each layer of 1 and 2, and interacts with the operating system.
Sentence 2: the cognitive wireless device part are also categorized into several domains from the viewpoints of transmission power, utilization image, and media access control as shown in Ta­ble 1.
Relationship: entailment
Domain: Networks
Sentence 1: User perseverance: Perseverance of a user is de.ned as the average of the persistences of all his/her P ties.
Sentence 2: pi =1/Ki * j Pij , where Pi is the persever­ance of user i, Ki is i s degree (number of neighbors), and Pij is the persistence of tie eij as de.ned above.
Relationship: entailment
Domain: Networks
Sentence 1: EVALUATION OF UPDATE TIMES A Bloom Filter [6] is a data structure conceived to e.­ciently perform membership queries on a large data set.
Sentence 2: using an array of m bits, all initially set to 0, we can map each item to the corresponding footprint , i.e., every ID is hashed using k di.erent hash functions to ob­tain the positions of the k bits that will be set to 1.
Relationship: entailment
Domain: Networks
Sentence 1: Since the original SOTA router RTL is ASIC-oriented and was thus not optimized for FPGA synthesis, to make the comparison more fair, we modi.ed the SOTA router RTL by applying RTL coding discipline suit­able for FPGA synthesis.
Sentence 2: our changes only a.ect storage elements; we ensured that all register .les properly mapped to Distributed RAM, instead of discrete registers or Block RAM.
Relationship: entailment
Domain: Networks
Sentence 1: SDR-based Passive Indoor Localization System for GSM Islam Alyafawi, Desislava C. Dimitrova and Torsten Braun University of Bern, Communication and Distributed Systems (CDS), Bern, Switzerland {alyafawi, dimitrova, braun}@iam.unibe.ch ABSTRACT This study deals with indoor positioning using GSM radio, which has the distinct advantage of wide coverage over other wireless technologies.
Sentence 2: we focus on passive lo­calization systems that are able to achieve high localiza­tion accuracy without any prior knowledge of the indoor environment or the tracking device radio settings.
Relationship: entailment
Domain: Networks
Sentence 1: For example, we could have two re.ections that are spaced 1ns apart (or 1 foot apart 2 in distance), but with a radio with a typical sampling rate of 40Msps, two consecutive digital samples themselves are spaced 25ns apart.
Sentence 2: we have to get time res­olution of much smaller values than even what our sampling itself can provide.
Relationship: entailment
Domain: Networks
Sentence 1: Speci.cally, if the service ratesofclass-k .ows in cell i are always Ci,A(k), then the cell in isolation behaves as a standard multi-class Processor-Sharing system with load .i,A = Ki .i,A(k), where k=1 .i(k)s .i,A(k)= .
Sentence 2: ci,A(k) the reference system is stable if and only if .i,A < 1, in which case the stationary distribution of the number of active .ows of the various classes is given by Ki Ki p(m1,...,mKi )=(1-.i,A)k=1 mk .i,A(k)mk .
Relationship: entailment
Domain: Networks
Sentence 1: Further, it simplifies error detection since a simple request-acknowledge protocol can be used: If an acknowledgment packet has not been re­ceived a fixed amount of time after the request packet was sent, a transmission error occurred.
Sentence 2: while similar protocols have to cope with variable, possibly unbound delays and variable numbers of outstanding packets, the protocol for Clint can rely on bounded de­lays and a fixed number of outstanding packets.
Relationship: entailment
Domain: Networks
Sentence 1: For rectangular belts Bs, this issue can be addressed as follows.
Sentence 2: let Bsbe the belt region [0,s]x[0,1/s].B1is the Bswith s1.Let L1be the set of all crossing paths in B1.For each crossing path lEL1,de.ne ls{(x*s,y*1/s):(x,y)El},which is a crossing path in Bsnaturally corresponding to l. Now, (1) can be more precisely stated as VlEL1:limPr[Bsisk-barrieroveredmodulols]1. s-o For non-rectangular belts Bs, the issue can be addressed sim­ilarly by introducing a natural one-one mapping between B1 (the Bswith s1)and Bs.
Relationship: entailment
Domain: Networks
Sentence 1: Introduction Recent developments in wide-area wireless technologies (such as the IEEE 802.16 standard [6]) have led to considerable interest in the construction of multi-hop wireless mesh networks.
Sentence 2: such networks are being proposed and studied as an enabling technology for multiple applications such as machine-to-machine (M2M) com- Permission to make digital or hard copies of all or part of this work for personal 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: entailment
Domain: Networks
Sentence 1: The goal of this work is to explore the role technology can play in alleviating some of the burden placed on social workers and para­social workers who are attempting to serve the millions of orphans and vulnerable children (OVC) across Tanzania [1].
Sentence 2: we explore the use of SMS (Short Message Service Permission to make digital or hard copies of all or part of this work for or text messaging) to improve the cost, regularity, and timeliness personal or classroom use is granted without fee provided that copies are of reporting data to the relevant government database so that not made or distributed for profit or commercial advantage and that resource distribution can be better informed and services provided copies bear this notice and the full citation on the first page.
Relationship: entailment
Domain: Networks
Sentence 1: 2.3 Static Scatternet Construction Given nnodes currently distributed in the network, the section gives an ef.cient algorithm to construct our de Bruijn based scat­ternet dBBlue, which has low diameter and bounded node degree property.
Sentence 2: we .rst study the construction of the scat­ternet for a static n-nodes network, which will serve the base for our dynamic construction.
Relationship: entailment
Domain: Networks
Sentence 1: For a simple(monotone)payo.speci.cation, anexactpotentialis provided, any of whose maximizers is a pure-strategy equi­librium.
Sentence 2: strategies become sequences of sin­gletons:forapeerastrategyspeci.es,for any(perstage) contentdistribution overthe wholepopulation, whoto send arequestfor additionalcontent.
Relationship: entailment
Domain: Networks
Sentence 1: We show the NP-hardness of all these sub-problems and provide ap­proximation algorithms with guaranteed approximation ra­tios for them.
Sentence 2: we show that, for a WSN with node set V to monitor a set D of targets:  Omni-directional Antenna and Omni-directional Sensor (OAOS) has a (4 + E)-approximation.
Relationship: entailment
Domain: Networks
Sentence 1: These shortcomings areexacerbatedasthelevelof hetero­geneity and high-bandwidth requirements of emerging applications increase dramatically.
Sentence 2: popular wireless link-layer pro­tocols, such as the retransmission ARQ-based approach (employed by the IEEE 802.11 standard suite) are designed to achieve some levelof reliabilityby dropping corruptedpacketsatthe receiverand by performing one or more retransmission attempts.
Relationship: entailment
Domain: Networks
Sentence 1: Several similar cases for each user type are listed in Table 5, where we .nd that the condi­tional probability .j,Ht (obtained based on mobility pro.les) is closer to the actual event y(D) than the general probabil- Ht ity P (Ht) (obtained from the common statistical approach).
Sentence 2: as seen in the cases for the users from groups G2,G3,G4 and G6 our predictions would be completely ac­curate, whereas those from the statistical method are far from correct.
Relationship: entailment
Domain: Networks
Sentence 1: COOPERATIVE BEAMFORMING In a multiuser MIMO system, .. transmitting antennas and ..+1 receiving antennas can generate up to min(..,..+1) independent channels.
Sentence 2: by beamforming, if we expect to eliminate signals to the K users and transmit signals only to the target user, we should have ..=..+1.
Relationship: entailment
Domain: Networks
Sentence 1: The goal of this simulation is to assess the e.ectiveness of the application level monitors in detecting infections and rejuvenating the infected hosts under certain reasonable conditions.
Sentence 2: we will evaluate the ability of the performance signature and soft­ware rejuvenation algorithms to purge a worm infection from the MANET environment without access to (unknown) soft­ware patches.
Relationship: entailment
Domain: Networks
Sentence 1: For n points placed uniformly at random on the unit square, let M 1 denote the longest edge-length of the nearest neighbor graph on these points.
Sentence 2: then 2 -a lim P[nm M 1 - log n : a ] = exp(-e ), a = R. (1) n-o asymptotically nm M 1 2 - log n is Gumbel­distributed.
Relationship: entailment
Domain: Networks
Sentence 1: Measurement Window [sec] (a) Total Throughput vs. Ef.ciency Index (b) Short-Term Fairness Index Figure 6: Symmetric Incomplete Information Topology: Simulation Results provides the highest throughput and satisfactory short-term fairness properties is always less than 1.
Sentence 2: for the price of a moderate throughput loss, short-term fairness properties can be substantially improved.
Relationship: entailment
Domain: Networks
Sentence 1: In the context of software architecture, AntiPatterns can clarify the necessity of problem-solving skills revealed in software engineering reference models, such as, the Software Design Level Model (SDLM) and the Reference Model for Open Distributed Processing (RM-ODP).
Sentence 2: this presentation will discuss how traditional software engineering assumptions become serious AntiPatterns, when applied to distributed software architectures.
Relationship: entailment
Domain: Networks
Sentence 1: INTRODUCTION Partial dynamic recon.guration is one of the key features that make FPGAs unique devices, o.ering degrees of free­dom not available in other akin technologies.
Sentence 2: two important bene.ts can be achieved by exploiting partial dynamic recon.guration on recon.gurable hardware: the re­con.gurable area can be exploited more e.ciently with re­spect to a static design and some portion of the application can change over time and react to changes in its environ- Permission to make digital or hard copies of all or part of this work for personal 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: entailment
Domain: Networks
Sentence 1: To untangle the mutual interference of simultaneous transmissions and to achieve analytically tractable yet asymptotically tight approximations we move from the nat­ural graph-based methodology to a space-based approach.
Sentence 2: rather than studying mutual restrictions and interference on the graph of nodes, we focus on restrictions regarding the proximity of ongoing transmissions as seen at any location X of the space occupied by the network.
Relationship: entailment
Domain: Networks
Sentence 1: Therefore, s1 is released at time instant tr =+- lav =+- + lav 1 t0 bh *(D +tx ) and s2 at tr2 t0 b (D tx ) .
Sentence 2: s1 is released tr tr (h 1)( D +tx lav ) -= - time units sooner than 21 s2.
Relationship: entailment
Domain: Networks
Sentence 1: On a per-pre.x basis, long transient periods are not the common case: although BGP update traf.c is fairly continuous, the update traf.c for a single destination as seen by a single AS is rel­atively bursty, with prolonged periods of silence.
Sentence 2: a group of updates may arrive at several routers in an AS during a relatively short time interval (i.e., seconds to minutes), but, on longer timescales (i.e., hours), the BGP routes for external destinations are relatively stable [22].
Relationship: entailment
Domain: Networks
Sentence 1: When the .rst relay group root on the chain is non-malicious and known by the attacker, the attacker infers that the source 1 is the .rst root with probability and the source L-n+1 is among all other non-malicious nodes with probability 1 1- .
Sentence 2: for each non-malicious node u,the L-n+1 attacker assigns probability of u being the source as: 1 the .rst relay group root on the chain (L-n+1 ) pu = 1 1 1- · otherwise L-n+1 (1-f)N-1 When the .rst root on the chain is not known by the at­tacker or is malicious itself, all non-malicious nodes look 1 equally to be the source, each with probability .
Relationship: entailment
Domain: Networks
Sentence 1: TraceNET: An Internet Topology Data Collector M. Engin Tozal Department of Computer Science The University of Texas at Dallas Richardson, TX 75080 U.S.A. engintozal@utdallas.edu Kamil Sarac Department of Computer Science The University of Texas at Dallas Richardson, TX 75080 U.S.A. ksarac@utdallas.edu ABSTRACT This paper presents a network layer Internet topology collec­tion tool called tracenet.Compared to traceroute, trace­net can collect a more complete topology information on an end-to-end path.
Sentence 2: while traceroute returns a list of IP addresses each representing a router on a path, tracenet attempts to return all the IP addresses assigned to the inter­faces on each visited subnetwork on the path.
Relationship: entailment
Domain: Networks
Sentence 1: By harnessing the power of modern GPUs to perform packet classi.cation, we hope to make real-time packet composition analysis viable in the domains of network re­search, security and fault diagnosis.
Sentence 2: we aim to apply GPU based .ltering to real-time giga-bit network visualisation and fast network telescope data analysis, ap­plications which we believe to be both highly desirable and within reach.
Relationship: entailment
Domain: Networks
Sentence 1: After computing the overall redun­dancy effectiveness r, we can leverage it to determine the minimum number nmin of independent network stamps needed to meet a desired SLA uptime of a service.
Sentence 2: we solve for the minimum integer n that sat­is.es the following equation: 1-(1-r)n =SLAdesired .log(1-SLAdesired) =nlog(1-r) As log(1-r) < 0.r .
Relationship: entailment
Domain: Networks
Sentence 1: (s2) >0}, where .1µ1 .2µ2 H(s1,s2)= M1 (z) -M2 (z) (8) µ1 + s1 µ2 + s2 for (s1,s2) .O,with z =(s1 + s2)/2.
Sentence 2: trans­form G1 satis.es (s1 -s2)G1(s1)= J1(s1) -H(s1,s2) (9) for all (s1,s2) .O such that K2(s1,s2)=0; similarly, transform G2 satis.es (s2 -s1)G2(s2)= J2(s2)+ H(s1,s2) (10) for all (s1,s2) .O such that K1(s1,s2)=0.
Relationship: entailment
Domain: Networks
Sentence 1: Looking more closely at the RFCs in this area, ssuch as [7, 18, 19, 21, 27], the following branch-case can be obserrved as mentioned in RFC 3264 [27]: An Offer/Answer Model Seession Description Protocol : If multiple formats are listed, itt means that the offerer is capable of making use of any of those fformats during the session.
Sentence 2: the answerer MAY channge formats in the middle of the session, making use of any of thhe formats listed, without sending a new offer .
Relationship: entailment
Domain: Networks
Sentence 1: The algorithm in this theorem is a dynamic programming algo­rithm, which can either be generalized from the dynamic program­ming in [1] for computing MIS on k-outerplanar graphs, or spe­cialized from the dynamic programming in [31] for counting CSPs on graphs of bounded treewidth O(k) (which cover k-outerplanar graphs).
Sentence 2: for q-MWIS and q-MWC, this exact algo­rithm can be combined into a PTAS on planar graphs using the same routine designed in [1] for maximum independent sets.
Relationship: entailment
Domain: Networks
Sentence 1: It is worth cautioning that our anonymization of some of the do­mains in the Traf.c data set could bias some of these results.
Sentence 2: if many homes in our data set for some reason sent a sig­ni.cant amount of traf.c to domains that were not in our whitelist (e.g., domains for pornographic content, which we explicitly re­moved from the whitelist), our results would not re.ect this phe­nomenon.
Relationship: entailment
Domain: Networks
Sentence 1: Let x =(x1,x2,...) denote the approximation of a .nite energy signal x(t) at a given resolution; the wavelet coef.cients {xm,n} at lower resolutions can be obtained considering the .lter bank shown in .gure 2, where the coef.cients hn and gn depend on the chosen mother wavelet.
Sentence 2: the outputs of the high-pass .lter hn give the detail coef.cients (at the given resolution), while the outputs of the low-pass .lter give an approximation at a lower res­olution, which is further decomposed in a similar way.
Relationship: entailment
Domain: Networks
Sentence 1: As a result, our approach can be extended to find different types of botnets and has the potential to find the new botnets when exploring specifically the traffic on the "unknown" community.
Sentence 2: we evaluate our framework on IRC and WEB community and evaluation results show that our approach obtains a very high detection rate (approaching 100% for IRC bot) with a low false alarm rate when detecting IRC botnet traffic.
Relationship: entailment
Domain: Networks
Sentence 1: To the best of our knowledge, this work is the .rst to present a class of relaying strategies for multicast content delivery in mo­bile ad-hoc networks that optimize a global system objective and allow for general user mobility.
Sentence 2: compared to previous work, our framework alleviates making any speci.c assumptions on user mobility that may not hold in practice, such as statistical independence of inter-contact times between mobile devices, ho­mogeneity of distributions of inter-contact times between distinct pairs of mobile devices, and assuming speci.c parametric families for the distributions of inter-contact times.
Relationship: entailment
Domain: Networks
Sentence 1: Answering these questions plays a signi.cant role in multipath maintenance and reconstruction in sensor networks.
Sentence 2: it can help to save network resource by not launching new route dis­covery if the data source realizes that no more route might exist; it can guide a mobile data source to reposition itself to recover from 1We use node-disjoint and vertex-disjoint interchangeably.
Relationship: entailment
Domain: Networks
Sentence 1: i=1 tx Finally, thanks to the nature of data compression that leads to a uniform output rate, a simple delay model (based on the one in [17]) can be formulated.
Sentence 2: the worst-case delay for a node n occurs when the remaining nodes use all their slots (and the control overhead for all the corresponding frames) before node n is enabled to transmit: 23 NN XX (i) 1 (i) (n)67 d(.mac) = .tx +.tx .control .
Relationship: entailment
Domain: Networks
Sentence 1: 6.2 Not Being Incentive-Compatible Does Not Affect Stability We argue that BGP and NS-BGP not being incentive com­patible in general does not necessarily mean that the respec­tive routing systems will become unstable in the presence of unorthodox protocol manipulations.
Sentence 2: while ASes might improve certain kinds of individual gains by manipu­lating these protocols, such actions are unlikely to a.ect the global routing stability.
Relationship: entailment
Domain: Networks
Sentence 1: SoNavNet is unique compared to existing LBSNs in that it considers not only the current location of a user shared within the network, but also navigation experiences provided by the user that can benefit the future navigation of friends within the network or other users.
Sentence 2: navigation information within SoNavNet is largely user-generated, unlike other networks that provide navigation information, such as generic routes (fastest, shortest, least highways) computed by services like Google Maps or MapQuest or all nearby restaurants stored in the service providers databases.
Relationship: entailment
Domain: Networks
Sentence 1: 11 = x1 = 1+ nsm 1+ sm Since x1 cannot exceed 1+1 sm without violating constraint (8), we only need to consider the following two cases: 1. x1 < 1 1+nsm Let obj denote the objective function.
Sentence 2: we must have () 1 obj = (1 - x1) +1 - nx1(by (6)) sm ()( ) 11 n > 1 - +1 - 1+ nsm sm 1+ nsm 2s2 n + nsm + n m = 1+2nsm + n2s2 m This last value is minimized by n =1, at which point LowerBound mal (sm) = LowerBound mal (1) = 34 .
Relationship: entailment
Domain: Networks
Sentence 1: INTRODUCTION In recent years wireless mesh networks (WMNs) have at­tracted increasing attention due to their advantages over traditional wireless networking technologies.
Sentence 2: permission to make digital or hard copies of all or part of this work for personal 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: entailment
Domain: Networks
Sentence 1: DATA COLLECTION METHODOLOGY According to the 802.11 standard [37], a WiFi access point can announce its presence by broadcasting Beacons frames contain­ing network con.guration parameters such as the service set iden­ti.er (SSID) and supported data rates.
Sentence 2: the SSID is a string that identi.es the WiFi AP in a human readable format (e.g., Home network , Free WiFi ).
Relationship: entailment
Domain: Networks
Sentence 1: We show, however, that by and large, these deficiencies can be compensated through local gateway diversity at the source combined with intelfigent gateway selection.
Sentence 2: we first learn that a large fraction of end- to-end service degradations are path degradations which can be bypassed if a request is routed through a differ- ent AS; we then show that small (but carefully selected) gateway diversity combined with simple prediction al- gorithms can reduce the degradation-rate to half of that of the best single gateway.
Relationship: entailment
Domain: Networks
Sentence 1: Furthermore, the energy re­quired for transmission from node ito the BS is denoted by Ei.We consider the report cost that is proportional to the energy consump­tion from node ito the BS, Ei, and is inversely proportional to the current remaining energy of node i, ei.
Sentence 2: the report cost of node iin a cluster, denoted by ci, is given by: Ei ci = .
Relationship: entailment
Domain: Networks
Sentence 1: Then, the long range contact v of a node u that has chosen integer k is selected uniformly at random in Bk(u) = B(u, 2k).
Sentence 2: if the rank r(v) of a node v is the smallest k such that v .Bk(u), then [logXnl 1 1 .u(v) = .
Relationship: entailment
Domain: Networks
Sentence 1: The initial set of .ndings from our longitudinal analysis paints an intriguingly stable picture of the commercial Internet as seen from our vantage point.
Sentence 2: analyzing in detail each of the 17 weekly snapshots shows that during every week, we see server-related traf.c at this IXP from about 20K (i. e., about half of all) actively routed ASes, some 75K or approximately 15% of all actively routed pre.xes, and from a pool of server IPs whose absolute size changes only so slightly but tends to increase in the long term.
Relationship: entailment
Domain: Networks
Sentence 1: N(Si) and Tj = LG, D DD (1 - cij ) - cij = (1 - 2cij ) must be greater or equal to I|N(Si)|/2l to claim Si is good.
Sentence 2: a good Si will be diagnosed as GD in the .rst round if it has less than k/4 bad neighbors.
Relationship: entailment