sadat2307/MSciNLI huggingface dataset:
Domain: Software and its engineering
Sentence 1: The crucial issue for constructing the dimension hierarchy H is how to capture logical relationships between two neighbouring Ds in H. In this step we generalize the notion of referential integrity in an XML environment for this purpose.
Sentence 2: we should not expect most XML documents to have an element (or attribute in more general case) that simulates a primary key as the case is in relational databases.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: For example, consider the following fragment of reentrant code, and suppose it is executed concurrently by two threads T1 and T2: { FileInputStream X = new FileInputStream(); FileInputStream Y = new FileInputStream(); } There are several ways the instructions of T1 and T2 could be interleaved: T1: creates X T2: creates X T1: creates Y T2: creates Y - or T1: creates X T1: creates Y T2: creates X T2: creates Y ... etc.
Sentence 2: t1 will always create X before Y, as will T2.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: So the prev miss time for those sizes is set to T6 and the total energy consumption is incremented by the sum of idle energy consumed during the last idle period and the active energy, which is E(T6 - T5) + 10ms* ActivePower (calculated based on the underlying DPM).
Sentence 2: if the partition for this disk has size of 4 or 5 blocks, there would have been a hit and no change is needed.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: Predicate abstraction [10] techniques based on counter-example driven re.nement (like SLAM [1], BLAST [15], or [2]) are also able to discover such disjunctive invariants like the ones required for the example program.
Sentence 2: the success of these tools on a given problem is contingent on being able to .nd the right predi­cates.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: However, an update-conscious algorithm should put the new variable d in a s location, as shown in Figure 7(c), re­sulting in only one update primitive in the script.
Sentence 2: if there was no d in the new code and if we did not reclaim the word taken by a, we would waste the word in the data segment or more if the function is recursively invoked.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: Turning on such a gateway to serve load with Flash (254MB) storage incurs a cost of 14.5W/10Mbps, or 1450 Joules per Giga­bit, considerably higher than the corresponding metric for servers.
Sentence 2: if we consider a gateway that is already on, its baseline consumption of 13.5W is already spent anyway.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: Moving to USB 2.0 would boost the USB throughput to 480Mbps, which would make the MCU the bottleneck in streaming logs.
Sentence 2: we have found 1Mbps to be suf.cient in all of our experiments as long as buffers are added in the MCU and FPGA to absorb short bursts of data to be logged.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: DIAGNOSABILITY NOTIONS IN CON-CURRENT PROBABILISTIC SYSTEMS Theorem 1 gives the L-diagnosability two intuitive characteri­sations from the subjective views of the outside observers B and A.
Sentence 2: when working with concurrent probabilistic systems, the 0-1 nature of L-diagnosability may classify some reasonable systems as non-diagnosable.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: The worst case response time was 2.29 s when running without background load.
Sentence 2: when 64 kernel compilation processes were running, the worst case response time increased to 48.9 s. RSIO correctly identi.es the web browser as latency-sensitive when it is receiving web data from the In­ternet since the network channel to the web proxy is con.g­ured asaRSIOI/O channel.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: Consider the following example: def m()(implicit ctx: SourceContext) = ... def outer()(implicit outerCtx: SourceContext) = () => m() val fun = outer() fun() // invoke closure Here, the outer method returns a closure which invokes method m. Since m has an implicit SourceContext parameter, the compiler generates an object containing source information for the invoca­tion of m inside the closure.
Sentence 2: since the parameter has type SourceContext as opposed to its super type SourceLocation, the compiler will not only pass the SourceContext corresponding to the current invocation but also the outerCtx context as the par­ent of the current SourceContext.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: Improving Industrial Adoption of Software Engineering Research: A Comparison of Open and Closed Source Software Brian Robinson, Patrick Francis ABB Corporate Research Raleigh, NC, USA {brian.p.robinson, patrick.francis}@us.abb.com Abstract Advances in software engineering have led to the creation of many new software engineering techniques.
Sentence 2: industrial adoption of these techniques is often quite low, as development organizations are skeptical of their value and applicability.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: For example, an experimenter using reprozip has to use reprozip for all parts of the experiment, and not forget to use it for one part.
Sentence 2: if an experimenter can give us a virtual machine in which a kludgy set of experiments is held together with string with no principled methodology, if we can recompute it now we can recompute it in 20 years.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: As only interface variables are givenstay constraintsinthe constraintgraph,anin-edgefromastay constraint for a given variable in a solution graph indicates that a variable is a contributing, rather than input, variable.
Sentence 2: 3.3 Solver preconditions We note that .nding an acyclic solution to an arbitrary multi-way data.ow constraint system is an NP -complete problem; complex­ity characteristics of variations of constraint satisfaction problems are describedin(TrombettoniandNeveu1997).theprob­lem is polynomial time if the method restriction holds, which re­quires that every CSM of a constraint use all of the constraint s variables as either an input or output of the method.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: In each case, these tools take advantage of a fundamental advantage of computer science and more broadly, computa­tional science: the unique ability to share the raw outputs of their work as software and data.les.
Sentence 2: despite this advantage, and alongside ongoing and signi.cant changes to the traditional models of academic dissemination and pub­lication [13] [15], there remain cultural and technical barriers to both the sharing and reimplementation of algorithms [1].
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: S by asking the SAT solver to .nd a solution for the variables Z subject to the constraints ^ FT,I,Y (Z) .
Sentence 2: obs(Z)=o o.S If the SAT solver .nds a satisfying assignment, then the corre­sponding execution is a counterexample because its observation is not equal to any observation in S. if the SAT instance is unsatis.able, the inclusion check passes.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: Dynamic load management through adaptive region to server remapping is an obvious solution to the load management problem.
Sentence 2: any dynamic remapping algorithm must evaluate the po­tential trade-offs between the two con.icting goals of i) Balancing the server load in terms of numbers of players by splitting exist­ing game world partitions across more servers and ii) Decreasing inter-server communication by maintaining the locality of adjacent regions or aggregating adjacent regions into large partitions to be assigned to fewer servers.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: The simplest counter­example involves choosing the empty string as the data and a gram­mar (A, [A = E+Num]) as the target to extract in this example, there is no way to annotate the empty string to enable generation of the right side of the union.
Sentence 2: we can extract (A, [A = E]) an approximation of the grammar we might have wanted.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: Generally, we propose the following work .ow: the devel­oper runs our static analysis on a program; if there remain a small numberofpotentialpoints offailure,thenthedevel­opercanverify each of thesepoints manually andget acom­plete analysis result.
Sentence 2: if there remain many points, thenthedevelopercaninspectjustthetop or .ltered results and let runtime monitoring handle the remaining cases.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: Case 1 and 4 are special cases that can also be expressed by returning a list of functions in case 2, either with just one element, or with a list con­taining identity functions only.
Sentence 2: especially case 1  returning just one function is a very common case due to the fact that single dispatch is very common, and thus cases 1 and 4 are added for convienence.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: For example, on a system with 100 thread contexts each executing a >< -"":"/~ £ .........................  h~:~ pseudo JIT, allowing a single event per thousand would result in an effective system event load of 100 per thousand.
Sentence 2: we    '.-~ =============================================== found that the performance impact on the pseudo-JIT was minor .
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: DISCUSSION AND FUTURE WORK JavaScript naturally supports the view of traits-as-state discussed in Section 2.3, since both ob ject state and behaviour are stored in assignable slots.
Sentence 2: javaScript also supports the traits-as-behaviour view, thanks to the newly introduced properties abstraction:18 in this case, a slot access such as point.x is actually a method call without arguments, as in Self [24].
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: For in­stance, for the bug .xing example in Figure 1, we may sim­ply replace the shared read to referenceColumnMap at line 11 to a local read to referenceColumnMap local which stores the same value read by the access to referenceColumnMap at line 4.
Sentence 2: in practice, we have to address the fol­lowing touch challenges: Path-sensitivity The privatization must be path-sensitive.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: As a result, some form of deferred reference counting [20], in which references from stack frames are accounted for separately, is used in most high-performance implementations of reference counting [3, 19].
Sentence 2: this means that when an object s reference count drops to zero, it can not be reclaimed immediately, since there might be a reference from the stack that is not accounted for.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: Since prefetching does not o.er any bene.ts that are not present in prefetch-delayed, we do not present (a) Message cost (b) Tree rebuilding time Figure 6: Publisher speed of movement without routing computations (a) complex matching algorithm (b) standard protocol Figure 7: Publisher speed of movement with routing computations results for the prefetching protocol in this paper in order to simplify the exposition.
Sentence 2: the proxy, delayed and prefetch­delayed protocols all graft onto existing trees.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: With the notable exceptions of Us [SU96] and PyCon­text [Löwi07], as far as we know multiple dispatch has not usually been combined with implicit arguments.
Sentence 2: there is a tantalizing hint that the CLOS creators were going in that direction: it might be useful to use exogenous fea­tures for method selection.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: Remarks.Thetechniqueofusingawaitcounteranda grantcounterisusedinmutualexclusionprotocolssuchas TicketME[6,16].Mutualexclusionprotocolsaresimpler becauseonlyoneagentisgrantedaccessatatime.Thus thegrantcountercandoubleasthedonecounter.Also, thetestforgrantingaccessissimplywhetheryourticket equalsthegrantcounter,somodulopcountersareused forpusers.Withroomsynchronization,weneedanin­equalitytestbetweentheticketandthegrantcounterin ordertoadmitmultiplewaitingusersatonce,somodulop countingdoesnotsufce.Instead,andtoavoidunbounded counters,werelyonthefactthatwhenintegersarerep­resentedintwos-complement(andpislessthanthemaxi­muminteger),thenlettingthecounterswraparoundtoa negativenumber(ignoringtheoverfow)givesthedesired resultforanyinequalitytestintheprotocol.Thisisthe reasonforusingmyTicket-r->grant[i]>0insteadof myTicket>r->grant[i]intheenterRoomcode.
Sentence 2: notethatactiveRoommaybesetto;1evenwhenthere areuserswaitingwiththeirtickets.suchusers musthavegrabbedtheirticketsafterthelastagentdone checkedtoseeiftherewereticketedwaiters.Moreover,al­thoughallagentsgrantedaccesstoaroomarespinning waitingforthatroomtoopen,andhencewilltendtopro­ceedtogetherintotheroom,intheworstcasetheagents mayproceedtoentertheroomandexittheroomatvery diferentrates.Thusaroommayopenandclosemulti­pletimesbeforeallthegrantedagentsaredonewiththe room.Furthermore,anagentthatisslowtograbaticket maybebypassedbyfasteragentsanunboundednumberof times.ThisdoesnotcontradictpropertiesP9orP10,be­causewithintimetf+O(5)theslowagentwillgrabaticket, andfromtherewillproceedinconstanttime(afunctionof a,5,andm)toenterinsidetheroom.Ontheotherhand, ifallagentsrunatroughlythesamespeed,anagentcanbe bypassedforitsdesiredroomatmostonce.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: Indeed, the concept of channel in the human world is more (for example, each verbal communication, in a space where people are able to hear, features this characteristic).
Sentence 2: channels providing deferred interactions are those where the receiver is not inside the context when the mes­sage is ready to be delivered, but can be reached at a later time (mailboxes, written notes, posters, showcases are kinds of deferred channels).
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: Ef.cient Control Flow Quanti.cation Christoph Bockisch* Sebastian Kanthak* Michael Haupt*, Matthew Arnold Mira Mezini* *Software Technology Group Darmstadt University of Technology, Germany Software Architecture Research Group Hasso Plattner Institute for Software Systems Engineering, Potsdam, Germany IBM T. J. Watson Research Center Yorktown Heights, NY, USA {bockisch,mezini}@informatik.tu-darmstadt.de kanthak@st.informatik.tu-darmstadt.de michael.haupt@hpi.uni-potsdam.de, marnold@us.ibm.com Abstract Aspect-oriented programming (AOP) is increasingly gaining in popularity.
Sentence 2: the focus of aspect-oriented language re­search has been mostly on language design issues; ef.cient im­plementation techniques have been less popular.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: We .nd that for CG and IS, around 30% of the execution time is consumed by the isolated de­vice domain (Dom0 in our case) and the Xen VMM for pro­cessing the network I/O operations.
Sentence 2: for EP benchmark, 99% of the execution time is spent natively in the guest domain (DomU) due to a very low volume of communication.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: Figure 1: Danfoss Automation Drive and application scenario[5] In order to handle the increasing number of variants in their products, and at the same time decrease time-to-market and development cost, Danfoss introduced SPL principles suc­cessfully [12].
Sentence 2: with increasing expectations and im­provements in software product line engineering, the need for improvements in software product line usage at Dan­foss is given.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: 1)1, I resorted to writing down the state-based behavior textually, in a kind of structured dialect made up on the fly that talked about states and their structure and the transitions between them.
Sentence 2: this dialect was hierarchical: inside a state there could be other states, and if you were in this state, and that event occurred, you would leave the current state and anything inside it and enter that other state, and so on.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: In our view21 theyare more closelyrelated to Java synchro­ nized and try { ... } finally { ...} blocks or, in the case of locks, synchronized blocks, than theyare to Java finalize methods.
Sentence 2: .nalization in languages like Java is necessary in order to manage resources other than garbage-collected memorybased on garbage-collector-discovered reachability.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: Hence, when xs is empty the property amounts to proving that ys ++ zs is equal to itself, which is true by the re.exivity of the equality on lists.
Sentence 2: if xs is of the form Cons x xs , by de.nition of append we need to prove that Cons x (xs ++ (ys ++ zs)) is equal to (Cons x (xs ++ ys)) ++ zs, or equivalently, to Cons x ((xs ++ ys) ++ zs), again by de.nition of append.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: These methods are effective for single-threaded scenario.
Sentence 2: the default scheduler employed in Linux 2.6.23, Completely Fair Scheduler (CFS) [8], can guarantee fair CPU time among all This research was supported by the National Science Foundation of China under grants No.60873221 and Jiangsu production-teaching­research joint innovation project No.BY2009128.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: The pickle format, in turn, has factory methods for creating concrete PReader instances: val reader = pickleFormat.createReader(pickled) The obtained reader can then be passed to the unpickle method of a suitable Unpickler[T].Alternatively, a macro def on trait Pickle can be invoked directly for unpickling: trait Pickle { ... def unpickle[T] = macro ... } It is very common for an instance of SPickler[T] to also mix in Unpickler[T], thereby providing both pickling and unpickling capabilities.
Sentence 2: 3.1.1 Pickling and Subtyping So far, we have introduced the trait SPickler[T] to repre­sent picklers that can pickle objects of type T. in the presence of subtyping and open class hierarchies provid­ing correct implementations of SPickler[T] is quite challeng­ing.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: In this example, D has three different subobjects of static type A, obtained through the base classes B1, B2 and C. This is called non-virtual inheritance by Stroustrup [5], replicated inheritance by Rossie and Friedman [16], or repeated inheritance by Wasserrab et al [19].
Sentence 2: the programmer can elect to declare some base classes as virtual, as in the following example: AA struct A{ int a; }; struct B1 : virtual A {}; B1 B2 C struct B2 : virtual A {}; struct C:A {}; struct D : B1, B2, C {}; D In this case, B1 and B2 contribute only one subobject of static type A to class D: the paths B1::A and B2::A designate the same subobject.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: A Formal Framework to Generate XPDL Specifications from UML Activity diagrams Nicolas Guelfi and Amel Mammar Software Engineering Competence Center Faculty of Sciences, Technology and Communication University of Luxembourg, L-1359 Luxembourg-Kirchberg, Luxembourg {nicolas.guelfi,amel.mammar}@uni.lu   ABSTRACT The XML Process Definition Language (XPDL) is a standardized language allowing process definitions interchange between a variety of tools ranging from workflow management systems to modeling and simulation tools.
Sentence 2: uML activity diagrams offer a convenient notation to depict synthetic and intuitive views of systems that facilitate stakeholder communication.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: The .rststep of ourmethod transformsagraphqueryintoaset of rules and aqueryinDatalog.Datalogis animportant rule-based languageforinference usingfactsindatabases.Much researchhas beendone onimplementation ofDatalog[1].Top-down computa­tion startsfrom thequery,generates subqueries using thehypothe­ses of the rules whose conclusions match the query, and does so repeatedly until the subqueries match the given facts.
Sentence 2: bottom-up computation matches existing facts with hypotheses of rules, gen­erates newfactsfrom conclusions of rules whosehypotheses match existingfacts, anddoes so repeatedly untildesiredfacts or allfacts areinferred.Inparticular, thereis a methodforgenerating optimal algorithm and data structures specialized for the rules for bottom­up computation, and calculating complexitiesforthegeneratedpro­grams[20].this method may inferfactsthat are not rel­evant to answering agivenquery, and hence may be unnecessarily expensive.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: To improve shared cache performance, researchers from the computer architecture community propose smart replacement policies to improve upon LRU [12, 34, 10, 30, 29, 25].
Sentence 2: other researchers have proposed intelligent co­scheduling policies [37, 38, 32, 31, 21] that an operating system or hypervisor can use to minimize shared cache contention.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: Inspiration can be drawn from the success of Rhodium [16], a domain speci.c language for declaratively specifying data.ow analyses that are veri.ed by an automatic theorem prover without any need for human intervention.
Sentence 2: analyses implemented in Rhodium work on a simpli.ed intermediate representation of programs, and it seems likely that in order to verify source-level analyses interactive theorem proving is a more appropriate choice.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: For example, let rec quad x = let rec dbl y = y + y in dbl (dbl x) in quad 123 can be .attened like let rec dbl y = y + y ;; let rec quad x = dbl (dbl x) ;; quad 123  just by moving the function de.nition.
Sentence 2: a similar manipu­lation would convert let rec make_adder x = let rec adder y = x + y in adder in (make_adder 3) 7 into let rec adder y = x + y ;; let rec make_adder x = adder ;; (make_adder 3) 7  which makes no sense at all.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: It is difficult to graphically express this concept in Theme/UML due to its foundations in UML and the misalignment between the object­oriented concepts in UML and the dynamic, aspect­based module creation in e. An attempt can be made using sequence diagrams as they have the ability to represent object creation over time with lifelines.
Sentence 2: behaviour described with sequence diagrams become difficult to visualise and understand as designs grow and aspect­oriented extensions are added.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: Many compiler optimizations, e.g., those in Fig 2, have been shown to be highly effective for computations similar to the gemm kernel in Fig 1.
Sentence 2: the performance of the compiler-optimized code is often suboptimal when compared to those attained by manually optimized libraries, e.g., MKL [17], ACML [4], and ATLAS [29], which have been supplied by CPU vendors or HPC researchers, often with selected kernels directly implemented in assembly [8].
Relationship: contrasting