sadat2307/MSciNLI huggingface dataset:
Domain: Software and its engineering
Sentence 1: However, in case of collective I/O, the .rst phase in which the bu.er sizes and o.sets are exchanged using an MPIAlltoAllv still occurs.
Sentence 2: the overhead of this exchange is small at small core counts; it leads to a 100 % reduction in collective I/O performance in comparison to POSIX I/O as we scale to 32K cores.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: This way, by writing di.erent process contexts CT IP P [ ], CIMC [ ], etc., one can perform functional and performance veri.cation on di.erent SPA processes using the state space generated by the mCRL2 tool-set.
Sentence 2: this approach is also bound for failure since in many process algebras, such as PEPA and TIPP, C[(a, r).0 (a, r).0] has a totally di.erent state space from C[(a, r).0 {a} ((a, r).0+(a, r).0)], i.e., C can distinguish between two {a} strongly bisimilar processes.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: The save in­struction in Set 1 is inserted into basic block D prior to the other instructions in the basic block.
Sentence 2: the restore instruction shown after basic block E is inserted as the last instruction in basic block E. the restore instruction on the control .ow edge between basic block D and basic block F cannot be inserted into basic block D, because that would corrupt the value of the register in basic block E, and the restore instruction cannot be inserted into basic block F be­cause there is an execution path that would reach that restore without any save instruction.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: Diminishing returns: In many applications, quality function exhibits diminishing returns: allocating more processing time to a request leads to a decreasing quality improvement.
Sentence 2: the quality improvement is signi.cant when we start to process a re­quest, while it gradually becomes diminishing during the processing, as can be explained by considering the example of VoD servers us­ing scalable video coding (a popular video encoding technique used in H.264/MPEG-4 AVC standard): sending higher-rate bitstreams in­creases the video quality but the quality increment gradually dimin­ishes [34].
Relationship: entailment
Domain: Software and its engineering
Sentence 1: This pa­per presented a GA-based approach to generate test data, intended as combinations of bindings and inputs, causing SLA violations.
Sentence 2: the paper proposes a black­box approach, where the .tness awards individuals violating constraints or close to constraint violations, and a white-box approach, combining the black-box .tness with the code cov­erage .tness proposed by Wegener et al.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Inspired by these facts, Conway de.nes the chip-chop matrix of a .xed regular language S. This matrix M(S)is indexed by the .nite set of chops of S, and the individual entries are given by M(S)X=XY xY One could think of M(S)as a systematic organisation of all the parts of S. In particular S itself occurs as at least one of the entries of M(S).
Sentence 2: we are now ready to generalise from the original problem (which was to determine whether all program paths are in S) to a problem that is easier to solve compositionally, namely whether all program paths are in each part of S. for a set of program paths P,we de.ne a Boolean matching matrix B(P), indexed by the chops of S: B(P)xXY =P CM(S)XxY Since M(S)contains all the parts of S, this matrix answers the ques­tion whether P CS.for any part S.of S, in particular, for S itself.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: On a roll now, our user defines a function to do the regional sum for any argument which has the same length as the regionvariable: sumReg.
Sentence 2: {+/¨(classify region)..} sumReg quantity 15 37 11 (sumReg quantity×price)÷sumReg quantity 25.83333333 22.21621622 29 the average price by region is the regional sales total divided by the regional number of units sold.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: An important trend in Internetware lifecycle model will be reusability, and this can be evidenced by the recent emphasis of publishing, search, discovery and mining in software development, and they are all related to software reuse.
Sentence 2: publishing makes reusable assets available, but specific items selected for reuse still need to be searched and discovered possibly by using data mining techniques.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Perhaps the simplest one to perform is based on RMSSD = _ 1 NN-1  2 (2) RRj+1 - RRj the time-domain measures.
Sentence 2: the most evident measure is the mean value of RRi N - 1 j=1 RRor, correspondingly,  the mean HRHR.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Yet, such an attempt is detected by the recipi­ent of the query-hit (the generator of the query, ps ), since multiple neighbors of pr , depending on the topology, will re­port pr s reputation and all of them should report the same value.
Sentence 2: a neighbor reporting bogus reputa­tion might be revealed, since it may not be the only one answering, due to the unstructured topology.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: The internal messages of the relation are only TO-delivered by the RE-CEIVER task when certain conditions hold.
Sentence 2: the next re­lation of messages to be TO-delivered must contain messages for Executed by every process pi 1: init 2: broadcasts .Ø {Output message buffer} 3: tbdelivered .Ø {To be delivered} 4: seq .
Relationship: entailment
Domain: Software and its engineering
Sentence 1: The translation we start of with is to replace each ?assertMatch(Result,F un(A1 , ..., An)) in a test by the func­tion name F un to obtain a sequence of function calls.
Sentence 2: the startstop test() above is translated into the sequence: + start stop start stop where the leading + indicates that this is a positive trace, that is a trace that is to be accepted by the inferred FSM.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Here S s are Cito states, and stateful predicate statepSqestablishes when the Bedrock IL state suitably implements S. Relation pS, sq Ó asserts that executing s in S will not crash, and pS, sq ó S1 asserts that one possible result of run­ning s in S is S1.
Sentence 2: the macro s proof rule says that, if the current Bedrock IL state implements a Cito state that leads to safe execution of s, then a postcondition for running c is that the Bedrock IL state implements some Cito state that could result from running s. This is a backwards preservation property in the sense we adopt throughout this paper, which is a big-step simpli.cation of the backwards simulation relations of CompCert.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Alternatively, Peer-To-Peer (P2P) networks offer significant advantages over their hierarchal counterparts, especially by the way of resistance to failure and congestion.
Sentence 2: structured P2P systems based on Distributed Hash Tables (DHTs) such as Pastry and Tapestry [1][3] have become popular communication substrates for data-sharing applications such as PAST and OceanStore [9][12].
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Since the runtime assertion checker cannot win but only gives up when it encounters angelic un­de.nedness, it is a better strategy to continue looking for potential demonic unde.nedness.
Sentence 2: demonic unde­.nedness is given precedence over angelic unde.nedness, so that the runtime assertion checker can signal more assertion violations and thus help detect more bugs.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: As performance degradation is increased in an attempt to save more energy, the en- ergy savings come at the expense of more and more perfor- mance degradation.
Sentence 2: for small performance 18% 18% 14% ~12% ~ 10% 8% ~ 5% Q , 4% 2% 0% 0.00% 0.25% 0.50% 0.75% 1,00% 1.25% 1,50% 1.75% 2.00% Decay Percent [ ..............
Relationship: entailment
Domain: Software and its engineering
Sentence 1: De­spite the lack of any type-safe alternatives, and even admitting they found it to be a clever exploitation of features, they rejected it be­cause they felt like it violated unwritten, and up to that point un­recognized, design principles.
Sentence 2: to them Equatable is only meant to describe types via constraints; it is not something to be passed around in lists.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Several studies conducted in 2006 seem to con.rm that this notion of continuous evolution is taking hold [1, 2, 10].
Sentence 2: the highly regarded Carnegie Mellon Soft­ware Engineering Institute (SEI) study on ULS systems sug­gests that traditional top-down engineering approaches are insu.cient to tackle the complexity and evolution problems inherent in decentralized, continually evolving software [10].
Relationship: entailment
Domain: Software and its engineering
Sentence 1: However we still strongly recommend de.ning all possible constraints in terms of suitable type classes as these constraints scale better with larger systems and are, by na­ture, easier to specify.
Sentence 2: the only time we see the need for constraints on instances of the entity concept nodes is when a particular policy explicitly calls for con­straints on entities, such as with object-based separation of duty constraints [15, 14], and models with these constraints do not scale well.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: We call the length of this path g~(/~).
Sentence 2: for all paths, P from c~ to ~8, g,~(j3) = min atoBfa(P) over all P from There is a shortest path tree, T, spanning the graph repre- senting the ad hoc network, rooted at the reference node, c~.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: The speedup results in Figure 7 show that across the range of core numbers, the fuel-based strategies are consistently more ef­.cient than parTreeDepth or parTreeSizeAnn, for depth-based and size-based thresholding, respectively.
Sentence 2: a pure fuel version, using just simplistic but cheap fuel splitting, performs best on 48 cores, exhibiting a speedup of 15, and the marked variant of the fuel strategy performs best for core numbers up to 36.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: In this case it is useful to analyze singleton sets of interest since suggestion sets for more than one element will be bounded by a multiple of this value corresponding to the number of elements in the set.
Sentence 2: the size of a suggestion set for a set of interest of two elements will be at most the sum of the size of the suggestion sets corresponding to the sets of interest for each individual element.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Onepossible way oflearning thisdistributionis to use memory­based methods such as K-nearest neighbours.
Sentence 2: we can setthepredictivedistribution q(y|x) tobeaconvex combina­tion of the K distributions corresponding to the trainingprograms and microarchitectures that are closest in the feature space to the new(test) program and microarchitecture.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: We believe that the answer is simple: the rules for optimizing ac­cesses to volatile variables are quite unlike the rules for optimizing accesses to non-volatile variables, but are similar to the rules for optimizing external function calls.
Sentence 2: calls to external functions, like accesses to volatile variables, must not be dupli­cated, eliminated, or moved around very much.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: The OWL standard, which may be used to define an ontology of types of "Thing", also has provision for knowledge base representation of what are called "Individuals", these being the equivalent of instance data in a database, but with explicit reference to ontology.
Sentence 2: an ontology, whether or not it contains individuals, corresponds to an explicit theory of meaning whereas a linked data resource corre­sponds to data about things.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: That credo has only recently been reiterated in public emphases on computational thinking as a way of understanding complex, constructional processes.
Sentence 2: programming languages Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for pro.t or commercial advantage and that copies bear this notice and the full citation on the .rst page.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: The discussions within the participatory design team that was set up and the user studies performed at archaeological parks during such design experiences gave also the possibility to envision, with different stakeholders, new applications that could have a practical value for them.
Sentence 2: the requirements of the system presented in this paper were collected through contextual inquiries performed by observing how several professional guides were leading groups of tourists and school students of different age in the archaeological parks of the Apulia region, in Southern Italy [3, 14].
Relationship: entailment
Domain: Software and its engineering
Sentence 1: The re­sult of the cpp program can be one of a multitude of C programs.
Sentence 2: someone wanting to parse a system for program understanding pur­poses has two options: either choose one particular con.guration and parse the preprocessed code for that con.guration, or make the parser more robust so that it understands the unpreprocessed code, which does not have to be valid C. the cpp introduces the following constructs: #define Macro de.nition and expansion.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: For each unit, the inputs controlled by DART were the argu­ments of the unique toplevel function of that unit, and DART was limited to running a maximum of 1,000 executions (tests) for testing each unit.
Sentence 2: if DART did not .nd any error within 1,000 runs while testing a unit, testing would then move on to the next unit, and so on.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: (l : Nat) (b : CoinBag ' c m l) .
Sentence 2: s[l' : Nat] CoinBag ' d n l' × (l' l) given a problem (i.e., a value to be represented by coins), if c : Coin is a choice of decomposition (i.e., the .rst coin used) no better than d : Coin (recall that we prefer larger denominations), and b : CoinBag ' c m l is a solution of size l to the remaining subproblem m resulting from choosing c, then there is a solution to the remaining subproblem n resulting from choosing d whose size l' is no greater than l. We de.ne two views [16] or customised pattern matching to aid the analysis.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: The .rst way one might attempt to add this functionality in a Java program is as follows: public class Rectangle extends Shape { /* ... */ public boolean intersect(Rectangle r) { /* efficient code for two Rectangles */ } } Unfortunately, this does not provide the desired semantics.
Sentence 2: the new intersection method cannot be safely considered to override the original intersection method, because it violates the standard contravariant typechecking rule for functions [Cardelli 88]: the argument type cannot safely be changed to a subtype in the overriding method.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Furthermore, while these workarounds do mimic NST criteria s abstraction of multiple tests, the limitation that each individual test stops at the .rst failure remains: there is no analogue to NST s :each criterion which will ensure that every element of the list passes some subcriterion.
Sentence 2: these techniques apply well to multiple tests along the static structure of complex objects under test, but they account less well for dynamic variations of inputs.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: In fact, once these tuples have been propagated, if a node moves, only its tuple local value is affected, while all the others are left unchanged, since their position with respect to the source does not change.
Sentence 2: a tuple on a node that moves can infer its new value by looking at the tuples stored in neighboring nodes and by considering their coordinates (see Figure 3(b)).
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Once the division points are identified in the parents, two new children are created by inheriting fragments from parents with a 50% probability.
Sentence 2: for each pair of fragments f1 and f2 of the same task belonging respectively to parents 1 and 2, child 1 inherits f1 with a 50% probability, and if it does inherit f1, child 2 inherits f2, and conversely.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: However it is powerful enough to turn a user­de.ned datatype such as complex into one that delivers the same ef.ciency as a built-in type.
Sentence 2: the usual arithmetic operations may be de.ned as follows: constexpr complex operator+(complex x, complex y) { return complex(x.real()+y.real(), x.imag()+y.imag()); } constexpr complex operator*(complex x, complex y) { return complex(x.real()*y.real() -x.imag()*y.imag(), x.real()*y.imag() + x.imag()*y.imag()); } This allows us to handle the types that are most frequently con­sidered for placement in ROM and for which the highest number of objects are needed.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: In addition, instead of making a binary decision of whether an item is an iceberg or not, we want to provide accurate estimates of the total counts for all the potential icebergs.
Sentence 2: we want to .nd item x along with its estimated total count c, such that c = (1 - E)T , where E is a small constant (say 0.1).
Relationship: entailment
Domain: Software and its engineering
Sentence 1: More­over, the system may also feature agents that are used to govern actuators through the coordination policies enacted by coordination artifacts, in order to implement those con­trol policies that are better delegated to the deliberation of an agent rather than to an automated coordination policy encapsulated within a coordination artifact.
Sentence 2: agents manage actuators through suitable artifacts (here­after called > artifacts) which make actuators uniformly available to the agent s use.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: From our exper­iments, we observe that VDGAA runs up to 583 times faster and improves the quality of the output by up to 18.5 times over ICF-GAA.
Sentence 2: vDGAA overestimates signi.cantly fewer active variables, thereby reducing the memory requirement and the run time of the derivative code.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: is required to produce an alarm or con.rma­tion dependent on whether or not a customer request was answered within 10 minutes.
Sentence 2: the correct detection depends on the successful detection of a customer request, say er as well as detecting successful answers, say ea.not detecting a successful answer could trigger both a false positive and a false negative, namely an alarm instead of a con.rmation.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: In the former, every­thing we can rely on is the syntax tree itself, while in the latter, we can utilise the semantic relations uncovered by various semantic analysers.
Sentence 2: during semantic graph transformations, we have that complete scope analysis, we are aware of side-effect proper­ties, data-.ow relations and unobvious dependencies, which allows us to .nd syntax tree nodes by one-step paths that would otherwise take a grand tour to look up.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: We reformulate the iterative computa­tions of [19] according to a DFS traversal of the computa­tion tree and obtain, as a result, a cache-oblivious variant which exhibits asymptotically improved spatial and tempo­ral locality over the original one.
Sentence 2: we show that the DFS variant ensures spatial locality, and describe quantitatively the asymptotic improvements in spatial and temporal locality.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Therefore if there is instruction parallelism in an iteration and there is register pressure in the iteration, exploiting some of them can also degrade the pres­sure of the requirement of the register and reduce the data that are spilled out.
Sentence 2: when guaranteeing the utilization of the computation resource, we also try to satisfy the register requirement of the reuse data vectors because it can reduce the competition of shared data bus.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: The proposed approach can minimize power variations in a software pipelined schedule without sacri.c­ing its performance or increasing the energy consumption.
Sentence 2: this paper addresses the following problem: Problem P Given a loop L and machine architecture M, generate a rate-optimal software pipelined schedule that minimizes |Pt - Pavg|,where Pt denotes the t power consumed at clock cycle t of the schedule and Pavg denotes the average power consumed during the execution of loop L. This paper presents an integer linear programming (ILP) formulation for the above problem.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Explicit identification of these relationships between B-SCP requirements and Map facets allows us to verify each Map facet against B-SCP requirements and their domains of interest.
Sentence 2: we are now able to determine how many (and which) B-SCP goals can be achieved when the process of a Map facet is executed, as well as how many (and which) domains of interest are involved in this Map process.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: First, they can perform carrier sensing in order to determine whether or not the channel is currently in use (this is also referred to as collision detection in the literature).
Sentence 2: if there is some activity on the channel be it a single message be­ing sent, a collision of multiple messages, or a malicious de­vice jamming the airwaves the protocol can distinguish this case from the case of no activity.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: First, if a sound tool ever reports a .ow of 0 bits, then it must be the case that the public output for that execution is the only one that can possiblybeproduced with any other secretinputs(forthatpublic input).
Sentence 2: the case of 0 bits corresponds to the non­interference criterion for no information .ow.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: A self-enactor is a self-interpreter enact that mimics evalua­tion: Self-Enactor: t .
Sentence 2: * v implies enact( ' t) ' v. (2) if t evaluates to a value v then enact( ' t) is behaviourally equivalent to ' v. Note that this account requires knowledge of the values v and the evaluation process .
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Also let w(X, 0) and w(Y, 0) be the initial index locations of the two pointers.
Sentence 2: a valid s-step warppath must satisfy thefollowing conditions: The two pointers initially point to the beginning of respective requests.w(X, 0) =1and w(Y, 0) =1.
Relationship: entailment