sadat2307/MSciNLI huggingface dataset:
Domain: Software and its engineering
Sentence 1: Note that the canonical expressions of syntax trees look just the same as they did in the case of mutual data types and the universal tree type.
Sentence 2: their types now have the form Tree c for some c. If we want, we can give the dummy types different names, for example Stm , Exp ,Var ,and Typ , and use type synonyms to make the types also look like they did when we had multiple data types: type Stm = Tree Stm_; type Exp = Tree Exp_ type Var = Tree Var_; type Typ = Tree Typ_ 4.2 Compositional operations The power of inductive families is shown in the de.nition of the function compos.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: For instance, the following program is ill-typed, let f = readFile "DATA" in (fPutChar O f, fPutChar K f), because the .le f is used twice in the body of the local de.nition.
Sentence 2: the program let f = readFile "DATA" in fPutChar K (fPutChar O f) is type-correct: the .le f is used only once.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: These new classes use transactional boxes from the JVSTM, so that the domain objects can be transactionally manipulated in Java, independently of the database.
Sentence 2: the dura­bility of the JVSTM transactions continued to be provided by the Ob ject/Relational mapping provided by OJB, which allowed us to keep the same relational database structure as before.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: The only problem is that the rational numbers .i(K) are returned as .oat numbers, and not as the quotient of two integers.
Sentence 2: as each .xi is an integer vector, we use a post-processing step to compute .i(K) as a fraction: it is the smallest rational number such that A.xi =..c. We thus consider each equation of this system to build .i(K) as the quotient of two integers.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: Semantically, as typi.ed in [4, 9, 10, 12, 13], MSC system spec­i.cations are interpreted as deterministic and complete: mathemat­ically, a set of MSCs completely characterizes all the behavior of correct implementations by requiring that they exhibit exactly the execution sequences the MSCs exhibit.
Sentence 2: scenario-based * Research supported by ARO grants DAAD190110003 and DAAD190110019 and NSF grant CCR-0098037.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: [a × b ] zipmap f (x : xs, y : ys)=(fx, y): zipmap f (xs, ys) zipmap f ( , ) =[] o In [14], the focus was on how to apply fusion on all argu­ments of a function simultaneously.
Sentence 2: our solu­tion is selective in the argument we want to fuse, and this is crucial to enable fusion of functions with accumulating parameters as we will see shortly.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: Method Differentiator Using Slice-based Cohesion Metrics Akira Goto1, Norihiro Yoshida2, Masakazu Ioka1, Eunjong Choi1, Katsuro Inoue1 1Graduate School of Information Science and Technology, Osaka University, Japan {a-gotoh, m-ioka, ejchoi, inoue}@ist.osaka-u.ac.jp 2Graduate School of Information Science, Nara Institute of Science and Technology, Japan yoshida@is.naist.jp ABSTRACT It is important to understand semantic di.erences between a pair of Java methods during maintenance.
Sentence 2: tex­tual or syntactic di.erence is insu.cient to give clear idea which code fragment realizes a single functionality in Java methods.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: An insensitive algo­rithm maintains a single abstraction of each .eld, and is unable to distinguish between the values of corresponding .elds in di.er­ent instances of the same class.
Sentence 2: a data context-sensitive scheme models .elds of class C separately for each distinctly-labeled allocation-site of class C. Data context-sensitivity is sometimes called .eld cloning or the creation type scheme [48].
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: First observe that the two refinements of X to G and to F are both conservative over X.
Sentence 2: also, G and F are independent and the weaving from X to F does not modify variables of G. their composition, dX /dF * dX /dG is not conservative wrt X, as the last adaptor checks if both features X and G are present and only then modifies variable a.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: One of the .rst publica­tions in this space was the work by Harish and Narayanan [10] who presented the .rst algorithm to perform an ef.cient breadth­.rst-search on the GPU.
Sentence 2: this approach was based on vis­iting every node at every iteration, and was less ef.cient than the most ef.cient CPU implementation at that time.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: If we were willing to accept sub­stantial overhead, a natural approach would be to serialize the processing of incoming messages at the leaves using a parallel-pre.x computation [15], taking advantage that the e.ects of processing the various incoming messages on the states can be summarized as simple state updates plus pos­sible assignment to the variables waiting and obj,and such operations are composable.
Sentence 2: this approach could in the worst case require a parallel-pre.x operation on the entire tree to collect and process a single incoming mes­sage, giving an O(n)worst-case blow-up in message tra.c.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: E :: []IEa IvE I(E : *)IletxE ina Naively, a sequence of non-syntax-directed typing Rules GEN and The reduction relation -is parameterized by a set of d-rules of INST should be placed around any other rule.
Sentence 2: many of the form (d)below: these occurrences can be proved unnecessary by following an ap­propriate strategy.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: 4.2.4 Execution of Tests When using Amsterdam to test an application as it runs in the .eld, it is assumed that the application vendor would ship the application including the con.gured testing frame­work as part of the software distribution.
Sentence 2: the cus­tomer organization using the software would not need to do anything special at all, and ideally would not even notice that the tests were running.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: Also, for the test of the temporal properties of a system, such as the worst-case or best-case execution time, generic approaches exist which can be easily applied to the testing of the embedded system under consideration.
Sentence 2: for the test of functional properties of the embedded system, such as certain safety requirements, the fitness function must be manually designed to account for the functional property at hand.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: A potential weakness of using CPN in the emulation en­vironment is that models de.ned using CPN may not be as e.ciently executable as endpoints directly encoded in pro­gramming language.
Sentence 2: the results of a case study in emulating LDAP endpoint systems presented in Section 5 demonstrate that the run-time performance of the CPN­based approach is su.cient for simultaneously emulating the behaviour of up to 10,000 LDAP endpoint systems.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: Techniques for converting Array-of-Structures to Structure-of-Arrays do not apply here, as multiple .elds in the structure are also accessed together in other parts of the application, where fetching the whole structure is desir­able.
Sentence 2: the scatter-gather fetch feature of modern DMA engines can be used to select only the desired ele­ments scattered at .xed strides in main memory, and place contiguously in SPM.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: Thus, PE3, PE4, PE5 and PE6 in the training sub-DAG are identi.ed to be the splitting points and executed in parallel.
Sentence 2: the above split causes every remote machines to send the ex­tracted features produced by PE6 across the network to the .nal machine that executes PE8 and PE9, which is the largest data stream in the entire work.ow.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: SMARTEDIT [19] also used version-space algebra for PBD, but when confronted withaversion-space collapse,SMARTE-DIT just reportedfailure to the user, who could then provide a new trace.
Sentence 2: cHINLE exploits thefact that the algebraic description (illustrated as the treein Figure4)fac­tors the version space wherever there is a VS join operator (.).
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: Conceptually, MDD is mainly a top-down approach, as it promotes incrementally trans­forming models of a system to code, while CBSE focuses on run-time composition of components executable code, making it a bottom-up approach.
Sentence 2: looking only at design-time, which is in the focus of our research, CBSE and MDD overlap, and the border between the two is fuzzy.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: This showed that in dimensionality reduction issues, number of features is not the only factor that influences the classification result, but the other factors such as population, inertia and iteration also play important roles and need to be considered.
Sentence 2: in terms of recall, even though the proposed method achieved 91.36%, lower than FAMGA and NFSS which is 97.88% and 97.15%, but our method is still able to give a competitive result.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: [11] highlight the effort-benefit disparity in this parallel use of email with CVS (the people reading the message derive more benefit than the person who has to put in the effort to send the message) but the developers did not mind this as they knew they would also benefit at some other time from someone else s effort.
Sentence 2: even though the developers stated that the combination worked for them, some studies [4, 23] observed situations where it did not, for example rushing to commit changes first to avoid having to deal with merges.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: In order to capturethe concrete syntax, we adopt a by-demonstration tech­nique, which is similar to earlier work on Program ByExample (PbE) or Query By Example (QBE) [4][8].
Sentence 2: maintaining an optimized sequence of actions(i.e., pruning unnecessary actions) while preserving thedemonstrator s intent is challenging.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: Moreover, for iter­ative consensus algorithms in a time-invariant network, existence of a directed spanning tree is a necessary and suf.cient condition for achieving agreement among the nodes [12].
Sentence 2: the full utility of edge reachability and network robustness is realized only when considering fault-tolerant and resilient dissemination of in­formation in a network through purely local strategies.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: However, it provides no abstraction on the event-driven side: the scheduler uses a low-level, unsafe program­ming interface that is completely hidden from the programmer.
Sentence 2: many event-driven systems uses continuation­passing style (CPS) programming to represent the control .ow for each client; the problem is that CPS programs are often dif.cult to write and understand.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: old, the compiler cannot .nd much opportunity to apply our opti­ mization, and most of the time, each core ends up withperforming percentage improvement due to prefetching 20 16 12 8 10 its own data prefetching.
Sentence 2: when the threshold is 5 low(50%), our approach startsbehaving similartotheindependent prefetching case.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: Since an attacker can get more pro.ts by cheating at one speci.c state, an attacker s optimal strategy under PeerTrust is to cheat continuously for a while from a initial state.
Sentence 2: the attacker will not have a high trust value if a lot of continuous cheat­  (a) A trust value-based approach (OVER TRUST) (b) A rank-based approach (OVER RANK) Figure 8: The number of required transactions to reach a goal with two strategies ing actions are performed.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: In this table, for all the three datasets here, +yes suggests that the tree-based GP simply adapted to multiclass problems is outperformed signi.cantly by the ba­sic LGP, see table 2.
Sentence 2: these results are slightly misleading as adjust­ingTGPby usingProbabilisticMulticlass methods(one of the best TGP methods for multiclass classi.cation) shows that(advanced) TGPperformssimilarlytobasic LGP,see table 3.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: Progressive Meshes: Involve the initial transmis­sion of a low polygon 3D model, followed by the pro­gressive streaming of instructions on how to create more complex representations of this model [9] [31]  [22] [12].
Sentence 2: progressive meshes can be time­consuming to generate, and the model being processed must entirely .t into main memory during rendering, thereby limiting complexity of 3D models when imple­mented in mobile devices.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: Several methodsexistto .nd security relevant bugs.
Sentence 2: analysing thousands of lines of code is not only time-consuming, but the number 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: contrasting
Domain: Software and its engineering
Sentence 1: Such a distribution is also bene.cial to the application because, the application has minimal risk of its requirement not being ful.lled in the event of a single server failure.
Sentence 2: if there is a re­quirement to enforce one applications cache allocation to a particular server, we could just allocate the cache size deter­mined by the .rst step of our algorithm on that server and our algorithm ensures that thespeci.edI/O latencyrequire­ment is guaranteed and the overall I/O latency is minimized with that allocation.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: Awais Rashid Lancaster University Lancaster -Lancashire, UK  marash@comp.lancs.ac.uk by means of dynamic software product lines (DSPL, i.e., product lines that are expected to re-con.gure at run-time [3]), has also emerged.
Sentence 2: due to the large number of con.gurations that need to be supported, several of which might even be unforeseen, e.ective and e.cient testing of such systems presents a hard challenge.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: For example, the Adobe Flash plat­form is widely used to develop and design multimedia appli­cations, as it provides lots of features to help the graphical design.
Sentence 2: it is very di.cult to provide reusability for these created graphics, which means usually the graphic designer only consider the current project and process when designing these graphics, and there is no way to reuse most graphics and design process for future similar projects.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: Contrary to insights from previous work, we discover that on modern NUMA systems remote wire delays, that is, delays re­sulting from traversing a greater physical distance to reach a remote node, are not the most important source of performance overhead.
Sentence 2: congestion on interconnect links and in memory controllers, which results from high volume of data .owing across the system, can dramatically hurt performance.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: The Proxy, Adapter and Decorator patterns are examples of how important the intent of a pattern is; all of them are super.cially similar to one another, and often have a single collaborating instance to which they forward one (or more) messages.
Sentence 2: the intent of the Proxy pattern is to forward the requests through some protocol (such as over a network); the Adapter and Decorator intercept methods between the caller and the delegation class and work to­gether [16, page 139].
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: In Step 3, the write pattern generates several updates to thelogical block b.
Sentence 2: previously in Steps 1 and 2, this logicalblock had a low update recency, and wear leveling already re­mapped it to the elder physical block F. As previously mentioned in Section 3.2, these new updates to the logical block b will cause further wear of the elder physical block F, making the prior re­mapping operation of the logical block b ineffective in terms ofwear leveling.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: For example, version 5 of the system comprised 14 files identified as both coupling-increasing and buggy in the future.
Sentence 2: table 5: Feature coupling increase as a Predictor of Bugs Version CI Buggy CI Not Buggy Not CI Buggy Not CI Not Buggy 1 2 0 302 837 2 7 0 299 835 3 4 0 292 845 4 1 0 295 845 5 14 8 274 845 6 0 0 257 884 7 2 3 240 896 8 11 6 227 897 9 5 3 227 906 10 0 0 235 906 11 0 0 234 907 12 0 0 234 907 Because of low values in the first two columns, we could only perform a chi-square test of independence for versions 5 and 8.6 for both versions 5 and 8 the chi-square test indicates a statistically significant relation between the "coupling increasing" and "buggy in the future" variables (p = 0.001).
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: X10 11, June4,2011,SanJose,California,USA.
Sentence 2: copyright c &#38;#169; 2011ACM 978-1-4503-0770-3/01/06...$10.00 erased by the Java compiler after the type check (type erasure) [1].in X10, generic typing is a core part of its type system.Classes that have different type parameters are treated as differentclasses(typerei.cation).Inaddition,X10cantreatnotonlyobjectsbutalsostructsandfunctionsas .rst-classdata.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: It has also been known for a long time that an in.nite grammar can represent any language, decidable or not (Solomon 1977), and that the languages generated by many in.nite grammars can be decided (Mazurkiewicz 1969).
Sentence 2: the result that monadic and applicative combinators have the same expressive strength for .nite token sets seems to be largely un­known.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: 4.2 Fast-tick Core Separating and Event Han­dling As mentioned above, the time consumption at Phase3 de­pends on domainU s scheduling delay, and Boost/Tickle mech­anism of Xen Credit scheduler is a good solution to this problem when domainU loads only I/O-intensive applica­tions.
Sentence 2: xen Credit scheduler does not distinguish the types of tasks running on VCPU.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: However, if the preal­location latency is too long (e.g., due to a too-large bucket size), an incoming synchronous request will be delayed increasing the con­tention at MMT and this delay directly adds to the critical path of program execution.
Sentence 2: a too-small preallocation bucket size does not suf.ciently reduce communication and syn­chronization frequencies though it might keep the contention level at MMT low.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: Componentized language frameworks, coupled with variability modeling, have the po­tential to bring language development to the masses, by simplifying the con.guration of a new language from an existing set of reusable components.
Sentence 2: designing variability models for this purpose requires not only a good understanding of these frameworks and the way components interact, but also an adequate familiarity with the problem domain.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: http://dx.doi.org/10.1145/2643135.2643143 Over time, two distinct approaches to provenance have emerged: (1) the use of annotations propagated through database queries to illustrate where-provenance linking results to source data [7], lin­eage or why-provenance linking result records to sets of witness­ing input records [16], or how-provenance describing how results were produced via algebraic expressions [21], and (2) the use of graphical provenance traces to illustrate how work.ow computa­tions construct .nal results from inputs and con.guration parame­ters [5, 22, 30].
Sentence 2: to date few systems formally specify the semantics of provenance or give formal guarantees characterizing how provenance explains results.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: In the case of a high-aggregation workload, we found that DMR signi.cantly outperformed both LMR and GMR architectures since it avoids data transfer overheads of the input data.
Sentence 2: in the case of zero-aggregation or ballooning-data sce­narios, LMR outperforms DMR and GMR since it moves the input data to a centralized cluster, incurring an unavoidable data transfer cost at the beginning instead of at later stages, which allows the compute resources to operate more ef.ciently over local data.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: A fact base is a managed collection of facts, similar to a traditional database.
Sentence 2: listing 1: "Put" event via Speech 1 (Speech (word "put") (con.dence 0.81) 2 (user "Lode") (on 1305735400985)) instead of activating queries on demand, we use con­tinuous rules to express conditions to which the interaction has to adhere.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: Readers might wonder if it follows directly from classical serializability theory, e.g., [5, 28].
Sentence 2: the clas­sical result is about a single execution and states that if, in an inter­leaved execution of transactions (procedure invocations, in our ter­minology), every transaction follows, e.g., TL, then this particular execution is serializable.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: For example, AUML s multiplicity connector (denoted by a message followed by an asterisk) means that the message can be sent an arbitrary number of times and can be accommodated by an extension of our translation fairly easily.
Sentence 2: preconditions require additional information that is not easily ex­tracted from the messages: the debugging agent cannot know when an arbitrary condition becomes true since it doesn t have access to the internal beliefs of other agents.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: Current term-based trace re­trieval algorithms are incapable of understanding these con­cepts and would therefore be unlikely to precisely create the corresponding link [10].
Sentence 2: most human domain experts performing the tracing task manually would be able to look beyond the mismatch of terms, reason about the concepts in the domain, and correctly establish a trace link between a source and target artifact.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: The semantics of Lazy-LL/SC is weaker than that of similar objects used by us previ- ously to design lock-free and wait-free constructions, and as a result can be implemented more efficiently.
Sentence 2: we show that Lazy-LL/SC is strong enough to be used in existing non-blocking universal construc- tions and to build new ones.
Relationship: contrasting