sadat2307/MSciNLI huggingface dataset:
Domain: Software and its engineering
Sentence 1: We show in Appendix A that for a memory hierarchy with N cache levels (L1, L2, L3,..., LN, memory) and a miss cluster of C + N Csize C, there are (5) Pr[H]=1 -p. Then the probability of a miss in the ith Mi Mi = = .
Sentence 2: cluster is pi Mi+Hi Ti The L2 miss ratio p is related to the miss ratios of the individual clusters in the following manner, p = M = 1 Mi M1 (T1 (T2 MN (TN = T )+ M2 T )+... T ) T T1 T2 TN =p1(TT 1 )+p2(TT 2 )+p3(TT 3 )+...pN(TT N ) the miss ratio is the weighted sum of the miss ratios for each miss cluster size, where the weights are the probabilities of a hit or miss to a given cluster size.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: http://dx.doi.org/10.1145/2502081.2502114  Hans Stokking TNO Netherlands Organisation for Applied Scientific Research Brassersplein 2, Delft (the Netherlands) +31 88 86 67278 hans.stokking@tno.nl However, realizing those shared interactive services faces a lot of challenges [2].
Sentence 2: this paper focuses on the provisioning of synchronized playout in all the involved consumer devices.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: SAFETY In this section we discuss our su.cient condition for safely introducing a cache at an allocation site s. The introduction of a cache at an allocation site (to implement hash-consing style ob ject-sharing) can be said to be safe if the refactoring causes no change in the observable behavior of the program.
Sentence 2: whenever a newly created ob ject or is replaced by another object os that is in the cache, the rest of the run is identical to the rest of the run had the replacement not occurred, in terms of both the sequence of instructions ex­ecuted, as well as the updates to the state of the program performed by corresponding pairs of instructions in the two runs.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: FUTURE WORK In this paper, I provided a sketch of the commonly as­sumed planning model and its special properties in com­parison to other classical planning problems.
Sentence 2: i pointed out that, in contrast to classical planning prob­lems, there is an in.nite set of ob jects in automated soft­ware composition, that objects have no extralogical built-in semantics, and that there are restrictions on the planning order.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: a set of models which are coupled with the considered metamodel by means of the dependsOn relation.
Sentence 2: the generative component (GMF Tooling) of GMF supports a model-driven pro­cess (see Figure 4) for generating a fully functional graphical editor starting from the following models: the domain model is the Ecore-based metamodel of the lan­guage for which representation and editing have to be pro­vided;  the graphical de.nition model contains part of the concrete syntax; it identi.es graphical elements that may, in fact, be reused for different editors;  the tooling de.nition model contains another part of the con­crete syntax; it contributes to palettes, menus, toolbars, and other periphery of the editor;  ideally, the aforementioned models must be reusable as they do not contain references to each other.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Therefore, most of the nodes handle most of the subscriptions, while only a small set of nodes, namely those placed in the middle of the tree (i.e., at the lowest levels) dispatch most of the events.
Sentence 2: figure 9(b) shows that the maximum forwarding load due to events is incurred by the nodes on the sec­ond level.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: The last phase is the actual data transmission phase.
Sentence 2: in Initial Fraction Exchange Phase (Al­gorithm 1), each node v determines the number of neighbors .v that will send data to v.kv = |Pd(v)|represents the number of neighbors of v that have either a smaller hop-distance from the source or the same hop­distance but a smaller id.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: We catalogue problems according to their local proof com­plexities, and we show that the LCP(f) classes form a natu­ral hierarchy of decision problems.
Sentence 2: there are natural graph problems that separate the following levels of the hierarchy: LCP(0), LCP(O(1)), LCP(O(log n)), and LCP(poly(n)); see Table 1.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: user request query type and context A series of experiments were conducted to evaluate the potential bene.ts of the XSnippet system.
Sentence 2: the experiments were designed to test the following hypotheses: Hypothesis 1: Generalized queries, IQG, provide better cover­age of tasks than the specialized queries IQT and IQP (see Sec­tion 6.2 for results).
Relationship: entailment
Domain: Software and its engineering
Sentence 1: However,in ordertodobetter thanrandom guessing, p must use information from probesperformedby at least(n/B)-1 other players.
Sentence 2: ideally, player p would collaborate with the (n/B)- 1 players that have preferences most similar to p. player p would collaborate with a set of players P with min­imum diameter.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: The total time complexity is the sum of #firedTimes over all rules, minimized symbolically with respect to the given sizes and the constraints.
Sentence 2: if a relative argument size is needed but not given, we use the corresponding non­relative argument size; if an argument size #P.I is used but not given, we use the minimum of (i) the product of domain sizes for arguments of P that are in I and (ii) the argument size of P for arguments that are a superset of I,if given.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: WeBWorK [7,33]is a web-basedapplication that allows teach­ers to post math or physics problems for their students to solve online.
Sentence 2: teacher-supplied WeBWorK prob­lems are interpreted by the application server as content­generatingscripts.Itis uniquefromtraditional web applications in its collaborative content considered by some a distinctive Web2.0 feature.Speci.cally,its requestprocessingisheavily dependent on content supplied by end users teachers in this case.OurWeBWorKinstallation runsApache2.2.8 web server, a variety of Perl PHP modules, and the Moodle course man­agement system [2].
Relationship: entailment
Domain: Software and its engineering
Sentence 1: In our running example, the va_fptr value representing printf would have the following type:4 val printf : (string, sint) va_fptr A use of printf with an int and a double argument then looks like this.
Sentence 2: va_call printf (va_ml_sint o va_ml_double) "x=%d y=%f" 3 Math.pi the instantiated printf (without its arguments) has the following type.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: In computing DS graphs as de.ned above, the naming scheme used to distinguish heap objects can have a strong in.uence on the outcome of transformations such as Pool Allocation and Pointer Compression, both of which focus on heap objects.
Sentence 2: in order to segregate dis­tinct data structures into separate pools (and apply pointer­compression to each data structure separately), the pointer analysis must use a fully context-sensitive naming scheme for heap objects, i.e., distinguish heap objects by acyclic call paths.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: For example, the sim­ple pseudo-English statement  p lnpaD td op Enggioth sta a e mtnDp tgtp tmDnpgnid m can be automatically expanded into the more arcane formal statement: t D Dp tgte xDnpegn eio m e m aDdpegn eio m D tn (p Ea nggiot= sDdpegn eio m One drawback with temporal logic patterns is that while complex temporal formula can be automatically generated from intuitive pseudo-English, the execution cost remains.
Sentence 2: even though we can quickly build the properties model, we may not be able to explore all of that model.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: (S ' ; e ' ) is not as restrictive a requirement as it appears to be at .rst glance: it is .ne for S '' to contain bindings for locations that are bound in S ', as long as they are also locations bound in S. In fact, they may even be locations that were updated in the transition from (S; e) to (S ' ; e ' ), as long as they were not created during that transition.
Sentence 2: given a store S '' that is non­con.icting with (S; e) "-.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Following up with the previous example, let s say that S1.a1 is of type java.lang.String.
Sentence 2: in this case, the next example demonstrates how to invoke a method in the stream s attribute a1: SELECT a1.f1.toString() FROM S1 Invoking a complex type s constructor creates a new stream attribute of the type, as in the following example: SELECT java.lang.String( foo ) as a1 FROM S1 a new object of type String is created and associated as the value of the attribute a1 of the output stream of the query.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: ODI synopses are small-size digests of the partial results received at a node such that any particular sensor reading is accounted for only once.
Sentence 2: the synopsis at a node is the same regardless of (1) the order in which read­ings or partial results are received at the node, and (2) the number of times a given reading from a given sensor arrives at the node (either directly or indirectly via partial results).
Relationship: entailment
Domain: Software and its engineering
Sentence 1: In this study, we measure the sensitivity of the knapsack-derived schedules to variations in the pre­scribed allocation policies and their corresponding utility functions.
Sentence 2: we explore the e.ects of varying the strengths of an external user-speci.ed monetary metric, an intrinsic estimated response time mediated by nearness to completion time metric, and of varying the shape of a sigmoidal normalizing utility function.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Tony Clark School of Engineering and Information Sciences University of Middlesex, London, UK http://www.eis.mdx.ac.uk/staffpages/tonyclark/ t.n.clark@mdx.ac.uk The development of Gmodel relates to the second objective of the KISS initiative [3], and builds on the KISS results that have been achieved in 2009 [4].
Sentence 2: gmodel represents an attempt to provide explicit tool support for the full set of KISS principles: 1.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: This is a technique for reverse engineering that uses the morphology, or external interface of an application to uncover the ontology1 of an application, or the application s theory of the world .
Sentence 2: the message in the medium includes that a design is not neutral and reflects a 1 In computer science, an ontology is a data model that represents a set of concepts within a domain and the relationships between those concepts.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: The information we need to keep for restoring the JVM state at the region boundary should be basically the same for all three options above, but the way to reconstruct the new stack frame is different.
Sentence 2: the first two options need to create a set of stack frames according to the inlined context at the transfer point, while the third option can simply create a single new stack frame.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: In par­ticular, if the two calls to deposit1 are interleaved, the .nal value of balance may re.ect only one of the two deposits made to the account, which is clearly not the intended be­havior of the program.
Sentence 2: the program contains a race condition: two threads attempt to manipulate the .eld deposit1 simultaneously, with incorrect results.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Such baseline data can be useful, for example, in replication stud­ies that involve di.erent subjects and for which the sets of mutants and test cases may therefore di.er.
Sentence 2: we are interested to establish baseline data for the sizes of the SSHOM and SSHOMsRed sets, since these are compar­atively less well studied than .rst order mutants (the FOM set).
Relationship: entailment
Domain: Software and its engineering
Sentence 1: 4.1 Capabilities Our goal is to de.ne and enforce a notion of con-freeness for a program, rather than a program state.
Sentence 2: we wish to determine for a particular update whether it will be accept­able to update some type t. An update to t will be unacceptable if an occurrence of cont exists in any old code evaluated in the continuation of the update.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Since the interval of the progressive increase is small and the increase for each payload bit stops immediately when the corresponding payload bit is successfully embedded, the amount of correlation value over the detection threshold, denoted as D in the prescribed DII spread­spectrum watermarking model, will be small.
Sentence 2: all the payload bits are embedded weakly, but all of them can be extracted when the pre-negotiated manipulations are performed on the marked work before extraction is performed.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: The unique resource con­straints imposed by technologies like geosensor networks mean that traditional, centralized approaches to spatial computation are inef­.cient and not scalable.
Sentence 2: technologies like geosensor networks typically impose high costs on communicating data be­tween nodes (e.g., due to limited node energy), compared with rel­atively low costs of processing data at the node itself (necessitating so-called in-network processing) (cf.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: This also provides a nice opportunity for sanity checking --for example, if the current instruction branches back to another instruction for which the stack depth has already been cal- culated, then we can check whether the expected stack depth matches the current stack depth.
Sentence 2: a given instruction could be the target of multiple other instructions and the stack depth at all of those instructions must be consistent (oth- erwise, this indicates an error in the code genera- tor).
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Note that layered graphs are acyclic.
Sentence 2: we next observe that pointers in a layer r are not useful in realizing any edge in a layer l>r.if xis a pointer in layer l,and (x,y) is a realizable pair, then there is an execution sequence that realizes this pair without using any pointer in a layer r<l.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: For instance, instead of trying to request explicit check Random_access for pointer type T* individually for each type T, it is better to write the assertion in a template form assert template Random_access with { T*::value_type = T; // T* s value type is T }; With that assertion, when the compiler needs to evaluate Random_access for a given type argument A it .rst (in­ternally) generates the equivalent of assert Random_access with { A*::value_type = A; }; then evaluate that assertion, like in a non-template case.
Sentence 2: the program is erroneous if the generated asser­tion fails.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Assuming that the graph G has a max-min LP asso­ciated with it, the max-min LP associated with the unfolding G ' is de.ned by inheritance from the parent nodes and edges.
Sentence 2: the type of each node (agent, constraint, objective) is thetype of the parent node, and the coe.cients associated with the edges (aiv , ckv )are inherited from the parent edges.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Since each specialized code version is restricted to being executed in only a subset of the possible phases, the checks it has to perform in order to determine the current phase and what to do in this phase can be reduced.
Sentence 2: if a specialized code version is only executed in the idle phase, for which no barrier ac­tion is required, the barrier code can be entirely eliminated in this specialized code version.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Its key novelty stems from the decoupling of update operations: they are split into one transaction that modi.es the abstraction state and multiple ones that restructure its tree implementation in the background.
Sentence 2: the speculation-friendly tree is shown correct, reusable and it speeds up a transaction-based travel reser­vation applicationbyupto3.5×.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: The update function thus needs to have the optimality function opt in the root of the expression selecting the optimal solution is the last step of its computation.
Sentence 2: the syntactic form of the update function thus must be update(x,y,aval) := opt(f1(x,y,aval),...,fk(x,y,aval)); where functions fi compute the values of legal solutions.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: 4  3.2 Technological Adequacy For answering the second question, Q2, the measurement framework analyses the adequacy of the support provided by the software system to the business activities, artefacts and actors.
Sentence 2: the considered metrics are: Activity Adequacy (AA), Artefact Adequacy (AtfA), Actor Adequacy (ActorA).
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Step 3: Building trees The .nal step of the linking algorithm builds path instances from the individual links, then aggregates them into path patterns.
Sentence 2: if step (2) .nds the relationships shown in Figure 4(a), it would generate the two causal path instances shown in Figure 4(b), with the following probabilities: p1 = 0.8 · 0.9 · (1 -0.2) · (1 -0.1) · (1 -0.48) 0.270 p2 = 0.8 · 0.9 · (1 -0.2) · (1 -0.1) · 0.48 0.249 Each causal link included contributes a factor p corresponding to its probability.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Running this example in the Spec Explorer tool with the online algorithm showed a number of conformance discrepancies with re­spect to a TCP/IP-based implementation of this speci.cation writ­ten in C#.
Sentence 2: the implementation does not respect the lo­cal consistency criterion and creates new threads for each message that is posted, without taking into account whether prior messages from the same sender have been delivered to the given receiver.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: The main contribution of this paper relative to earlier work on Frenetic is the design of new algorithms for compiling these rich policies and for managing the controller-switch interactions that arise as compiled policies are executed in a network.
Sentence 2: these algorithms handle NetCore s new policy language, and the core elementsof Frenetic s old policylanguageeven better.the NetCore compiler generates ef.cient switch classi.ers by (1) using wildcard rules that process more packets on switches instead of simple exact-match rules, and (2) generating rules proactively (i.e., in advance of when they are needed), again to process more packets on switches, instead of strictly reactively (i.e., on demand).
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Specifically, since Ron was aware of the fact that there was a significant gap between his perception and that of the other team members with respect to the culture needed for the successful accomplishment of the software project, Ron adopted an approach that reduces the scope of change during the initial stages.
Sentence 2: instead of starting the cultural change in parallel to the introduction of a new SDM, on which he would have had to decide himself, he started by preparing the human infrastructure needed for that change.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: To extend the lower bound to the ID model, we give a series of local simulation results EC r PO r OI r ID, which state that a local algorithm for the maximal fractional matching problem in one model can be simulated fast in the model preceding it.
Sentence 2: even though the models EC, PO, OI, and ID are generally very di.erent, we show that the models are roughly equally powerful for computing a maximal fractional matching.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: T ec eventually consistent, so it is split into T ec and T c ex­ 3 3 0 0 y. T ec ecutes instantly and uses versions x and does not use 3 1 x even though it is available to T3, because the snapshot of 1 0 tx, yu would not be internally consistent (see Condition 2).
Sentence 2: t11 given a transition S0 ÝÑ S1, x belongs in S1 and 0 0 y and x are both in S0.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: This was found to be especially true for commits in the Adaptive , New Functionality and Perfective cat­egories, but not necessarily Re.ective .
Sentence 2: these library dependencies rather are updated to adapt to a new environment, add new build/code features and opti­mize the build, rather than in response to restructuring or refactoring of the source code.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: 2.3 Project Management Finally, we envision that the emerging design can be applied in a project management setting.
Sentence 2: we are interested in Class MyWorkspaceRepositoryOtherWorkspaces Store Store OnlineStore    name:String address:Address address:URL   placeOrder(order:Order):void addItem(item:Item):void getQuantity(item:String):int scan(item:ID):boolean scan(item:ID):boolean     Green Red Red Green Green Red Green Green Yellow Green Red Figure 4.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Minimal Interference: At the same time, data availabil­ity cannot be pursued over-aggressively.
Sentence 2: since intermediate data is used immediately, there is high net­work contention for foreground tra.c of the intermediate data transferred to the next stage, e.g., by Shu.e in MapRe­duce [13].
Relationship: entailment
Domain: Software and its engineering
Sentence 1: The fundamen­tal guarantee of the E V E N T WAV E model is that a logical node distributed over multiple physical nodes will main­tain atomic event semantics.
Sentence 2: a program­mer can reason about the behavior of her program with­out considering elasticity: if a program is correct when running on a set of logical nodes, its semantics will be preserved even as the program scales up or down by run­ning on various physical nodes.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: 6.1.3 Reliability Our Microdrivers implementation has only rudimentary code for detecting and recovering from faults in a u-driver.
Sentence 2: we therefore restricted ourselvesto injectingfaultsthatwouldnotrequireafull­.edgedfailure detectoror recovery module.we tested the ability of the system to tolerate failures that would normally causeakernel panicby injecting null pointer dereferencesin the user-mode portions of each driver.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: These are made possible by taking advantage of the versioning capabilities of the SCM system to provide versioning of both the fine-grained units, and the larger aggregates assembled from those fine-grained units.
Sentence 2: it enables a flexible mechanism for managing the his- tory of concern mapping within a system; for using data mining and machine learning mechanisms for concern identification; and even for providing stronger integration of compositional AOSD systems with other tools.
Relationship: entailment