sadat2307/MSciNLI huggingface dataset:
Domain: Networks
Sentence 1: Since in Massouli´e s model each packet leaving a link must that this .uid system is the the same as our proportionally have the same routing behavior, it is not immediately clear fair .uid model: that the result extends to multiclass queueing networks where xrj- (t) r routing depends on a packet s route-class.
Sentence 2: the fol­ lowing lemma makes this possible Lemma 1.
Relationship: contrasting
Domain: Networks
Sentence 1: ThecurrentsecuritymodelofJavausesatwo-levelcon­fgurationapproach.Aglobalpolicyfleholdsthedefault permissionsforanyuseronaspecifcsiteandauser'slocal policyflecanspecifyadditionalpermissions.SinceJava's securitymodelonlysupportsadditivepolicies,onlytwoex­tremesformeaningfulsecurityconfgurationexist:Either eachusermustmaintainaprivatesecuritypolicyfle,ora globalpolicyisspecifedanduser-specifcconfgurationsare ignored.Withthefrststrategyuserscaneasilyintroduce securityholes|regardlessofwhetheraglobalpolicyfleex­istssincetheuser'slocalpolicycanextendtheglobalpolicy inanyway|butcanhaveapersonalizedconfguration.In thesecondcasetheadministratorhastotalcontroloverthe securitypolicybutcannottailorittospecifcusers'needs.
Sentence 2: jSEFovercomestheseproblemsbyprovidingahierarchi­calsecuritypolicyschemewhichsupportsbothlocal,user­specifcsecuritypoliciesandaglobalsecuritypolicydefned bytheadministratorwhichtakesprecedenceoveruserpoli­cies.Atruntimeauser'sactualpolicyisdefnedbymerging theuser'slocalpolicywiththeglobalpolicy.Theuser'spol­icy,however,cannotcircumventrestrictionsimposedbythe administratorintheglobalpolicy.Thisschemeattempts toimprovethemanagementofsecuritypoliciesandwillbe explainedindetailinSection4.Forexample,thesystem administratormaydefnethecompany-widesecuritypolicy intheglobalpolicyandJSEFensuresthateveryuserim­plicitlyfollowsit.userscanstillrefnethispolicy, e.g.,bydefningamorerestrictivepolicyfortheirpersonal data,butcannotoverruleit.
Relationship: contrasting
Domain: Networks
Sentence 1: (9) In order to predict how many collisions will occur over link ij, the fraction of time of HN s T X ratio during V P is esti­mated.
Sentence 2: in the case of multiple HNs, variant HN s T X ratio s should be considered to re.ect the variant e.ect of variant packet sizes and data rates over the estimated num­ ber of collisions.
Relationship: contrasting
Domain: Networks
Sentence 1: Suc­cessful fraud attacks that degrade a good AP s reputation (or contract its 0%-loss SNR range) are harder to correct because honest users may be dissuaded from using that AP.
Sentence 2: since cost, venue, and other external factors will in.uence selectionsinpractice,webelieve some honest users will eventually report on these APs and correct their sum­mary statistics.
Relationship: contrasting
Domain: Networks
Sentence 1: Although the costs of the proposal are quite restricted, our scheme is even lighter (it only requires an HMAC).
Sentence 2: the key management structure or Ersöz proposal is based on a Logical Key Hierarchy (LKH) architecture in which users share a common key that has to be changed and re-distributed when the group of cog­nitive radio nodes is modi.ed.
Relationship: contrasting
Domain: Networks
Sentence 1: Table 1: Distinctions between HLP and BGP Design issue BGP HLP Routing structure Flat Hierarchical Policy structure Support for generic policies Optimize for common case of policies Granularity of routing Pre.x based AS based Style of routing Path vector Hybrid routing Convergence andRoute Stability: To provide reliable reach­ability, Internet routes shouldbe relatively stable and, when a change is necessary, they should quickly converge to their new steady-state.
Sentence 2: bGP is known to su.er from signi.cant route instabilities, route oscillations and long con­vergence times.
Relationship: contrasting
Domain: Networks
Sentence 1: This approach simpli.es the re­ 1Both direct sequence spread spectrum (DSSS) and fre­quency hopping spread spectrum (FHSS) are included in the IEEE 802.11 speci.cations.
Sentence 2: since DSSS has more desirable properties than FHSS, it has been favored in recent wireless standards, including IS-95.
Relationship: contrasting
Domain: Networks
Sentence 1: There also exists software for the management of CMDBs, which is able to ex­port systems monitoring con.guration .les to Nagios (e.g., 3http://www.lilacplatform.com/ 4http://sourceforge.net/projects/monarch/ 5http://sourceforge.net/projects/ncpl/ i-doit6).
Sentence 2: none of these solutions integrates into a Semantic Wiki and none supports the use in a collaborative environment.
Relationship: contrasting
Domain: Networks
Sentence 1: Today, it is easy to share and virtualize compute and storage resources effectively.
Sentence 2: implementing network virtual­ization with bandwidth guarantees on a shared network infrastruc­ture is an inherently complex and challenging task [3 7, 18, 45], which requires three key technologies: 1) An easy-to-use network abstraction model for tenants to accurately express their bandwidth requirements; 2) A workload placement algorithm that ef.ciently allocates datacenter resources to meet the tenant requests, and 3) A scalable runtime mechanism to enforce the bandwidth guarantees and utilize unused bandwidth ef.ciently.
Relationship: contrasting
Domain: Networks
Sentence 1: Note that TCP will follow the two logics:advertise window cannot exceed maximum receive buffer size and sending window is the minimum between congestion window andadvertise window.
Sentence 2: therefore, the limitation of maximum receivebuffer size will eventually prevent TCP sender from over-shootingand avoid the excessive growth of end-to-end latency (e.g., RTT).this simple hack brings in sub-optimal performance is­sues due to the highly dynamic nature of mobile data access.
Relationship: contrasting
Domain: Networks
Sentence 1: The results were as follows: 15 % P2P Tra.c: 0% False positive, 0.29% False Negative, and 0.17% DK  25 % P2P tra.c: 0% False positive, 0.31% False Negative, 0.156% DK  40 % P2P tra.c: 0% False positive, 0.34% False Negative, 0.149% DK  Even if we add all these probabilities together (as the probability of misclassi.cation), the probabilities compare very well with the misclassi.cation probabilities reported in [10] for the heuristics themselves (for example, false positive rates of 6%).
Sentence 2: the slight loss in .delity is compensated by a very large factor reduction in memory (from 96 bits per .ow in the naive scheme to 18 bits per .ow using ACSMs).
Relationship: contrasting
Domain: Networks
Sentence 1: Accord­ing to this idea there are some licensees who are authorized to use the spectrum by the related o.cial systems such as FCC in the United States and some other users who do not have the license to use the spectrum of those primary users.
Sentence 2: the secondary transmitters should not degrade the communication quality of service of the licensees and thus they should adjust their transmit power so that their in­terference in.icted upon primary receivers be less than a speci.c threshold set by primary users[1].
Relationship: contrasting
Domain: Networks
Sentence 1: So far, our discussion of interdo­main routing has focused on designs that maintain the current Internet service model of sending and receiving packets to destinations (which themselves might be unicast, multicast, or anycast).
Sentence 2: 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).
Relationship: contrasting
Domain: Networks
Sentence 1: Alternatively, dAPs in each cluster can run CSMA independently and start synchronous netMIMO transmissions if they acquire channels simultaneously.
Sentence 2: such opportunities are rare due to the decentralized and Figure 3: In an unbalanced topology, concurrently serving two clients results in underutilization of the dAP s power budget, leading to low-rate for both.
Relationship: contrasting
Domain: Networks
Sentence 1: Since there are L{1,2,...,m} time slots left after the server accomplishes jobs from the .rst m clients, we have: E[pm+1|S, L{1,2,...,m} = s] =P rob{the job of client m +1 is accomplished in t - s attempts} =1 - (1 - pm+1)t-s .
Sentence 2: since L{1,2,...,m} - L{1,2,...,m+1} is the number of attempts that the server makes for a job from client less applications, we believe that WLANs can particularly ben­e.t most from our study due to their wide deployment, and increasing demands of QoS support.
Relationship: contrasting
Domain: Networks
Sentence 1: 2.5 Complexity and Overhead The NSV edge identi.cation, network partitioning and projec­tion are all done locally by the individual nodes, thus resulting in a constant computation complexity and communication overhead.
Sentence 2: to initiate projection, a local .ooding is required in all in­dividual patches, which together yield a communication overhead of O(n) in the entire network, where n is the total number of nodes in the network.
Relationship: contrasting
Domain: Networks
Sentence 1: In general, the measured strengths of RF-EMFs in ur­ban environments are considerably below the exposure limits that are known to be hazardous [2].
Sentence 2: many e.ects of RF-EMF radiation on the human body are not well un­derstood because there is a lack of long-term and large-scale epidemiological studies quantifying these e.ects [10].
Relationship: contrasting
Domain: Networks
Sentence 1: First, as expected from pre­vious work, we .nd an extremely slow rate of .xing, with 30% of the hosts vulnerable when we began our survey on day 4 after disclosure still vulnerable almost six months later.
Sentence 2: unlike conventional vulnerabilities, which typically show a short, fast .xing phase, we observe a much .atter curve with .xing extending six months after the an­nouncement.
Relationship: contrasting
Domain: Networks
Sentence 1: One Chord network model, with its non-central control, strong scalability, load balancing, fault tolerance, and to make inquiries with high directivity makes the advantages of P2P is more prominent.
Sentence 2: in reality, Chord ring there is a big difference between the nodes, there are many weak nodes in Chord when nodes as independent, but also responsible for a large number of queries the system and downloads.
Relationship: contrasting
Domain: Networks
Sentence 1: 8(b) shows the PSNR of the received video both with and withoutinterferencefrom ourUSRP-based802.11implementation.
Sentence 2: the .gure shows that at the closest two locations, which are less than6feet awayfrom the802.11interferer, the videois not watch­able.fortherestof thelocations,thevideoquality stays watchable.
Relationship: contrasting
Domain: Networks
Sentence 1: ARIADNE proposes a clustering-based search algorithm for the indoor localization of a mobile user based on the following .nd­ ings: ARIADNE constructs .ne-grid signal strength map SS-MAP based on the radio propagation model and the site-speci.c geometry of the building;  The SS-MAP from the propagation model provides real-time estimates without further human intervention.
Sentence 2: it is only a close .t to the measurements, or in other words, it is imprecise and small estimation errors are expected for some locations;  Consequently, LMSE may result multiple possible locations in the SS-MAP table, or the unique location corresponding to the LMSE is not necessarily the right position;  If a set of positions (corresponding to low mean square error with respect to a predetermined threshold) is selected, the positions can be grouped into several clusters.
Relationship: contrasting
Domain: Networks
Sentence 1: Thus, Wi-Fi network should be the first priority chosen to be setup in indoor setting when the Internet cables are wired in the building.
Sentence 2: if it is an outdoor environment or if the indoor building have not been wired with the Internet cables, the Pre-WiMAX or EVDO Ad-Hoc Networks can be chosen to be setup very quickly to provide Internet communications service.
Relationship: contrasting
Domain: Networks
Sentence 1: Here, the coupling of an evolu­tionary algorithm for the optimization process with a SAT solver as a powerful repair strategy requires to formulate the constraints for a feasible system implementation as a 0­1 Integer Linear Program (ILP), as it is e.ciently solvable by Pseudo-Boolean (PB) solvers.
Sentence 2: their proposed routing encoding relies on a hop-based strategy to extract valid routings for multi-hop communications for each system implementation: For each message, beside variables cr sig­naling the usage of a resource for the routing of message c, they create a matrix of variables cr,t with one dimension for resources and one for the number of allowed hops (at least the network diameter) which encode the exact hop number of a resource within the routing, see Fig.1.
Relationship: contrasting
Domain: Networks
Sentence 1: While WiFi provides substantially better median throughput in the short drive (roughly 2400 Kbps vs. 500 Kbps) the me­dian throughputs are similar in the long drive.
Sentence 2: wiFi has zero throughput on more occasions (roughly 25% vs. 10% for the long drive and 42% vs. 15% for the short drive).
Relationship: contrasting
Domain: Networks
Sentence 1: Ethane has been shown to scale well for large enterprise networks (20000 hosts and 10000 new .ows/second).
Sentence 2: even if client au­thentication and encryption are disabled, centrally handing out and installing source routes in multiple switches at the start of each .ow may not scale to large data centers with hundreds of switches, serving 100s of thousands of simulta­neous .ows3 .
Relationship: contrasting
Domain: Networks
Sentence 1: Suppose that when a BS becomes unreachable, the average time required for the backup to de­tect that a BS is unreachable and assume the role of PC/PI is Tb, if the backup is not itself unreachable at that time.
Sentence 2: if the backup itself is unreachable at the time the PC/PI BS becomes unreachable (which happens with probability Tu/(Tu +Tr)), then the mobile may remain unreachable for a longer time in the worst case, until the mobile performs a subsequent location update with the net­work.
Relationship: contrasting
Domain: Networks
Sentence 1: Such a Markovian process enables closed-form or analytically-tractable solutions in the performance analyses.
Sentence 2: based on measurements, it was found that network technologies like Ethernet Local Area Network (LAN) and Integrated Services Digital Network (ISDN)1, application layer protocols like World Wide Web (WWW), TELNET and File Transfer Protocol (FTP), and signaling protocol like Common Channel Signaling Network (CCSN) have self-similar data traffic [4,6,12,13,18,20,27].
Relationship: contrasting
Domain: Networks
Sentence 1: We can notice that, as discussed in Section 3.3, the proportion of synchronized transmissions decreases with Pt because the number of one-hop neighbors also decreases.
Sentence 2: the .gures also show that, by reducing Pt,weob­tain much more collisions with hidden nodes (especially at a distance of 100 m), because the spatial reuse increases and nodes closer together can transmit at the same time.
Relationship: contrasting
Domain: Networks
Sentence 1: Therefore, it su.ces to .nd the basis that max­imizes the di.erence between the two ISNRs, which we call the di.erential ISNR.
Sentence 2: since the true f(t) and n(t) are not available directly, an approximation is required; we used the delay data of a congested path as f(t), and the di.erence between the delay data and its shifted version as an approximation of n(t)= f(t) -f(t -.max), where .max is the maximum possible synchronization error (1 second in this paper).
Relationship: contrasting
Domain: Networks
Sentence 1: Enhancing Location Services with Prediction Ebtisam Amar University of Pierre and Marie Curie Paris, France ebtisam.amar@etu.upmc.fr ABSTRACT Position-based routing is often proposed as a means to achieve scalability in large mobile ad hoc networks.
Sentence 2: such routing protocols are heavily dependent on the existence of scalable location management services.
Relationship: contrasting
Domain: Networks
Sentence 1: 2.3.3, to maximize the collection of delay samples in front of packet loss, each vLDA should sample the incoming packet stream at rate L/k, where L corresponds to its associated number of losses and k to its length.
Sentence 2: in a real scenario, the absolute number of losses that each .ow will experience is unpredictable, which raises the question of how to set the sampling rate.
Relationship: contrasting
Domain: Networks
Sentence 1: 6.3 Comparison of Routing Overhead Theroutingoverheaddesribeshowmanyroutingmes­sagesforroutedisoveryandroutemaintenaneneedtobe sentinordertopropagatethedatamessages.Inthispaper, theroutingoverheadisobtainedasfollows: ontrolinBytes Overhead=(I)ontrolinBytes+DatainBytes whereontrolnyeisthetotalnumberofontrolbytes iBtstransmittedandDatainBytesisthetotalnumberofdata bytesreeived.Intheproposedprotool,theadditionalof ontrolbytesaountsforRSETandRNTFmessagesaswell asthepiggybakedneighborinformationofthenodesinthe RREPmessage.However,theroutingoverheadremainsfair whenthenumberoftraffowsinreases,beausethenum­berofontrolbytestransmittedisalmostonstantwithout hangewiththeinreasingtraffow.Weanseefrom Fig.I4andI5thattheroutingoverheadsofTBRprotool andproposedprotoolbeomeverylosewitheahothersas 20 40 60 80100 Number of nodes FigureI3:Averageend-to-enddelayasafuntionofnumber ofnodes(40fowswith50pakets/seond).
Sentence 2: thenumberoftraffowsbeomeslargeorasthenumberof nodesbeomesless.simulationresultsshowthat whennodesaremoving,theroutingoverheadforbothpro­toolsisabouttwieaslargeasthatoftheroutingoverhead whenthenetworkisstati.
Relationship: contrasting
Domain: Networks
Sentence 1: The buffers within an NoC router can be implemented as either registers or SRAM/DRAM memory [32, 33].
Sentence 2: given the relatively small buffer sizes employed, it is more reasonable to use small registers as buffers to avoid the address decoding/encoding latencies of big memories  ViChaR s UBS H=Head flit k  k k vk vk in-use v in-use Between v VCs VCs and vk (1 slot/VC) (k slots/VC) in-use VCs Figure 4.
Relationship: contrasting
Domain: Networks
Sentence 1: We can take advantage of the second term of equations (2) and (3) as an evidence for deciding whether MN#2 is a misbehaving node or not.
Sentence 2: since there exist liars who respond to a successful transaction with bad reputation or a misbehaved transaction with good reputation, the second term of equations (2) and (3) are weighted by the confidence value CNA,i(tn), where i .
Relationship: contrasting
Domain: Networks
Sentence 1: Communicating via Fire.ies: Geographic Routing on Duty-Cycled Sensors Suman Nath Microsoft Research sumann@microsoft.com ABSTRACT Geographic routing is a useful and scalable point-to-point commu­nication primitive for wireless sensor networks.
Sentence 2: previous work on geographic routing makes the unrealistic assumption that all the nodes in the network are awake during routing.
Relationship: contrasting
Domain: Networks
Sentence 1: We expect that most systems that use SWAMP will do well to structure their scene-graphs using instantiated PROTOs, and use SWAMP to describe changes to PROTO fields, as is done in the successful [Blaxxun 2006] system for avatars and objects.
Sentence 2: our SWAMP-based multi-user systems extend previous object and avatar PROTOs in an important way, by adding a velocity field.
Relationship: contrasting
Domain: Networks
Sentence 1: Thus, the percents in Table 4 should be viewed as approxi­mations.
Sentence 2: the implication from Table 4, consistent with Figure 1, is that the ECT codepoint is not only be­ing cleared in the origin (and destination AS), but also at intermediate AS s. Other notable behaviors For 99% of the website and pre.x traces, the quoted ECN .eld from probe responses had either ECT set for all hops or had ECT cleared at some hop and the .eld remained cleared.
Relationship: contrasting
Domain: Networks
Sentence 1: In this research, the loss due to the spread between .oors was considered null, LF (n)= 0, because the measurements were made on a single .oor, the same .oor where the APs are installed.
Sentence 2: the attenuation coe.cient N depends on the operating frequency and the type of es­tablishment where the WiFi network is installed, according to Table 1.
Relationship: contrasting
Domain: Networks
Sentence 1: Since most often the size (i.e., the length and the width) of such terrestrial networks is significantly larger than the differences in the third dimension (i.e., the height) of the nodes, the 2D assumption is somewhat justified and usually it does not lead to major inaccuracies.
Sentence 2: in some environments, this is not the case; the underwater, atmospheric, or space communications being such apparent examples.
Relationship: contrasting
Domain: Networks
Sentence 1: Clearly,h(r)asymptoticallygoes to p as r getslarger since con­current transmissions fromdistant nodes become independent.
Sentence 2: the p-persistent Aloha scheme can be modeled by setting h(r)= p. 5.1.3 Receptionprobability For a transmission from node i, the reception probability at a receiver j is determined by the product of the probability that j is idle and the transmission from i and j is successful when j is idle.Thenthe .rstprobabilityisgivenby 1-h(dij).
Relationship: contrasting
Domain: Networks
Sentence 1: On the other hand, if |GI (u)|=CG, the security is said to be topology depen­dent, i.e., the network code is considered secure if and only if Rank(MGI (u))< CG .
Sentence 2: as there is no constraint imposed on how G =(V,E)would be generated in Theorem 2, the resulted graph might violate the internal security re­quirements.
Relationship: contrasting
Domain: Networks
Sentence 1: This explains Dilemma 1 in­troduced in Section 3.1: under the random walk model, if the node speed is 1 m/s, an infected device collects fewer neigh­bors than that under the random direction model, although the node degree distributions produced from both models are similar.
Sentence 2: if we increase the node speed up to 3 m/s, the increased dynamics of the device neighborhood relationship under the random walk model results that infected and unin­fected devices are well mixed, thus eliminating the constraint that exists at a lower node speed.
Relationship: contrasting
Domain: Networks
Sentence 1: Lookup (or routing) protocols such as CAN [24], Chord [31], and Pastry [27] guarantee locating the requested object within a loga­rithmic number of steps, if the object exists in the system.
Sentence 2: aggregated streaming rate at receiver (Kb/s) 800 700 600 500 400 300 200 100 0 Time (seconds) Figure 12: Streaming from multiple peers.
Relationship: contrasting
Domain: Networks
Sentence 1: It should be noted that, in Figure 2, the SIP Application Server (SIP AS) is shown as the only service that the SP is providing.
Sentence 2: the SP could deploy even a non-SIP service (e.g., IPTV [6]) as long as that non-SIP service could be delivered through a session established by the SIP signaling messages.
Relationship: contrasting
Domain: Networks
Sentence 1: For example, the 802.15.4 MAC layers uses preambles to synchronize sleeping senders and receivers, the 802.11 power save mode (PSM) relies on the access point bu.ering, and TDMA MACs have .xed slots, allowing a device to sleep for a .xed duration without the risk of missing messages.
Sentence 2: ePC Gen 2 has non­deterministic arrival times of messages and variable round lengths.
Relationship: contrasting
Domain: Networks
Sentence 1: If it is not possible to snoop packets of an intended receiver (this is possible if the local node is out of reception range of the transmission but within the carrier sense range of the transmission), the wi.-array will depend on adaptive carrier sense to determine if a particular channel is free.
Sentence 2: if the receiver wi.-array is busy with some other interaction, it will not send any ACKs.
Relationship: contrasting