sadat2307/MSciNLI huggingface dataset:
Domain: Software and its engineering
Sentence 1: (ii) We then observe that, on these neighbourhoods, A be­haves like an OI-algorithm: A s output cannot change if we relabel a node in an order-preserving fashion, because the changes in the output would have to prop­agate outside of A s run-time.
Sentence 2: our simulation OI r ID will work only on certain types of neighbourhoods (in contrast to our previous simu­lations), but this will be su.cient for the purposes of the lower bound proof.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Also, in addition to type annotations on ex­pressions, OCaml provides several ways to introduce explicit type informations (and thus obtain the acyclicity condition): datatype de.nitions (explicit types for constructor and exception arguments, record .elds), module signatures, type annotations on ML pattern variables.
Sentence 2: because of its global .ow analysis .avor, OCamlDuce s type system is much less modular than OCaml s. all the call sites of a function which expects XML values as arguments can contribute to the result type of the function.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: The rationaleis clear, as wider candidate scan anglesprovide adaptiveMSP more op­portunityto choosethe one approachingthe optimalangle.
Sentence 2: 8.6 SimulationSummary Starting from basic MSP, we have demonstrated step-by­stephowfour optimizations canbe applied ontop of eachother toimprovelocalizationperformance.these op­timizations are compatible with each other and canjointlyim­prove the overall performance.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: In the case of a branch pointing to the future, we consider behaviors imme­diately preceding the anomaly, i.e., immediately preceding the extension start point, alternative to the anomaly, i.e., between the extension start and end points, and immedi­ately following the anomaly, i.e., immediately following the extension end point.
Sentence 2: we consider the event sequences that can be obtained by concatenating the se­quences of maximum length k1 that can be generated before the extension start point, the sequences of events that can be generated between the extension start point and the ex­tension end point by traversing each state at most twice, and the sequences of events of maximum length k2 that can be generated after the extension end point.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: In this case DHCH = 0 if and only if DH = 0, i.e., X1 = X2 = ··· = Xn-f.
Sentence 2: if all nodes in subgraph H are fault-free, and Xi * Xj for two fault-free nodes i, j,then DHCH * 0 and hence the check in step 2 of Algorithm 1 fails at some fault-free node in H. We then further show that, for large enough L, with a non­zero probability, this is also simultaneously true for all sub­graphs H .
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Second, the expression layer is state free, with all local variableinstantiations lost between execution cycles, and the coordinationlayer state is only retained on wires.
Sentence 2: explicit feedbackwires from a box s outputs to its inputs enable individual boxes toretainstate between execution cycles, andare the basis of box itera-tion.This addresses many problems encountered in other high levelapproaches to FPGA programming, in which complex synchroni­sation protocols must be made explicit at the expression level.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: 8 cc uc Y= F1 (X,Xc,Y ,f1) > 1 > > > ··· > < cc uccc Yi = Fi (X,Xc,Y ,Y 1 , ··· ,Y i-1,fi) .
Sentence 2: (fi)i=l > ··· > cc uccc > > Y= Fn(X,Xc,Y ,Y 1 , ··· ,Y ,fl) > ll-1 : ' K (X,Xc,Y uc) whatever the valuation of a tuple (x,x c ,y uc ,y c), there exists a valuation (vfi )i=l of (fi)i=l such that yic = c cuc Fi (x,x ,y ,vfi ).
Relationship: entailment
Domain: Software and its engineering
Sentence 1: The behavior of the communication in cases three to .ve is controlled by two parameters, K and D. As can be seen in Figures 1, 2 and 3, K controls the size of each tile and D speci.es the delay (in tiles) after which the application will block waiting for a network operation to complete.
Sentence 2: d determines the size of a non acked window.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: This approach avoids the need for a new translator and simpli.es the logic of inte­grators processing imported requirements speci.cations.
Sentence 2: after the paragraph to section transformer has been loaded into In.niTe s structure server, the cohesion integrator can simply ask a requirements speci.cation doc­ument for its information in section format.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: B/n+be To understand the extent of this loss in power propor­tionality, we built a data layout simulator that allows us to understand thefactors on which thedegree ofpowerpropor­tionality depends.
Sentence 2: we investigate the depen­dence on the total number of datasets stored in the cluster and the number of live datasets.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: For these reasons, the  (b) IBM Real-time Linux (2.6.16RTJ12-SMP) Figure 2: Thread Scheduling Accuracy RTAOTcompiler cannot use information about .elds, methods, or classeswhile generatingcodeaseffectivelyastheRTJIT compiler can.
Sentence 2: the AOT compiler cannot perform aggressive inlining and must generate all static, .eld, method, and class ref­erences as unresolved.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: The team members with whom sub­jects interacted were all actually virtual entities: confederates, which were controlled by a member of our research team, so conflicts could be inserted in a controlled manner in the other­wise unpredictable activity of programming.
Sentence 2: both direct and indirect conflicts were inserted in the exact same manner at the exact same time related to when a subject started a certain modification task.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: This inconclusive task timing result is in contrast to the categorical results we observed in terms of the correctness and e.ciency of the code J written by the participants and the synthe­sized code S derived from the programmer s abstraction function A.
Sentence 2: the choice of technology does not have strong predictive value for how long it will take a programmer to produce a .rst draft, but it does strongly predict whether that .rst draft will be correct and e.cient.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: U that is connected to both of them.
Sentence 2: this typically implies that the geographic locations of v and w are relatively close to each other, and therefore it is likely that there is also a short path in the operator s backbone that connects v and w. if algorithm A is local (in terms of graph G), then each SDN controller only needs information that is near it (in terms of shortest-path distances in the operator s backbone).
Relationship: entailment
Domain: Software and its engineering
Sentence 1: , ri(vi)} we de.ne its goodness the following value: X G(R) = RP(ri) · vi i The meaning of the addition and multiplication opera­tors are overloaded in order to cope with the non-natural resource types.
Sentence 2: in the case of boolean-typed resources we consider the boolean value true as if it was the natural number 1 and the boolean value f alse as if it was the natural number 0.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Since in phase 1 we computed that q =3, Q =4, and T =50,wehave: t[x1,Q] = t[x1,q]+ max{(1 + d)T,tß [x1,Q] - tß [x1,q]} = 170, t[x2,Q] = t[x2,q]+ max{(1 + d)T,tß [x2,Q] - tß [x2,q]} = 210, t[x3,Q] = t[x3,q]+ max{(1 + d)T,tß [x3,Q] - tß [x3,q]} = 190.
Sentence 2: as speci.ed by Expression (11), after scaling the volt­ages/frequencies of the communication channels, the start times of the Qth iterations of loops x1, x2, and x3 cannot be later than 170, 210, and 190, respectively.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Notice that, in the interference graph model, each variable/name is considered as an atomic object, i.e., it will be placed in the same register all along its live-range.
Sentence 2: borrowing the subtle title of Cytron and Fer­rante s paper [15], what s in a name has already been de­cided and no more live-range splitting [13] will be done.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: 30 95440 Bayreuth, Germany felix.schwaegerl@uni­bayreuth.de 95440 Bayreuth, Germany sabrina.uhrig@uni­bayreuth.de 95440 Bayreuth, Germany bernhard.westfechtel@uni­bayreuth.de  ABSTRACT Inadequate version control has been identi.ed as a major obstacle to the application of model-driven software engi­neering.
Sentence 2: sophisticated support for merging model versions is urgently needed.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Most fundamentally, Rugina computes the size of ar­rays backwardly, i.e., he draws information from array ac­cesses, we do it forwardly, i.e., we draw information from allocation sites.
Sentence 2: from an array access such as *a = e, Rugina assigns to a a minimum index given by e. and a maximum index given by e..
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Second, our experiments show that on current architec­tures, a single level of cache tiling and modest prefetching are adequate to generate high-performance matrix multipli­cation code.
Sentence 2: it is su.cient to tile approxi­mately for the L2 cache on most current architectures, so adapting to all levels of the memory hierarchy by generat­ing a range of tile sizes using divide-and-conquer appears to be unnecessary.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Let P (l) be the set in the generated partition P(l)  PF (l) of largest cardinality and c(l) = |P (l)|.
Sentence 2: max (l) (l) cmax represents the largest consent found between the nreplicas at the end of voting round l. Then, in order for the majority voting procedure to be able to adjudicate the result of the scheme, there should be a consensus amongst (l) an absolute majority of the n(l) versions, i.e.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: To solve this problem we impose the rule that if a pro­cess loses in A when it has already won a (deterministic or randomized) splitter object in RatRace, then the process continues to execute RatRace.
Sentence 2: we use the follow­ing rules to combine the two executions with the help of an auxiliary LeaderElect object LEtop.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Fixing an input vector x to a randomized balancing net­work induces a probability measure P on associated events.
Sentence 2: it induces for each layer f with 1 = f = d(Bw) a random vector y(f); y(f) is determined by (i) the (ran­dom) input vector x(f)and (ii) the random variables rb corresponding to the orientation of the balancers in layer f. Write y = y(d(Bw)) to denote the (random) output vector of Bw;hence, Bw(x)= y.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: A pre-condition (condition C2 in [16]) necessary for the va­lidity of the procedure in [16] states that for every state s in model M, the probability that a path starting from s sat­is.es .1 U .2 must not lie in the range (0,d2/(1 - ps)N], where N is the number of states in M , and d2 and ps are user-speci.ed positive parameters.
Sentence 2: if the probability of any path satisfying .1 U .2 is p (> 0), then d2 must be selected such that p>d2/(1 - ps)N .
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Table 6 describes test results achieved by the Similarity Flooding algorithm, the V-Doc System and the Cupid al­gorithm.
Sentence 2: table 7 summarizes all their global performances along with the Indigo s. the two last columns present the results obtained with Indigo forboth (1)average­based and (2) stacking-based alignments.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: This poses a more subtle problem when hav­ing to select the right order in which to solve them (in the fully imperative case), and also serves as a stress test for the transcoping process presented in this paper.
Sentence 2: for simpler invariants (such as, for instance, that of singly linked lists: merely acyclicity and the size matching the number of nodes), the different alternative con.gurations are just a few, making the problem of correctly selecting the right order for generation a much easier one.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: We would like to show that if t is the image of an SDP type, then all terms of type t are equivalent to the encoding of some SDP term.
Sentence 2: there is no extra junk of type t. Show­ing this result would also show that encoding the .-calculus with app and lam is adequate, because the SDP calculus can already adequately encode the .-calculus.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: As a proof of concept, we show how the machinery developed can be used to study some metadata management problems in the context of data exchange.
Sentence 2: we provide simpler proofs for some fundamental results regarding the inverse operator pro­posed by Fagin [11], and we also give an effective characteriza­tion for the decidability of the well-known schema evolution prob­lem [22, 19].
Relationship: entailment
Domain: Software and its engineering
Sentence 1: However, we observed occurrences in our traces where these two consecutive queries (which we can attribute to the same interaction because both embed the same client IP address) came from di.erent LDNS servers.
Sentence 2: even though we sent our CNAME response to one LDNS, we got the subsequent sub2 query from a dif­ferent LDNS.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: The control input is u(t)= K x(t) + uad (t), (25) where the adaptive input uad (t) partially cancels the un­certainty, and the nominal feedback K x stabilizes the sys­tem.
Sentence 2: the feedback gain K ensures that Am = A0 + BK is Hurwitz and therefore there must ex- Rn×n ist two positive-de.nite matrices P , Q .
Relationship: entailment
Domain: Software and its engineering
Sentence 1: A user story was considered as being delivered when at least 50% of the acceptance tests that were associated with that user story pass.
Sentence 2: the quality of the single user story is: #asserti(Pass) QLT Yi = (2) #asserti(Total) the metric represented the ratio of the pass­ing assert statements from the acceptance test that was as­sociated with that user story over all the assert statements that were associated with the same user story.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: These properties are: 1) Customization: Characterizes a tool in terms of its configuration possibilities.
Sentence 2: how the tool handles the selection of the available attacks, how they can be combined, or how they can be configured (e.g., to execute for a given amount of time, until a certain amount of invocations); 2) Ease of use: The tool should be intuitive and easy to use, even for users with scarce experience in security testing.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: CORE COMPONENT VARIABILITY Managing the commonality as well as the di.erences be­tween distinct products realized through PLE certainly is one of the key challenges within PLE.
Sentence 2: com­monality refers to the di.erent artifacts shared by all mem­bers of the product lines, whereas variability describes how the di.erent products of the product line vary.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: To that end, we further analyzed the 52 workarounds that we found in the bug-tracking repositories of Google Maps and YouTube (43 and 9, respectively).
Sentence 2: we tried to distinguish between ad-hoc, hardly generalizable workarounds or work­arounds that are simply not deployable at runtime, from more general workarounds that are amenable to a runtime deployment.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: As a consequence, system failures and performance degrada­tion can suddenly arise, directly impacting the global quality of the system.
Sentence 2: the increased complexity will come with many new aspects that may greatly a.ect system quality and health, and will not be addressed by traditional soft­ware engineering best-practices: Transient faults: in complex systems, new faults (we refer to these faults as transient faults) can stem from un­expected interactions between independently developed de­vices and applications, unpredictable stress and interfer­ences of the environment, or hardware aging.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: By implementing R as an object-oriented frame­work that is extended to support different computing plat­forms, we allow programmers to write polylingual programs using a uniform language notation without having to bother about peculiarities of each platform.
Sentence 2: for Java we have separate extensions of the framework that allows Java pro-grams to manipulate C# objects, another extension to manipu­late XML documents, etc.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: We believe that such analy- sis is needed to realistically bound the scalability limit in the next few technology generations.
Sentence 2: power dissi- pation must be carefully minimized to avoid design points which on paper promise ever higher performance, yet un- der normal operating conditions, with commodity packag- ing and air cooling, only deliver a fraction of the theoretical peak performance.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: The function vslice denotes a sub-vector.
Sentence 2: plate classes for vectors and matrices residing on the GPU, which are mapped to Barracuda s VExp and MExp type constructors: template  class gpu_vector; template <class T> class gpu_matrix; the location of arrays in the generated code is explicit in the types, and the caller of the code is responsible for deciding when to copy between device memory and main memory, which is one of the most costly operations of CUDA programming.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: To simplify reasoning about dimension models, we require that any included cardinality constraints be consistent and minimal.
Sentence 2: we disallow models with constraints that con.ict with one another, such as |c|= k and |c|= k +1, or that are mutually redundant, such as |c|= k and |c|= k+1.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: (assignconcat 1 "(CO, (ALPHA(x!1), (ALPHA(x!1) + OMEGA(x!1))/2))" "(CO, ((ALPHA(x!1) + OMEGA(x!1))/2, OMEGA(x!1)))") Note that the above instantiation is validated by the PVS prover for its correctness.
Sentence 2: we are required to show that two speci.ed intervals ful.ll the constraints of a concatenation.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: However, new byte-addressable persistent memory technologies (BPRAM) eliminate many of the traditional differences between volatile and non-volatile storage.
Sentence 2: technologies such as phase change memory and memristors are byte-addressable like DRAM, persistent like disk and .ash, and up to four orders of mag­nitude faster than disk or .ash for typical .le system I/O.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Namely, provided that we de.ne the subst{bt; t} operation to compute the result of substituting a closed term t for the .rst outer binder of the bterm bt, we can state that subst{bnd{x.t1[x]} ; t2} = t1[t2] (3) (where t1 and t2 are literal second-order variables).
Sentence 2: we can state that the substitution operator subst and the implicit second-order substitution in the meta-meta- language are equiv­alent.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: 5.3.1 Social-Aware Cache Replacement In PSAR, a peer locally performs the cache replacement using not only the perceived video popularity, but also the local social factors.
Sentence 2: the following information is used at peer i: (1) the local popularity which is the number of requests for video v received by peer i, denoted as piv;(2) the fraction of peer i s friends that can join the propagation tree of video v, denoted as fiv .
Relationship: entailment
Domain: Software and its engineering
Sentence 1: CASE STUDIES The Monaco system has been validated using a set of typical sce­narios, starting from simple machines to small manufacturing cells.
Sentence 2: we have reimplemented two existing automa­tion solutions from our industrial partner, both currently imple­mented with the IEC-61131-3 languages Structured Text and Se­quential Function Charts.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: When one page is allocated for an over.owing stack in a task T, the upper limit for that task is reduced by the page size.
Sentence 2: in e.ect, the available stack size in task T is reduced by the size of the page, until the over.owing stack remains in task T. To recede the over.ow pointer, run-time checks are in­serted by the compiler at the exit of every procedure.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: 1 One way to avoid introducing forwarding pointers is to delay oper-2 ations that create them until a local garbage collection is triggered.
Sentence 2: 3 rather than executing a store operation that would 4 trigger lifting a thread local object to the shared heap, we can sim-5 ply procrastinate, thereby stalling the thread that needs to perform  6 the store.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: (vi) Visualization The properties determined by the EC system should be shown to users by means of e.ective visualizations techniques.
Sentence 2: an EC interface must entail three components: (a) a canvas in which datasets are visual­ized; (b) widgets where the classi.cation taxonomy and the properties of current sets are shown and through which selections are performed; (c) an operation panel with ad­ditional utilities.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: While in DSL, the requirement for including keywords to .nd a path between the sender and the recipient prevents a spammer from send­ing messages to other nodes without appropriate knowledge about the possible keyword and path combinations to reach the recipient.
Sentence 2: a sender has to choose the cor­rect keywords and links to establish a routable path, which varies from di.erent starting and ending nodes.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: The speci.cations considered in this paper are an inter­section of a safety speci.cation and a liveness speci.cation [1,13].
Sentence 2: we concentrate on a special case where the speci.cation is the intersection of (1) timing independent safety characterized by a set of bad instantaneous transitions (denoted SPEC bt), (2) timing dependent safety character­ized by a set of stable bounded response properties (denoted SPEC br ), and (3) liveness.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: 2; and L1 becomes: L1 no computation = aI + eI + DI + .i (7) With Cp =0, L0 is guaranteed to be strictly less than L1, as shown by the following equation: L0 no computation = aI + eI + max(DI ,.i) (8) The currently known message scheduling strive to overlap communication with computation; but they don t push the optimizations to the extent of reaching the latency model expressed by L0.
Sentence 2: mVAPICH and OpenMPI, which are the two major freely available MPI implementa­tions over commodity RDMA-enabled networks do not o.er a design compatible with Eq.
Relationship: entailment