sadat2307/MSciNLI huggingface dataset:
Domain: Software and its engineering
Sentence 1: Specn FK  5.4 Speci.cation of higher-order functions The speci.cation of a function, whether unary or n-ary, can always take the form Spec1 fK.
Sentence 2: given a function f, we can quantify over every possible speci.cation that f might admit simply by quantifying universally over the variable K. Let us illustrate this ability with the functions apply and compose.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: (4)fq Pq .HPn where fq is the frequency associated with the path Pq and Nn is the average number of iterations for the loop Ln.
Sentence 2: the related CCl,i,t is updated (line 13) as follows: CCl,i,t =CCl,i,t +LCn (5) In fact, when HCl,i contains the basic block BBn,which represents the header of a loop Ln nested in Ll, the execution of HCl,i must consider the additional cycles due to the loop Ln.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: We make use of the summary judgment wf (.,.,S,k), which asserts that the class and method context ., the store typing ., and the store S are all consistent with one another and contain only bindings at or below stack height k. These checks also include the pointer lifetime invariant.
Sentence 2: wf (.,., S,k) implies that the pointer lifetime invariant holds for S. Theorem (Pointer lifetime invariant is preserved).
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: At any particular moment, the Emerging Design contains all the changes that have not yet been transferred to all the developers workspaces, i.e., if a developer makes some changes and checks them in, these changes will not be cleared from the visualization of the Emerging Design until all developers have checked them out from the repository.
Sentence 2: the Emerging Design represents the union of all the differences between all developers workspaces.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: i=1 Figure 4(c) plots the Hellinger distance between the proba­bility distribution of the WS (weighted sampling) strategy and the probability distribution of SS for various k, rang­ing from 1 to 100.
Sentence 2: in terms of Hellinger distance, WS is closer to SS for higher values of k. for less aggressive levels of feature selection, i.e., when the optimal strategy is to choose k to be as close to the rank of A as possible, the weight-based selection methods (WS, which has a simi­lar .avor to DF) can serve as an e.cient substitute for the SS strategy.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: The 18 Output neurons each receive one of three types unique to their joint and axis of control (i.e., j0a0, j0a1, j1a0 each receive a unique type; see discussion of Figure 4).
Sentence 2: axons connecting to Output neurons must seek them (see below) both by their type, and by their position in the neural field.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: Figure 3: Version Model (UML class diagram) Figure 4: Three layers of change (UML class diagram) 3.5 Con.ict Detection and Resolution The checkout/modify/commit interaction model we use as workspace interaction model implies an optimistic con­currency control scheme.
Sentence 2: con.icts can arise when synchronizing the workspace with the central repository.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: This language needs to be powerful enough to allow the descrip­tion of execution engines for di.erent application domains, but not be very generic, as this could make model creation and manipulation as di.cult as writing code in a general­purpose language.
Sentence 2: this language should be made up of constructs that are independent of the application do­main, but related to aspects of execution engines designed for providing high-level services described using a DSML.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: An important conclusion that emerges from these observations is that .ne trade-offs between la­tency and power have to be explored at the system level with a detailed knowledge of the used hardware resources.
Sentence 2: we believe that hardware-software co-synthesis for low-power embedded systems should be performed in tight integration with high level synthesis (HLS) under the guidance of an accurate timing and power evaluation (esti­mation) mechanism.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: Consequently, whiletheRETEmatcher(andtheincrementalap­proachingeneral)maybeastraightforwardchoiceincertaincases, forgeneraltransformationsthe optimalsolution canbe attainedby mixing pattern matching strategies appropriately.
Sentence 2: the im­plementation presented in this paper has been integrated into the newest version of the VIATRA2frameworkin sucha way that the transformation designer can specify on a per-pattern basis which matching strategy shouldbe used.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: A SAX event is kicked off for a node name.
Sentence 2: the parser is modified so that if a name does not appear in P, then the parser just skips the handling of the node, and if a name appears in P, the parser processes the node if the current path can be in P. This modification is implemented as the replacement of the startelement and the endelement methods in SAX.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: To summarize, this study mainly addresses and facilitates the following two challenge areas in software engineering re­search:  Veri.able and repeatable research: The studies that cannot publish their actual data can publish the trans­formed data by using PPT.
Sentence 2: other researchers can repeat the analysis employed in the original study by using the transformed data in order to verify and validate the original results.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: This makes a bug report from CT more accessible to the programmer.
Sentence 2: sOBER and Liblit05 are essentially complemen­tary to, rather than a substitute for CT. For instance, when a programmer encounters one failing case during develop­ment, CT is a good choice to use; when multiple failing runs are available (e.g., during regression testing or beta-testing), Liblit05 and SOBER can be expected to work better.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: SOAP Web Services vs. RESTful Web Services SOAP Web Services RESTful Web Services SOAP web services are more adaptable and they address advanced quality of services and are ideal for professional REST is well suited for basic, ad hoc integration scenarios and gives flexibility to optimize the performance of  enterprise application integration scenarios with a longer lifespan web services SOAP web services use UDDI registries for service discovery REST web services use do-it-yourself for service discovery  SOAP is a single standardized message format No single format for representing resources.
Sentence 2: more maintenance is required since developers have to manually code the URLs and correctly encode/decode the exchange resource representations [22] Operations are defined in a domain-specific manner Rely on a small set of domain-independent operations Applications remotely interact through the web but remain outside of the web Applications become part of the web by using URLs, hence it is easier to test Restful web services using a browser  The Linux server uses Jersey for handling service requests and responses.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: We have a require­ment for a new artefact RSP.
Sentence 2: we construct an extension of our underlying theoretical language (belonging to our underlying science and to the already existing engi­neering discipline) with the necessary symbols, etc., to enable us to show that what RSP describes (at this point only an hypothetical posit HPS and its context) is scientifically possible and that (if the status of our current technology makes its construction viable) the resulting engineering artefact EA will be in a positive analogy with HPS, i.e., HPS EA.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: In developing the model of alternative array layouts, we assume that nj = 2 qj for some j E [0, d= -1] (where d~ is the number of coordinates in an array Y(~)).
Sentence 2: the bit representation of an array index will have q~ bits, with the least significant bit (LSB) numbered 0 and the most significant bit (MSB) numbered qj -I.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: The goal of the proposed migration project is only to ob­tain a preliminary and working service-oriented implemen­tation of MHFanc, not a good SOA implementation of it.
Sentence 2: it is accepted that the migrated system will be non­good from a service-oriented perspective (e.g., granularity of the services too big/small, quality of the services code not good, services containing a lot of dead code).
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: 2.1UsingFreeBandwidth Potentialfreebandwidthexistsinthetimegapsthat wouldotherwiseberotationallatenydelaysforfore­groundrequests.Therefore,freebloksheduling mustopportunistiallymaththesepotentialfree bandwidthsourestorealbandwidthneedsthatan bemetwithinthegiventimegaps.Thetasksthat willutilizethelargestfrationofpotentialfreeband­widtharethosethatprovidethefreebloksheduler withthemostfexibility.Tasksthatbestftthefree­blokshedulingmodelhavelowpriority,largesets ofdesiredbloks,nopartiularorderofaess,and smallworkingmemoryfootprints.
Sentence 2: lowpriority.Freebandwidthisinherentlyinthe bakground,andfreeblokrequestswillonlybeser­viedwhenopportunitiesarise.response timesmaybeextremelylongforsuhrequests,mak­  Figure1:Illustrationoftwofreebloshedulingpossibilities.Threesequenesofstepsareshown,eahstarting afterompletingtheforegroundrequesttoblok.andfnishingafterompletingtheforegroundrequesttoblok..Eahstep showsthepositionofthediskplatter,theread/writehead(shownbythepointer),andthetwoforegroundrequests(inblak) afterapartialrotation.Thetoprow,labelled(a),showsthedefaultsequeneofdiskheadationsforserviingrequest., whihinludes4setorsworthofpotentialfreebandwidth(a.k.a.rotationallateny).Theseondrow,labelled(b),showsfree readingof4blokson.'strakusing100%ofthepotentialfreebandwidth.Thethirdrow,labelled(),showsfreereadingofbloksonanothertrak,yielding75%ofthepotentialfreebandwidth.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: i=1 Because t = 0, the tampering with can escape detection only n when i=1 xiviq = 0, whose probability is 1/(2r +1) for the worst case and 1/(l(2r +1))n for the best case.
Sentence 2: then suppose uq1 is tampered with as uq1 + t1 and uq2 as uq2 + t2.Then r = ri + t1viq1 + t2viq2 ,i =1, 2, ...,n.i nn n s2 = xiri + t1 xiviq1 + t2 xiviq2 i=1 i=1 i=1 and n n s1 -s2 = - t1 xiviq1 + t2 xiviq2 .
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: Differencing U and U gives the operations Ed = [Add a, Add b].
Sentence 2: lIBSYNC recommends to add those two method calls, a and b, into V , along with their dependencies: a is called before b and the output of a is the input of b;b is called before c due to such dependencies in U.Tohelpin adaptation, LIBSYNC alsopro­vides the reference code in JasperReports (Figure 10).
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: A du-path for a variable x is a path of the form uPv such that x is defined at u, x is used at v, and x is not defined along path P. Such a path demonstrates that v is directly data dependent on u with respect to x.
Sentence 2: rapps and Weyuker s adequacy criteria exercise direct data dependences, which, together with direct control dependences, are the simplest form of information flow in programs.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: 3.1 Instrumentation Thefrststepistodecidewhichloadsintheexecutable needtobeinstrumentedforstrideprofling.Ofcourse,the simplestwayistoinstrumentallloads.However,doingthis isexpensiveintermsoftheoverheadofstrideprofling,and isalsounnecessarysincepreviousresearchshowsthatcache 2Again,themagnitudeofthesetwostridesdependsonthe compilerandrun-timesystem.
Sentence 2: (a)NaiveInstrumentation R1.R1+16; R2.R2+8; //... //bothR1andR2arenotredefined //... StrideProfle(R1+24);//instrumentation R3.load24(R1); StrideProfle(R2+64);//instrumentation R4.load64(R2); StrideProfle(R1+48);//instrumentation R5.load48(R1); StrideProfle(R2+96);//instrumentation R6.load96(R2); (b)OptimizedInstrumentation R1.R1+16; R2.R2+8; StrideProfle(R1,R2);//instrumentation //... //bothR1andR2arenotredefined //... R3.load24(R1); R4.load64(R2); R5.load48(R1); R6.load96(R2);  Figure4:Examplesofanaiveinstrumentationand anoptimizedinstrumentationforstrideprofling missestendtobegeneratedbyonlyasmallsubsetofstatic loadsintheprogram[1,27].weusethefollowingtwo heuristicstodecidewhetheraloadshouldbeinstrumented: Not-scalar:Sincereferencesofscalarsorsmallaggregates rarelymissinthecache,theycanbeignoredforprefetch­ ing.OnAlpha,thesereferencesaretypicallymadeof theglobalpointer($gp)orthestackpointer($sp).
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: Further, we also notice that if (somehow) the data-.ow fact {x = 1} were to hold at node D, then the use of variable x at node G can be replaced by the constant 1.
Sentence 2: we see that in order to optimize node G, it is useful for data-.ow fact {x = 1} to hold at node D. This also holds for the data-.ow fact {x = 2}.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: More precisely, the number of rules involved in a single request ranges from 3 to 7 (with a mean of 4.79) and the number of attributes 1http://people.cs.kuleuven.be/ maarten.decat/mw4ng13/ ranges from 4 to 13 (with a mean of 7.65).
Sentence 2: we took measurements for four requests that cover these ranges.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: , rm) be the sequence of m requests where rk Ø U is the object requested at time k. The state of the cache at time k is denoted by Bk = U and is the set of objects in the cache at time k and must .
Sentence 2: satisfy the property iEBk s(i) : S. the se­quence (B0 , B1 , .
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: However, when the composite FSP process is the parallel composition of an analysis model and a safety property (as is the case for the tables Lock Protocol, Correct Pairing and Exces­sive Signaling), we can conclude that the analysis model does not satisfy the safety property only if the composite model can reach ERROR.
Sentence 2: in cases where LTSA returns a trace that leads to STOP rather than ERROR, we cannot con­clude that the property does not hold.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: After removing some bits in B(s1) and B(s2), neither of the truncated Bloom .lters B"(s1) and B"(s2) is included in the other anymore.
Sentence 2: trun­cation can prevent an attacker from discovering containment relationships between two subscriptions with high probabil­ity (see analysis in Section 3).
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: Theexamplesof makingaprogram more deterministic areaspe­cial caseofamore general problem: Oftentimes whatwas assumed to be stable during development time might need to be changed to 2However, as of Java 6, type arguments for parameterized types cannot have annotations.
Sentence 2: the solution is not complete, al­though some work-arounds exist.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: For example, miniboxing uses the static type infor­mation that all values in an array are of the same type: in such a case, keeping a tag for each element, as would be done with tagged unions, becomes redundant.
Sentence 2: we con­sider miniboxing to be an encoding applicable to strongly typed languages, which reduces the bytecode size of hetero­geneous translations, whereas .xnums and tagged unions are encodings best applied to dynamically typed languages and homogeneous translations.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: This function must be called main and receives the play­ers types and names as its parameters.
Sentence 2: for example, the Auction program above, speci.es 5 participants: a sin­gle Seller and 4 Bidder s. Each of the participants has its input and output formats de.ned by its type, and one of them may be empty (e.g.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: For other data set classes we observe Sun UltraSparc III (2M) 1.1e+09 the reverse situation.
Sentence 2: the approach of today s gener­ ators is useful to optimize the parameter values of a sorting 1e+09 algorithm, but not to select the best sorting algorithm for 9e+08 Execution Time (Cycles)Execution Time (Cycles) a given input.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: Even di.erent, main approaches to build SPL, such as Software Engineering Institute s Product Line Practice Framework [4], Pohl s approach [2], and PuLSE (Product Line Software Engineering) [5], have not explored the use of existing reference architectures.
Sentence 2: new approaches or evolution of the existing ones, considering the use of existing reference architectures, in particular, sup­porting the development of the PLA, are quite interesting.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: Being rateless, there is potentially no limit with respect to the number of uniquely encoded blocks generated for each segment, and a suf.cient num­ber of encoded blocks from any set of upstream peers may be used to recover the original segment.
Sentence 2: by recoding the re­ceived blocks at the receivers with rateless codes before their fur­ther transmission, our scheme guarantees the uniqueness and use­fulness of all the delivered contents, and thus completely eliminates the needs for set reconciliation and content assignment.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: We take a slightly di.erent view on the impact, as strictly speaking it is not just a function of the mutant itself, but also of the test case.
Sentence 2: we use the impact as part of the .t­ness function, and quantify the impact of a mutation as the unique number of methods for which the coverage changed and the number of observable di.erences.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: Example s unit: if (AbstractDoc.hasOnlySpaces(pre.x)) We generate: /* If pre.x has only spaces */ When the call begins with a base verb, the return value indi­cates success or failure of the operation.
Sentence 2: we transform the verb phrase into a propositional sentence by appending succeeds to the end of the phrase.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: That slot is then evaluated, and a coordinate is returned.
Sentence 2: the message send {rcvr: stack1}.push(100) results in the push method slot of Figure 1 being evaluated, because rcvr: stack1 matches rcvr = stackParent from the slot guard by virtue of the fact that stack1 extends stackParent (it was created by copying stack), as well as the fact that the selectors are the same and the arguments (100) match the parameters (x).
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: The type system also requires that the lock expressions in a requires clause be .nal for similar reasons.
Sentence 2: the core of our type system is a set of rules for rea­soning about the type judgment P; E; ls f e: t. Here, P (the program being checked) is included in the judgment to provide information about class de.nitions in the program; E is an environment providing types for the free variables of e; ls is a set of .nal expressions describing the locks that are held when the expression e is evaluated; and t is thetypeof e.the type rules track the set of locks held each program point.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: In our model, failure occurs as a Poisson process.
Sentence 2: we compute the expected running time of a failed job (denoted TF ) as follows: T MTTF dt TF =t · 1 e - t MTTF 0 t=T - t - t MTTF MTTF = -te - MTTF · e t=0 MTTF = MTTF - (T + MTTF )e - T (3) if the job duration T is much larger than the MTTF of the cluster (T » MTTF ), Equation 3 implies that TF MTTF , and we expect the job to fail.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: Generic Control Effects Rather than add a speci.c control effect, such as exceptions or delimited continuations, to .URAL, we aim to design a sub­structural type system with a general notion of control effect.
Sentence 2: in this section, we de.ne a new calculus, .URAL(C), parameterized by an unspeci.ed control effect.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: If routers X and Y re-advertise their routes to a peer, then the routes advertised by X and Y will not be equally good.
Sentence 2: rcc also checks whether routers that advertise routes to the same peer are in the same iBGP signaling partition (as described in Section 4, rcc checks for all iBGP signaling partitions, but ones that cause inconsis­tent advertisement are particularly serious).
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: Unfortunately, unlike a hardware cache that contains .xed size cache lines, Fix-Cache contains source code entities, such as .les, that can vary greatly in size.
Sentence 2: if the .les in the FixCache tend to be large and contain a disproportionately large portion of the project code, then focusing on the .lesin FixCache may not be very helpful for code inspection.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: It is also unrealistic to expect that service providers can or should be responsible for performing all required adaptation operations.
Sentence 2: there is a need for media processing and adaptation services (which we term MediaPorts, or MP) somewhere in the network, between the sink (MediaClient, or MC) and the source (MediaServer, or MS), that are able to transform the media stream from the MS into a form that is acceptable for the MC.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: =(A +4 ln(1/e)) / (2A +4 ln(1/e)), we obtain Pr {Y<A} A +4 ln(1 ) =PrY<1 - (2A +4 ln(1/e))2A +4 ln(1/e ) =Pr {Y< (1 -.
Sentence 2: )(2A +4 ln(1/e))} .2 = exp- (2A +4 ln(1/e)) 2 1 (A +4 ln(1/e))2 =exp- · 2 2A +4 ln(1/e) 1 1 < exp- ·4ln(1/e) · 2 2 = e. if the number |I|of inef.cient quanta is at least 48T8/(1 -d)L +16 ln(1/e), the number of productive quanta 2 Actually, the number of rounds is j = l(1 - d)L/3J,but we shall ignore the roundoff for simplicity.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: The design of the adaptation trades off image resolution and quality against image processing time and size to reduce the Figure 9 The control loop for CPU usage The adaptive engine and the server application share the underlying platform resources (J2EE server, operating system, CPUs, memory).
Sentence 2: the overall performance of the resulting application should be taken in to account to prevent CPU saturation and thus performance degradation.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: The idea behind this concept is that the system will be processing data items that are classi.ed at different levels of security, and the security requirements that pre­vent the transfer of high-level classi.ed information into low-level objects must be preserved.
Sentence 2: we de.ne an MLS system as one that must be certi.ed to process and output co-mingled data at multiple classi.cation levels.
Relationship: reasoning