sadat2307/MSciNLI huggingface dataset:
Domain: Software and its engineering
Sentence 1: A Relational Database Model for Representation of Formal Specifications Robert Leithiser Department of Computer Science and Software Engineering Auburn University 334 201-4536 leithrm@auburn.edu   ABSTRACT Literature has established the effectiveness of formal specifications for modeling specifications for computer system properties as well as for verifying program correctness.
Sentence 2: tools that can enable the typical commercial software developer to utilize formal methods are not in widespread use.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: DarSens: A Framework for Distributed Activity Recognition from Body-Worn Sensors* Michael Haslgrübler Johannes Kepler University Linz, Institute for Pervasive Computing Altenberger Straße 69, 4040 Linz, Austria michael@haslgruebler.eu ABSTRACT With the increasing amount of sensors in our environment, the desire to reuse existing sensors for di.erent applications grows.
Sentence 2: most appliances do not provide access to their sensors in a cross-application manner, but rather use them for a speci.c purpose only.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: The study proposed in [13] focuses on the interaction between mobile users and infomobility services, proposing XUL-based inter­faces that have some similarities with the Web-based ap­proach proposed in this paper.
Sentence 2: the study does not address the architectural issues of scalability, availabil­ity and privacy in the deployment of infomobility services.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: Fortunately, a lot of progress has been made here by at least two projects that we aim to introduce and evaluate their usefulness in the context of bringing together di.erent MOP frameworks.
Sentence 2: .rst we want to de­scribe the scripting capabilities and how we allow writing and executing code within the running HeuristicLab appli­cation.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: Specifications such as SOAP, WSDL, BPEL, WS-Policy, and WS-Agreement already constitute the first step to realize the technical aspects in some of the SSE tenets, including tenets 1, 2, 4, and 5.
Sentence 2: it is evident that research is needed to more effectively satisfy the open world assumption .
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: AnEf.cientCodeUpdateSchemeforDSPApplications in MobileEmbeddedSystems WeijiaLi ,YoutaoZhang ComputerScienceDepartment,University ofPittsburgh,Pittsburgh,PA15260 {weijiali,zhangyt}@cs.pitt.edu Abstract DSPprocessors usuallyprovidededicated addressgeneration units (AGUs)to assistaddress computation.By carefully allocating vari­ables in the memory, DSP compilers take advantage of AGUs and generate ef.cient code with compact size and improved perfor­mance.
Sentence 2: dSP applications running on mobile embedded systems often need tobe updated aftertheirinitial releases.Studies showed that small changes at the source code level may signi.­cantly change the variable layout in the memory and thus the bi­nary code, which causes large energy overheads to mobile embed­dedsystemsthatpatchthrough wireless or satellitecommunication, and oftenpecuniaryburden to the users.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: if (x is I) then (x + 1) else xl Function id is parametric, because it acts uniformly on values of all types; while functions inc and test are not, since the former acts only on integers, while the latter acts on values of any type but behaves differently on integers than on other arguments.
Sentence 2: casting all three functions to type .X.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: Bug Finding Tools Schedules: Even though program testingisdifferentfromdebugging, wedrewinspirationfor schedule synthesis from tools that search for concurrency bugs,likeChess[29]andDeadlockFuzzer[21].Still, there existmajordifferences.Thesetoolsexercisetargetprograms in a special environment and, when abug occurs, the tools are able to replay those bugs.
Sentence 2: eSD reproduces bugsdiscoveredinthe .eldbyend users,inwhich casere­quiringtheprogramtoruninaspecialsettingisnotfeasible.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: Therefore, the total memory required to store the probability vector and to sample two candidate solutions is given by 17 µcGA =4 *f + f/4= ·f.
Sentence 2: (5) 4 simple generation-wise GA implementations would require: (1) Parent population: n ·f/8bytes, (2) Parent .tness: 4n bytes, (3) Mating pool: 4n bytes, (4) O.­spring population: n ·f/8 bytes, and (4) O.spring .tness: 4n bytes.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: This allows minimal idle time on the compute nodes allocated for the simulation, as the I/O nodes handle the rate-limiting disk writes and reads collectively and network bandwidth is an order of magnitude faster than disk bandwidth.
Sentence 2: given the trend of ever-increasing simulation data sizes, combined with the need to checkpoint simulation state to minimize data loss in the face of node failure, the I/O o.oading approach alone cannot keep up with the computational throughput available.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: The PCP is e.cient for entities which are only updated by a single process or a small group of processes(the latter, e.g., when in a replicated zone or travelling through a portal).
Sentence 2: global objects have to be updated by all server processes, and all but one of them have a shadow copy of a global object, i.e., they have to send forward messages to update the global.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: Then M has bounded f-block size on C if and only if M has bounded f-degree on C. Informally, the preceding theorem asserts that nested tgds can achieve unbounded f-block size on a class of source in­stances only because some null value appears unboundedly often in the core of the universal solutions of such instances.
Sentence 2: plain SO tgds can achieve unbounded f-block size in more complex ways, as evidenced by the next result.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: Thus, as the rule of thumb, for current, Twitter­scale streams, DS is the method of choice, particularly since it reaches the most accurate results as fewer tagsets are as­signed to multiple nodes, thus, there are fewer Jaccard co­e.cients reported multiple times.
Sentence 2: we did see that some partitions in the DS algorithm have higher load than others, so if balancing load is crucial and network cost is not critical, SCL should be used instead of DS.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: Part of this di.erence can be attributed to natural overheads involved with programming in Java such as class de.ni­tions, various initializations, need to create special objects for threads, exception handling and registering RMI objects.
Sentence 2: a substantial amount of lines is devoted to spawn­ing the tree of threads and accumulating the data in the vector of queues.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: For example, given a set of two aperiodic tasks t1 (mint1=10) and t2 (mint2=11), the following is a valid chromosome in a time interval T=30: (t1,-1) (t1,19) (t1,29) (t2,-1) (t2,-1) (t2,10).
Sentence 2: chromosome (t1,0) (t1,5) (t1,50) (t2,-1) (t2,-1) (t2,10) is not valid since the minimum inter­arrival time constraint for the first task is not satisfied by the two first genes, and the last arrival time for the first task is above the testing time interval T. 3.2.2 Initialization The initial population of chromosomes is randomly created, following the constraints above, provided that a value for T is given.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: Theprimarycontributionofourworkisnotthespeedupproducedbythisparticularoptimizationclient,buttheperformanceauditor ssuccessinidentifyingthebetter-performingversion.Themostim­portantaspectofthisperformanceresultisthatthesystemdidnot degradeperformancemeasurablyforanyofthebenchmarksinoursuite,whichdemonstratestheviabilityofthistechniquetoexploithigh-risk/high-rewardoptimizations.
Sentence 2: theleftgroupof8benchmarksinFigure12arefromtheStandardPerformanceEvaluationCorporation(SPEC);thesebenchmarksareusedwidelywithintheindustryforperformancebenchmarking,andmostcommercialJVMshavebeentunedheavilyforthesebench­marks.Itisthereforenotsurprisingthatoursimpleinliningheuristicadjustmentdidnotimprovetheirperformance.whenex­ecutingnewbenchmarks,suchasthe12benchmarksontheright,somesubstantialperformanceopportunitieswerediscovered.Wedo Speedup 60% 50% 40% 30% 20% 10% 0% -10% -20% -30% -40% -50%  Methods notbelievethistobeananomaly,butanotherexampleofthefunda­mentalissueaddressedbythiswork:predictingperformanceforun­seenprogramsisdif.cult,andthereistremendousopportunityavail­ableifsystemscanautomaticallyidentifyandcorrectperformanceanomalies.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: One ad-hoc approach to implement a data partitioning mechanism for a Single Database Mul­ titenant application would be, .rst, to change the APIs of all these DAOs or make the resolved Tenant identi.er avail­ able to the DAOs implementations and, next, change all the methods to correctly build the necessary statements to in­ teract with the database.
Sentence 2: even being restricted to the DAOs, this mechanism would still require extensive changes to an existing implementation and thus cannot be considered a nonintrusive approach.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: In general, the time-critical path in a sender-to-receiver synchronization consists of four fac­tors [24]: i) the time for message construction and sender s system overhead, ii) the time to access the transmit channel, iii) propagation delay, and iv) the time spent by the receiver 2tributedwithvariance sw to process the message.
Sentence 2: a receiver-to-receiver synchronization is only impacted by iii) and iv) and hence has smaller variance.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: The sampling rate could havebeenincreased, orthe excitationdurationlengthenedto ensure that an unambiguous reading is recorded.
Sentence 2: in ourcase wefoundtheproblemtobe abadcontactbetween the sensor andtheboard.This emphasizestheimportance of deployment time validation, since we were able to replace thefaulty sensorsinthe .eld and avoiddataloss.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: In addition, as our work is re­lated to both regression testing and mutation testing, we also ensure that the selected subjects have been used for regres­sion testing or mutation testing research [6, 7, 10, 31, 42, 43, 57 59, 61, 63].
Sentence 2: they still might be not representa­tive for all the possible subject programs.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: For the small benchmarks mentioned above, there was no measurable difference in checking times.
Sentence 2: on an arti.cially generated C program of about 200,000 lines of code, running on a 2.6 GHz Intel Xeon core, Google s checker took 0.90 seconds and our checker took 0.24 seconds (averaging over one hundred runs).
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: For a reusable artifact, the specification often contains three items: precondition, post condition, and invafiant, The inter- face to one artifact is independent of the specification of the other artifacts.
Sentence 2: if that component is part of a reus- able domain, the question is "Does the domain interface have responsibility of exhibiting or checking on the pie and post- conditions?"
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: [Negative Tuple Joining] This step is the same as the Negative Tuple Joining step in the simple case (Section 3.2.3 case 1) that joins the negative tuples in input R with the negative tuples in input S.  For equi-joins, there are some more special cases such as both join keys are pre-grouped, or the join keys are bound by check con­straints, etc.
Sentence 2: these cases rarely happen in practice and interested readers are referred to [6] for details.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: Weenabletheuseofseparateompilationbyvirtueof expressingpartofthetransformationinasystemati generiprogrammingframework.
Sentence 2: fromtheperspetiveofsequentialprogramminganddeno­tationalsemantis,theseextensionsmightnotseemvery spetaular.undertheonstraintofahievingan eÆientdataparallelimplementation,theybeomeformi­dablehallenges.Inpartiular,thelasttwohavebeenreog­ l nisedasbeingopenproblemsforthelastfveyears.Over­all,theresultspresentedinthispaperallowustorealisea fattening­basedimplementationofnesteddataparallelism asaonservativeextensionofastandardisedlanguagelike HaskellorSML,insteadofrelyingonspeialpurposelan­guages,asitwasneessaryuntilnow.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: 2.4 Strawman solutions It is natural to ask whether our goals could be achieved by using some combination of an existing fault detection sys­tem, such as PeerReview [17], and/or an existing network provenance system, such as ExSPAN [51].
Sentence 2: a sim­ple combination of these two systems is insu.cient for the following reasons.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: A traditional view of IT governance frameworks considers international standards such as the ISO 27000 series of standards for Information Security (the title is re-interpreted by Calder and Watkins to include Governance [4]) or COBIT, as being the key to developing and managing Information Governance and Security in an organisation.
Sentence 2: in order to gain additional perspectives, this paper will expand the viewpoint to identify frameworks in a broader, less formal fashion, which students have found to be very valuable in guiding their research and provides a useful model for this paper.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: Both heuristics are applied incrementally starting from an empty set of neighbor links, adding one link at a time, and maintaining a set S of topics that are not yet K­covered.
Sentence 2: the greedy coverage heuristic selects as neighbor the node that covers the maximal number of topics from S. the random coverage heuristic randomly selects a node whose addition as a neighbor would cover at least one topic from S. The exact values chosen for Kg and Kr express the tradeo.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: One could argue whether the WSDL parser could have been replaced by a WSDL-to-UML con­versor instead, since a UML parser was already in place.
Sentence 2: there were two main reasons we did not make that choice: on the one hand, UML is not a widely used standard to represent web ser­vices, so the WSDL-to-UML transformation would not have much value in itself.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: Traditional graph coloring approaches [3, 2] are a full suc­cess for load/store architectures with plenty of general pur­pose registers and an orthogonal instruction set.
Sentence 2: it is very di.cult to adopt the graph coloring approach for irregular architectures since it assumes that a vertex can be colored with any color as long as the interference constraints hold.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: Rm(T) <:JLS Rm(U) if T is the type of a method argument y.
Sentence 2: if T <:JLS U holds in the original program because y was directly assigned to another variable of type U, then rules MB-ASSIGNTOGENERIC-SAME and MB-ASSIGNTOGENERIC-BASE from Figure 11 guaran­tee Rm(T)  and Rm(U) = C, rule MB-ASSIGNTOGENERIC-SAME en­sures v = w. Moreover, if an arbitrarily complex expression e of type T occurs where an expression of type U is expected, then the implication T <:JLS U =.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: Expression and Enforcement of Con.dentiality Policy in Active Databases Julien A. Thomas Nora Cuppens-Boulahia Frédéric Cuppens .rstname.lastname@telecom-bretagne.eu Télécom Bretagne ; LUSSI Department Université Européenne de Bretagne Cesson Sévigné, France ABSTRACT Many research works focused on modeling relational database management systems (DBMS) that support multilevel secu­rity (MLS) policies.
Sentence 2: most of these previous pro­posals only consider static aspects of relational databases and do not address dynamicity provided by mechanisms like triggers.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: Arrive at Destination (Figure 2) is not enabled; the guard [stophere (c,cf,rl,cd)] evaluates to false because cf=1 and rl=[4] and stophere just checks if cf is mem­ber of rl.
Sentence 2: move One Up (Figure 4) is enabled and its occurrence causes the floor entry in the CAGE token on Moving to change from 1 to 2.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: This makes it impractical to have it turned on all the time in 1 Although a minor change in the operating system can make it easier for gaining control of applications (see Section 2) a production environment.
Sentence 2: the overhead is not prohibitive and in many desktop applications that are not cpu-bound it is prac­tical to run applications in full tracing mode all the time and get a rich repository of traces for dynamic analysis.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: Example properties are: The media player always uses less than 1 J/s (1a, i)  For every execution sequence, whenever a full song is completed, the energy consumed since the song was requested is less than 10 J (1a, ii)  For some execution sequence, the media player reaches astateafterplaying afullsongconsuming lessthan 10 J since the song was begun (2b, ii)  Standard temporal logic and model checking do not al­low directly answering an optimization request of type (iii).
Sentence 2: the nature of an unsuccessful model check that it provides a counterexample when the property does not hold for the model can be exploited.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: Case Study 6: Tupling Tuplingisthenameofasetofprogramtransformationsthat bringtogethercomputationsoverthesameinput[21,6].Tu­plingtransformationscandramaticallyreducetheamount ofspaceandtimerequired.Considerforexamplethenaive functiontocomputetheaveragevalueoftheelementsofa list: averagexs=sumxs/lengthxs: Thefunctionrequireslinearspaceevenifsumandlength arespace-efcienttailrecursivefunctions.Thereasonis that(assuming/evaluatesfromlefttoright)whilesum traverses(thelazilyproduced)inputlist,thecalltolength holdsontoareferencetothestartofthelistsotheentirelist willbelive.Anotherexamplewhichsufersfromthesame problemisthenaivedefnitionofthefunctionsplitwhich splitsalistofcharactersintotwolists,onecontainingthe frstline,andonecontainingwhatremainsafterthefrst(if any)newlinecharacter: splitxs=(beforeNewlinexs,afterNewlinexs) wherebeforeNewlineandafterNewlinearedefnedinthe obviousway.Asolutiontothespaceproblemscouldbeto tuplethecomputations,i.e.,tosimultaneouslycomputethe frstlineandtheremainderbyasingletraversaloftheinput nil.
Sentence 2: (nil,nil) y:ys.ify=newline ; letf(x,y)=MginC[x][y]ifp62FV(M,C)  then(nil,ys) Thelemmasaysthatitisalwaysspacesafetousepattern elseletp=split0 ysbindingsinsteadofprojections.Sowhataboutsplitand in(y:(fstp),sndp)split00?Convincedthat Notethatsplit0 ,incontrasttosplit,isstrict.this ;`letf(x,y)=splitxsginM defnitiondoesn'tsolvetheproblem.Thereasonistheuse f(x,y)=split00 xsginM £let oftheprojectionsfstpandsndp.Duetolazyevaluation, theprojectionsarenotevaluateduntilneededandthereforewespentconsiderableefort B tryingtoproveitonlytorealise holdontothereferencetop,whichinturnholdsonto boththeresultsoftherecursivecall.Asaresult,wehave combinednotonlythecomputationsbutalsothelifetimes ofthetworesults.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: Here we see that the ac-10% tual performance slowdown induced by the compiler algorithm is poorly regulated given that the maximum performance-slowdown 5% constraint was speci.ed as 5%.
Sentence 2: the -adaptation algo­ 0% CINT2000 Slowdown Savings  rithm, which is the foundation of our power-aware run-time (PART) system, regulates the actual performance slowdown much better.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: Such analysis helps manage space allocation between prefetching and demand paging, and allows per­stream prefetching aggressiveness control [Gill 2005, Liang 2007].
Sentence 2: existing approaches seldom explicitly consider the application request rates, in particular the relative ac­cess speed of multiple sequential streams, in their runtime decision making for dynamic prefetching.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: Adap­tive architectural frameworks such as Rainbow [8] have much in common with the approach described here in that man­agment is exogenous to the services.
Sentence 2: rainbow in­frastructures have global adaptation strategies (rather than being modularised in a composite s organiser) and they can­not be recursively decomposed or distributed as can ROAD composites.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: Unfortunately, PERFECT-CLUB uses (outdated) small datasets, which, in the cases of flo52, arc2d, dyfesm, and ocean results in loop granularities in the range of tens of microseconds, which are simply too small to amortize the thread-spawning over­head.
Sentence 2: extended datasets would likely enable scalable speedups on all four benchmarks; for example arti.cially increas­ing granularity by compiling under option O0 results in speedups: 2.6x, 2.1x, 2.2x and 1.6x, respectively.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: Therefore, the following constraint should also be satis.ed: X i× .i = 32. i=1,2,4,8,16,32 The .i values determined from these constraints give us the .nal memory con.guration.
Sentence 2: this does not solve the entire problem since we also need to explain how this .nal con.gura­tion will be used by each loop nest in the application.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: Source Program, its Guarded Actions and the Dependency Graph = true = true = true = true = true guarded actions, there is still more room for optimization: the paradigm of perfect synchrony demands that unique val­ues have to be determined for all variables (in particular also for all local variables) in each step.
Sentence 2: some of these values may not be needed to compute the .nal out­puts.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: This allows specialization to have an opportunistic nature: it injects specialized code, in the form of specialized class instantiations and specialized method calls (§2.3), but the injected entities are always com­patible with the homogeneous translation (§2.4).
Sentence 2: the interaction with separate compilation leads to certain limitations that miniboxing addresses (§2.5).
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: In the .gure, wi1, ..., wik are the k workers of Pi (1 = i = m), the solid lines represent the scheduling with the time-sharing scheme and the dashed lines represent the scheduling with the space-sharing scheme.
Sentence 2: neither time-sharing nor space-sharing can e.ectively balance the performance of the co-running work-stealing programs.
Relationship: contrasting