sadat2307/MSciNLI huggingface dataset:
Domain: Networks
Sentence 1: WEIRD Testbeds with Fixed and Mobile WiMAX Technology for User Applications, Telemedicine and Monitoring of Impervious Areas  Silvano Mignanti Gabriele Tamea Ilaria Marchetti Sapienza University of Rome Sapienza University of Rome Sapienza University of Rome Italy Italy Italy silvano.mignanti@dis.uniroma1.it gabriele.tamea@dis.uniroma1.it ilaria.marchetti@dis.uniroma1.it Mario Castellano Antonio Cimmino Fausto Andreotti INGV ­Osservatorio Vesuviano Alcatel Lucent Italtel Italy Italy Italy castellano@ov.ingv.it antonio.cimmino@alcatel­lucent.it fausto.andreotti@italtel.it  Mariarita Spada Pedro Miguel Neves Giada Landi Wind Portugal Telecom Inovacao Centro Pisa Ricerche Italy Portugal Italy mariarita.spada@mail.wind.it est­p­neves@ptinovacao.it g.landi@cpr.it Paulo Simoes Kostas Pentikousis University of Coimbra Portugal VTT Finland spsimoes@dei.uc.pt kostas.pentikousis@vtt.fi  ABSTRACT Categories and Subject Descriptors Wireless Metropolitan Area Networks based on IEEE 802.16d/e C.2.1 [Computer­Communication Networks]: Network standards are soon to be deployed in several countries.
Sentence 2: the paper is organized as follows.
Relationship: neutral
Domain: Networks
Sentence 1: The live forensics includes re-examining the switch port status, ARP [19] cache, ping, and finger replies, etc.
Sentence 2: this email is designed to trigger a follow-up investigation by the MSA tool presented in this section to automate the process and establish the likelihood of a genuine spoofer or a false posi­tive with high con.dence to assist the network security crew in their daily operations by supplying the results of the anal­ysis and event reconstruction back to the same RT ticket.
Relationship: neutral
Domain: Networks
Sentence 1: [20] D. Guo, S. Shamai (Shitz), and S. Verd´u, Mutual information and minimum mean-square error in Gaussian channels, IEEE Trans.
Sentence 2: m = 16 sub­carriers and the average SNR for both main and eavesdropper channel is GR =GE = 10 dB.
Relationship: neutral
Domain: Networks
Sentence 1: The algo­rithm is based on exploiting a repeating preamble by computing the cross correlationofasignalwithadelayedversionofitself,andcom­puting the phase offset across the correlation values at different de­lays to compute the CFO.
Sentence 2: thus as long as the number of bit .ips at the demodulation (BPSK) stage are less than the correcting power of the channel code, the data eventually gets decoded correctly.
Relationship: neutral
Domain: Networks
Sentence 1: Sensor r re­ceives such message while travelling, and consequently stops because the contention for position x was won by sensor q. Sensor r sends an InfoStopped message to alert its neighbor­hood of its new position and starts a timeout.
Sentence 2: although Figure 13 evi­dences that the number of message exchanges is quite stable even under an increasing number of available sensors, the en­ergy consumption related to this term can be also a.ected by the sensor density.
Relationship: neutral
Domain: Networks
Sentence 1: 2s30 20 16 15 ~ 15 tO 7 ~] 5 I"1 2 3 t 0 .
Sentence 2: sAC 21302, Madrid, Spain C 2002 ACM i-511113-445-2/02/03...$5.00 the idea of layer-7 routing (or URL-aware routing, content-aware routing), routing incoming request based on its requested content, has drown a large amount of attention recently, both in the academic [1,2,3,4,5] and commercial communities [6,7,8,9,10].
Relationship: neutral
Domain: Networks
Sentence 1: [20] Atul Adya, Paramvir Bahl, Jitendra Padhye, Alec Wolman, and Lidong Zhou, A multi-radio uni.cation protocol for IEEE 802.11 wireless networks, in BROADNETS 04: Proceedings of the First International Conference on Broadband Networks (BROADNETS 04), Washington, DC, USA, 2004, pp.
Sentence 2: duplicate IP packets are dropped grace­fully at the receiver (TCP duplicates are dropped at the transport level, and applications using UDP are supposed to handle duplicates).
Relationship: neutral
Domain: Networks
Sentence 1: Lemma 1: Given a convex distortion function E[d(k1, k2)] with two protection variables k1 and k2, .E[d(k1,k2 > 0 and .E[d(k1,k2 2 > 0are the necessary conditions that the proposed cross-layer framework always give a lower distortion than a system without protection.
Sentence 2: (5) can describe the end-to-end distortion over a channel achieving rate, l , with a compound average SER, perr,l.j=1 Rj which allows the receiver to decode the coded wireless multicast signal up to layer l: _ 2 Dl = (1- perr,l )2-nR + perr,lsl , (5) When MDC is additionally considered on top of the scalable bitstreams and SPC, the source information bits that were originally transmitted by kl number of channel symbols are encoded into protected information bits that require n number of channel symbols for layer l. only (kl/ n) Rl bits in each channel symbol are available for describing layer l of the source symbol.
Relationship: neutral
Domain: Networks
Sentence 1: Here w(e)= IT ·c(e) l,where c(e) is the capacity of link e if there is no interference, and T is a given period for a schedule.
Sentence 2: there exists a node set with size at least |Vk 1|+ |Vk 2| |Vk| 1 22 max{|Vk |/(6a+1),|Vk |/11}= = (6a+1)2 +11 Ca such that all nodes in the set interfere with each other.
Relationship: neutral
Domain: Networks
Sentence 1: The service rate of the queue of user RU RU k from RU, rk (t), can be computed similarly, based on ck and kRU * (t), where kRU * (t) denotes the queue selected in time slot t for transmission of data from RU.
Sentence 2: the BS transmission power can be adjusted as 2min{QBS (t),c BS (t)}/W BS T k* -1 p BS (t) = (9) .BS (t) where .BS is the receiver side GNR of the link between BS and RU and can be computed based on (1).
Relationship: neutral
Domain: Networks
Sentence 1: However, the technique operates on the sample space of the symbol al­phabets (the alphabet space consists of the options that the physical-layer symbols can take).
Sentence 2: while we vary the power amplitude in Section 5.1, we now vary the frequency o.set between the two signals, as hardware os­cillators naturally operate at di.erent frequencies and have unique frequency drift and jitter.
Relationship: neutral
Domain: Networks
Sentence 1: Extensive simulations show that D2 achieves a near-optimal performance in a wide variety of settings.
Sentence 2: since we consider the case where there is only one task, we have Ws 0 = W , and Vi E V  {s}, W 0 = 0. i The completion time T , also called the makespan, is de­.ned as the time di.erence between the origin time, i.e., slot 0, and the .nish time, i.e., the time point when all nodes .nish their respective workload that belongs to C. T = min t, subject to Wi t = 0, Vi E V .
Relationship: neutral
Domain: Networks
Sentence 1: 4.2 Fault Tolerant and QoS based Service Advertisement Phase: Service providers advertise themselves by sending Fault tolerant and QoS based service advertisement messages (FTQoSAdv msg) to the neighboring road components (RRs and vehicles).
Sentence 2: our proposed FTQoSLocVSDP achieves a high connection rate, which is more than 90 per­cent when the number of requests ranges from 10 to 100.
Relationship: neutral
Domain: Networks
Sentence 1: We then assume that each node needs at least one time slot for transmission and our objective is to design a scheduling that minimizes T. Theoretical Performance Guarantee for Ef.cient Central­ized/Distributed Algorithms: We consider two kinds of in­terference models: RTS/CTS model and protocol interfer­ence model with .xed transmission power.
Sentence 2: for a given communication graph G, the interference graph FG may be different.
Relationship: neutral
Domain: Networks
Sentence 1: We use Si to denote the cell de.ned by base station zi, and for simplicity, by abusing the notation little bit, we say the cell Si is the service region of base station zi, i.e., zi serves as a functional gateway for all wireless nodes in cell Si when Cel­lular Routing strategy is used.
Sentence 2: a .1ns kr (2) If |Ta;B | + |T ;|: We have |T ;c1 c9ns | < |T ;cB | + |T ;|= · v 2 a · k According our construction approach, we know that for any routing tree Ti;, each base station has at most 19 adjacent cellu­lar links, then together with the fact that the length of each cel­lular link is at most r, we have the following inequation: |Tc;|= |T I | a vB× 19 × r. Since m = 2 , we have |T ;B |, it |= 6|T ; a/ m 10r2 v c follows that |T ;c3nsa This im­ B|= k for some constant c3.
Relationship: neutral
Domain: Networks
Sentence 1: Note that a destination Hd s attack detection mod­ule may take longer than Tf to identify an attack source Hs.Af­ter the detection, as soon as the destination receives a new packet from the attack source, it may immediately send a StopIt request.
Sentence 2: other schemes have similar performance in desti­nation .ooding attacks and one-way link .ooding attacks.
Relationship: neutral
Domain: Networks
Sentence 1: Note that this functionality is very dif.cult or impossible to ob­tain with normal RTS/CTS style control signaling that is coupled with the data plane.
Sentence 2: since the channel SNR is dynamic, and the bitrate adaptation algo­rithms cannot estimate SNR perfectly as we will show below, we can typically support much greater .ash rates of 50, 000 .ashes per second.
Relationship: neutral
Domain: Networks
Sentence 1: For each correct node p, assume the t nodes in N(p)are Byzantine and can be used by Carol to disrupt p s com­municationsfor ß=B0 time slots.
Sentence 2: this applicationfallsintoCase2 ofTheorem1: aDDoS attack targetstheserverwhilecommuni­cationsfrom the server to the clients are notdisrupted.
Relationship: neutral
Domain: Networks
Sentence 1: [23] U. Maurer and Y. Yacobi, Non-interactive public-key cryptography, Advances in Cryptology Eurocrypt'92, Lecture Notes in Computer Science 658,(1993), Springer, 458- 460.
Sentence 2: instead, one possibility is to use a heuristic that can be summarized as follows: if it routes like a router, it probably is a router .
Relationship: neutral
Domain: Networks
Sentence 1: Macrocell Topology As can be observed from Table 2, in macro cell environment, the Okumura Hata s path loss model is employed which, considering a carrier frequency of 2 GHz and a base station antenna height of 15 meters, is transformed to Equation (3): L = 128.1 + 37.6 Log10(R) (3) where R represents the distance between the UE and the Node B in Km [18].
Sentence 2: [19] 3GPP TS 25.803 v6.0.0, Technical Specification Group Radio Access Network; S-CCPCH performance for MBMS, (Release 6).
Relationship: neutral
Domain: Networks
Sentence 1: [11] Wireless LAN Medium Access Control (MAC) and Physical Layer (PHY) Speci.cations: High-Speed Physical Layer in the 5 GHz Band, Part 11 standard ed., IEEE 802.11 Working Group, September 1999.
Sentence 2: spatial­multiplexing algorithms only perform well in certain types of wireless channels with good spatial structure.
Relationship: neutral
Domain: Networks
Sentence 1: [1, In this case, the set A(ik+1) may overlap with multiple past Ind(ij ), where each ij was scheduled to a different thread.
Sentence 2: its main limitations are that (i) being .ow-insensitive, it cannot soundly analyze pro­grams that have loops in the index computation; and (ii) when table indices depend on conditional instructions, the resulting schedul­ing function is imprecise.
Relationship: neutral
Domain: Networks
Sentence 1: In Figure 11, we show a scatter plot of the overall RTT improve­ment (x-axis) and the corresponding propagation time difference (y-axis) offered by the best overlay path relative to the best mul­tihoming path.
Sentence 2: next, we contrast k-multihoming against k-overlay routing to understand the additional bene.ts gained by allowing end-systems almost arbitrary control on end-to-end paths, relative to multihoming (Section 5.6).
Relationship: neutral
Domain: Networks
Sentence 1: Therefore, G(pi)has a minimal solution for p(i,k).
Sentence 2: summarizing, in any FTP tra.c, the proposal can dis­tribute packets e.ectively in comparison with other meth­ 0.01420 15 0.012 0.01 10 VC Average Delay (sec/frame)  IP Average Delay (sec/packet) FTP Response Time (sec/file) 0.008 0.0065 0.004 1x106 2x106 3x106 4x106 5x106 0 1x107 2x107 3x107 4x107 0 1x106 2x106 3x106 4x106 Sum Throughput of VC and FTP (bytes/sec) IP Throughput (bps) FTP Throougput (bytes/sec) Figure 20: Dependence of VC aver- Figure 18: Dependenc of IP delay Figure 19: Dependence of FTP re­ age delay on sum throughput of VC on IP throughput.
Relationship: neutral
Domain: Networks
Sentence 1: Here social usability is examined in the context of collaborative learning through mobile technology, where it is a prerequisite for taking technology into use, for being able to use it diversely, and for being willing to participate in a virtual learning community (Lazar &#38; Preece 2002; Haythornthwaite 2002; Davis, Bagozzi &#38; Warshaw 1989).
Sentence 2: they are also important issues in the design of systems supporting social usability.
Relationship: neutral
Domain: Networks
Sentence 1: The top row shows examples of eigen.ows that exhibit strong 5As in Section 4.2, the raw data is too voluminous to present, but plots of the complete set of eigen.ows for both datasets are avail­able at [16].
Sentence 2: it is not our intent to suggest that any eigen.ow can be unambiguously categorized in this manner.
Relationship: neutral
Domain: Networks
Sentence 1: As f(R)= -4.48 < f (G) and f(R)< f (B) the vertex has to be extended.
Sentence 2: the Nelder-Mead method or Downhill Simplex Method or Amoeba Method is a commonly used nonlinear optimiza­tion technique, which is a well-de.ned numerical method for problems that do not need to use the derivatives of the function [7, 12].
Relationship: neutral
Domain: Networks
Sentence 1: They have to manage security in order to protect their networks from unwanted access, potentially configure parental controls to restrict Internet usage for their children, and diagnose and troubleshoot connectivity problems, to name but a few.
Sentence 2: this indicates that users have the desire to manage their networks themselves (as opposed to relying on external help sources), but that the tools are not yet available that can support their needs.
Relationship: neutral
Domain: Networks
Sentence 1: Coordination games over collision channels.
Sentence 2: as a conclud­ing remark regarding the e.ciency of NE, we state that the self-con.guring nature of the network does not imply a signi.cant loss of optimality, i.e., if the network were cen-the solution to the OP (26) might not be neces­sarily a fully mixed strategy, i.e., a vector qk with more than one entry di.erent from zero.
Relationship: neutral
Domain: Networks
Sentence 1: Since in each virtual output-queue VOQi,j , all cells of thesamepacket p are stored one after the other, there is no cell of a di.erent packet that is forwarded by CCF be­tween cells of packet p. Therefore, only cells of one packet are in aij (T, k) and were forwarded by CCF before time-slot (k-1)T; we next bound the number of such cells: Since the maximum packet size is Lmax and the last cell of each packet was forwarded by the CCF after time-slot (k-1)T,at most Lmax -1 such cells share the same input-port and the same output-port.
Sentence 2: in addition, packets that were not fully for­warded by the CCF algorithm until the frame boundary are queued in the input-side of the switch until the next frame, as captured by the next de.nition: Definition 5.
Relationship: neutral
Domain: Networks
Sentence 1: 5.2 Improvement of Cell Capacity The primary purpose of our experiments is to determine the capacity improvement of Argos, in order to ultimately answer the practicality of the many-antenna MUBF base station proposal from the theory community.
Sentence 2: later, we will show that when M = K this ine.ciency can even result in conjugate MUBF out-performing zero-forcing.
Relationship: neutral
Domain: Networks
Sentence 1: For example, if the original sample value was (0...01000)2=(8)10, and the watermark bit is zero is to be embedded into 4th LSB layer, instead of value (0...00000)2=(0)10, that would the standard algorithm produce, the proposed algorithm produces sample that has value (0...00111)2=(7)10, which is far more closer to the original one.
Sentence 2: international Conference on Image Processing, Chicago, IL, 399-403 [9] Roy, S., Manasmita M., 2011.
Relationship: neutral
Domain: Networks
Sentence 1: Despite all the efforts that have been put into adding reliability and high availability to networking sys­tems, errors such as software bugs, hardware failures, and con.g­uration errors are inevitable, and could severely impact the perfor­mance of the network.
Sentence 2: the checkpointed states of two nodes are consistent if, for every update that affects both nodes, their states are collected on the same side of the line associated with that update.
Relationship: neutral
Domain: Networks
Sentence 1: One scenario involving sensor networks frequently men­tioned in literature is that of aircraft deployment of sensors followed by in .ight collection of data by simply cruising the sensor .eld.
Sentence 2: this partitioning of the parameter space shows that in ab­sence of highly performant measuring hardware for both angles and ranges, range free algorithms such as DV-hop, provide the best performance tradeo.. existing prototype hardware, such as the Cricket compass 5o [9] provide AoA with an estimated sa =0.1 for certain conditions.
Relationship: neutral
Domain: Networks
Sentence 1: To evaluate 1) and 2), we wrote a simulator in Python that im­plements CM to deploy TAG models, and Oktopus [4] to deploy virtual cluster (VC) hose with homogeneous bandwidth and VOC models.
Sentence 2: even without Coloc, which seeks colocation bene.ts between components, the Balance-only approach per­formed close to OVOC in Fig.
Relationship: neutral
Domain: Networks
Sentence 1: Third, once the call completes, the phone switches back to 4G after two handoffs (HSPA to UMTS, followed by UMTS to 4G) at 65th and 66.4th seconds.
Sentence 2: for example, 4G users experience 83.4% uplink improvement and 53.8% downlink gain at 11PM.
Relationship: neutral
Domain: Networks
Sentence 1: In addition to determining coverage, CPICH power heavily in.uences the amount of Soft Han­dover(SHO).Non-uniform cellCPICHpower allowsfor sig­ni.cantpower saving andtherebyhigher capacityfor tra.c channels.
Sentence 2: thegapsbetweenthe results of our algorithm andoptimum are0,0.51%,4.77% respectively for aSHOratio6%,10% and14%.
Relationship: neutral
Domain: Networks
Sentence 1: Such scheduling schemes have recently received much atten­tion in the context of mesh networking (see for example [21, 3, 1, 19, 17, 4]).
Sentence 2: the vertices rep­resent wireless nodes implementing CSMA, and the edges represent interference constraints: that is, if the node at one end of an edge emits, the node at the other end will sense the channel to be busy and refrain from emitting1.As in many CSMA systems, we let nodes wait for a random (but small) amount of time after they sense the channel to be idle before emitting; if the channel is still idle after this random waiting time, they actually start their transmission.
Relationship: neutral
Domain: Networks
Sentence 1: Thebottomlevel(level0)inthis conjectured hierarchy is populated by trivial tasks, tasks that canbesolved asynchronously(e.g.,(2n-1)-renaming).
Sentence 2: crd( s)<C , and thus C is not the smallest corridor that contains a schedule that is not decid­ing with I and any G a contradiction.
Relationship: neutral
Domain: Networks
Sentence 1: 2, 1117 Budapest, Hungary vinczez@tmit.bme.hu ABSTRACT Energy efficiency is a very important goal in wireless sensor networks.
Sentence 2: 2, 1117 Budapest, Hungary vida@tmit.bme.hu in this paper we propose a solution that assumes an event­driven scenario, where sensors send data to the sink node in a multi-hop manner.
Relationship: neutral
Domain: Networks
Sentence 1: 6.2.2 eBGP Session Resets The failure or recovery of an eBGP session can cause multiple events that affect the eBGP-learned routes from one neighbor at a single border router.
Sentence 2: we focus on those in Figure 11 show­ing the duration of a routing disruption relative to the corresponding traf.c weight of the affected pre.xes for clusters with traf.c weight larger than 1%.
Relationship: neutral
Domain: Networks
Sentence 1: To integrate the WMNs with real applications, the protocols, standards and algorithms used for the MRs should consider the current and widely deployed technologies (e.g., Ethernet, IEEE 802.11 and TCP/IP v4 and v6), and new emerging technologies (e.g., IEEE 802.16).
Sentence 2: we give a list of guidelines that should be considered for the design of such a network, and analyze them in the context of different application scenarios.
Relationship: neutral
Domain: Networks
Sentence 1: In the area of self-assembled nanowire interconnect, the lack of control over the fabri­cation process makes it hard to obtain both reliable and structured networks.
Sentence 2: 4.3 Open Problems Despite considerable advancements in engineering distribu­ted bionetworks in living organisms, there are several re­maining challenges that hamper reliable construction and quick modulation of pattern formation in these synthetic systems.
Relationship: neutral
Domain: Networks
Sentence 1: #providers per PlanetLab source 0.92 0.69 0.81 0.10 Table 1: First-hop connectivity of the PlanetLab sites The unique upstream providers and locations of the remaining 26 PlanetLab sites are shown in Table 1 and Figure 1(a), respec­tively.
Sentence 2: bFind needs to be more aggres­sive than Vegas.
Relationship: neutral
Domain: Networks
Sentence 1: Networking named content, Proceedings of the 5th international conference on Emerging networking experiments and technologies, pages 1-12, ACM, 2009.
Sentence 2: since retransmitted interest packets for loss recovery are not distinguished from regular (or previously aggregated) inter­est packets in PIT, the retransmitted interest packets will be also aggregated in the PIT.
Relationship: neutral
Domain: Networks
Sentence 1: 1, Frequency (%) 100 10 1 0.1 0.01 0.001 0.0001 1e-05 1e-06 0 200 400 600 800 1000 1200 1400 1600 Packet Size Figure 2: Packet size distribution of cafeteria trace we need to have a di.erent message for waking up each of the di.erent WiFi receivers in the AP s range.
Sentence 2: figure 1: Esense application in three example scenarios Scenario Sender Intended Receiver Possible Message Content Coordinated Coexistence WiFi Node All nodes (or Master) of a given WPAN Identity of the WPAN, next CFP start time (relative to reception of this message) Energy Savings WiFi Node Secondary radio of the WiFi node it wants to wake-up Identity of the secondary radio (or receiver WiFi) Interference Map WiFi Node Broadcast Identity of the sender WiFi node Table 1: Esense communication details for the three example scenarios Energy Management: WiFi enabled devices such as smart phones, laptops and router boards often em­ploy a variety of techniques to conserve battery power.
Relationship: neutral
Domain: Networks
Sentence 1: Geometry No Proximity PNS PRS XOR 9 9 11 Ring 9 9 9 Tree 10 10 N/A Hypercube 9 N/A 9 Table 3: These 90th percentile hopcounts for the dif- Question #1: Which is more e.ective, PNS or PRS?
Sentence 2: [5] IRIS: Infrastructure for Resilient Internet Systems.
Relationship: neutral
Domain: Networks
Sentence 1: In [1], it is assumed that the realization factor a is uniformly distributed.
Sentence 2: 2.2 SAP s Optimal Spectrum Investment andPricing In our model, SAP must pay for two kinds of costs: leasing cost and cooperation cost, since SAP leases Wl units of bandwidth from spectrum owner and uses SUs cooperation capability by announcing p.We denote the unit leasing cost and the unit cooperation cost to Cl and Cc, respectively.
Relationship: neutral
Domain: Networks
Sentence 1: Then the probability that at least one of the ECRs is compromised is: PPor7 =1 - (1 - 7)F , (2) If we want to control PPor7 under a threshold, say G, then F = log1-1 (1 - G).
Sentence 2: [24] X. Yang, D. Wetherall, and T. Anderson.
Relationship: neutral