sadat2307/MSciNLI huggingface dataset:
Domain: Software and its engineering
Sentence 1: Let:betheSottdomainoffuntionsoveragroupF.
Sentence 2: thereursiveexpressiong[F]c(g)defnesaontinuous operatorcon:,beausecisaompositionofontinuous operatorslike:translation,restrition,asymmetriunion andextensionofontinuousfuntions.solutions ofg[F]c(g)existandarealledfxpointsofc.Theleast fxedpointofcanbeomputedbyfxpointiterationfrom AX..andisthelimitofcn(AX..)whenngoestoinfnity.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: In this program, the subregion R2 needs data from R1 andR3 needs data fromR2.
Sentence 2: we  error=0; i=0; #pragma SpiceC doacross { while(i<n) { #pragma SpiceC subregion R1 order after(ITER-1, R1) { string = read .le(.le[i++]); #pragma SpiceC commit } #pragma SpiceC subregion R2 no order { ret = calculate crc(string); if (ret != 0) error |= ret; #pragma SpiceC commit  atomicity check order after(ITER-1, R2) } } } Figure 5.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: DESIGN AND CONTROL OF BIMORPH PIEZO BASED MICRO GRIPPER FOR ROBOTIC MICRO ASSEMBLY 2.1 Design of piezo actuator based micro gripper with manipulation system In order to execute the sequential pick &#38; place and peg-in-hole assembly operation of robotic assembly in 3-D environment, a manipulator needs at least 3-DOF and a micro gripper which can adjust the orientation of peg, rotational motions and to execute the assembly.
Sentence 2: a novel 3-DOF based micro manipulator is designed and the schematic CAD model is shown in Figure 1.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: Similarly, the between-subjects effect (generic versus raw) was not sig­ni.cant (p=.273).
Sentence 2: we see in both cases, that a task-by-task analysis (or at least the consideration of differ­ent kinds of tasks) is necessary, due to the signi.cant, and very large, interaction between the variables programming task and kind of used types.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: The precondition associated with the procedure body is de­.ned as the intersection of a collection of sets, each of which rep­resents the speci.cations extant at a speci.c (distinct) call point to the procedure.
Sentence 2: the speci.cations de.ning the entry to a pro­cedure re.ect the common preconditions extant at every call point to the procedure.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: So (as discussed in Section 4.2.1), this means the past rate discounting as­pect must be expressed as two pointcuts and advices.
Sentence 2: while Alpha is more expressive than HALO in terms of pro­viding a richer join point model and the use of full Prolog to reason about the past history of join points, it is also less expressive in allowing hybrid pointcuts to interact with the base program.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: Inthefuture, we wantto analyzehowthis approach canbegeneral­izedtothefullself-embeddingofF * by.ndingan encodingthat en­ compasses the representation of universal quanti.cation.
Sentence 2: it should representation is too limited in this regard, as they cannot de.ne be noted, however, that this is still concerned with the representa­typefunctions whichdestruct orinspecttheir argument.Inthis rep­tionof termsand .nding anappropriatemappingforthetypesthat resentation, they cannot express a partial evaluation or a transfor­re.ectsthis representation.wedo not require a represen­mation to continuation-passing style(CPS).To overcome this,they tation ofdependentkinds, asthey are not containedinthelanguage propose an ad-hoc solution involving adding an additional type ar­interface.Furthermore,theinterpretationsthemselves stillarepara­gument toRfor everydifferent typefunction whichis tobeimple­metric.For example,theinterpretation of lamcannotdepend onthe mented.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: We .nd that, on average, the heuristic solutions achieve performance that is over 22% worse than the GA-tuned solution, and 14.7% worse than the baseline HotSpot server compiler.
Sentence 2: 6.4 Discussion we .nd that existing state-of-the-art online feature-vector based algorithms are not able to .nd optimization sequences that improve code quality over the default baseline.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: Layout-sensitive Language Extensibility with SugarHaskell Sebastian Erdweg Felix Rieger Tillmann Rendel Klaus Ostermann University of Marburg, Germany Abstract Programmers need convenient syntax to write elegant and concise programs.
Sentence 2: the Haskell standard provides syntactic sugar for some scenarios (e.g., do notation for monadic code), au­thors of Haskell compilers provide syntactic sugar for more sce­narios (e.g., arrow notation in GHC), and some Haskell program­mers implement preprocessors for their individual needs (e.g., id­iom brackets in SHE).
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: We compare this model to a centralized overload pro­ tection approach whereby the system is protected against congestion through an admission controller.The admission controller decides the admission ratio, a(t), of new threads using a Proportional-Integral (PI) controller.A PI con­ troller is one whose control signal is proportional to the error signal and its integral, where the error signal is computed as the di.erence between p(t) and some target level, PT .Thus the change in the admission ratio, a(t), can be described by the equation: a.
Sentence 2: (t)= K2 × (PT - p(t)) (8) where a(t) is bounded from above by 1 and from below by 0and K2 is the PI constant that controls how fast the con­ 13In a real setting, VMs may not have started at the same time.this initial value should be viewed as re.ecting an unbalanced allocation of resources (threads) across VMs at some arbitrary point in time.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: Option (1) requires invasive changes to earlier features (violates the principle of stepwise re.nement), (2) requires additional effort in re.ning clientsofthe class,and(3)wouldbe possiblebut change the FJ core calculus signi.cantly.
Sentence 2: we choose the fourth option: providing default values for uninitialized.elds.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: The search delay itself is dominated by the DHT lookup process; i.e., log(N).
Sentence 2: espe­cially in cases where log(N) is large and a small delay is required, we recommend operator instances to avoid DANS lookups for each and every new object; instead, once a suit­able operator instance is found for a pair of sources through the .rst lookup, this pair should maintain contact with each other through the same suitable fusion operator instance for the future pairs of ob jects.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: P isaninoutedgeofP ife isneitheranentry-onlynoranexit-onlyedgeofP.
Sentence 2: notethatformallyspeakingthedefnitionofSPDIdoes notexludeinoutsedges,however,tomakealearsepara­tionbetweenSPDIswiththegoodnessassumptionandthose withoutsuhanassumption,weallthelattergeneralized SP(G SP ).inGSPDIstherearethreekindsof edges:inouts,entry­onlyandexit­onlyedges.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: A na¨ive instruction scheduler that does not respect resource limitations may present the hardware with data-independent opera­tions unable to execute concurrently due to structural hazards, the over-subscription of limited machine resources.
Sentence 2: to be effec­tive, an instruction scheduler must not only be aware of data depen­dences but also of the processor s resource limitations [19, 25].
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: Consequently, there are .nitely many schema mappings M/ = / (S,T,S)speci.ed by a .nite set of s-t tgds such that S=S/.Let M1 =(S,T,S1),...,Mk =(S,T,Sk)be an exhaustive list of all (up to logical equivalence) such schema mappings.
Sentence 2: for each i =k, wehavethat S|=Si or Si|=S.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: In addi­tion, unit annotations, similar to data types of program variables, are relatively stable to program re-organization: structural changes will not require annotation changes as long as data in the program have the same semantics.
Sentence 2: annotations for legacy code can be reused because retro.tting legacy code usually changes program organization, not the algorithmic/data aspects of the program.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: MICRO 11, December 3-7, 2011, Porto Alegre, Brazil ECE Department School of Engineering Boston University Brown University Boston, MA 02215 Providence, RI 02912 acoskun@bu.edu sherief_reda@brown.edu * [10, 5].
Sentence 2: it is critically important to plan and manage facil­ity power and cooling resources.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: Grace s types are primarily structural, and it takes a little more effort to rule out something that is structurally a Contract, even through it was not created by the class contract  4.1.3 Pol A3: Contracts may only be obtained through calls of getSellerContract or getBuyerContract Pol A3 guarantees that the only way to obtain contracts en­capsulated in a module M is through the call of the functions getSellerContract or getBuyerContract.
Sentence 2: this policy for­bids the addition, of, say, a public method getContract accessor that returns a contract, and which would make it possible to leak a contract to a malicious third party.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: 6.1 Predicting By Queue Name and Processor Count With scheduling improvements such as back.lling [18], dynami­cally changing user priorities (often at the behest of besieged sys­tem administrators or center personnel struggling to meet the re­quirements of an important demonstration), and statically de.ned priorities based on job size, users of modern batch systems have come to expect that processor count affects queuing delay.
Sentence 2: a common user desire is to be able to predict, at any point in time, an upper bound on delay for potential job submissions of different job sizes in a single queue.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: B is itself described by a process (child) composed of two activities, C and D linked by a .n­ish2start dependency.
Sentence 2: c has to be .nished in order to start D. The transformation translates each process and work de.­nition into a dedicated pre-de.ned Petri net template, and each work sequence into an arc.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: 5.4 Progressiveness of Solver Theprogressiveimprovementinqualitydemonstratedbyoural­locatorcanbeseeninFigures8and9.After1000iterations,oursolverimprovesuponourinitialsolutionbyasmuchas9.6%(3.5%onaverage).AmoredetailedlookatthebehaviorofthesolverisshowninFigure11whichcomparestheoptimalityofsolutionsfoundbyourallocator,gcc sgraphanddefaultallocators,andbysolvingtheglobalMCNFproblemusingCPLEX.Asexpectedfromthebenchmarkdata,ourinitialheuristic.ndsabettersolu­tionthanthegraphallocator,butnotasgoodasolutionasthede­faultallocator.Withtime,however,ourallocator.ndsabettersolu­tionthanthedefaultallocator.CPLEX.ndsanoptimalsolutionin112seconds,atwhichpointoursolverhasfoundasolutionthatis5.12%fromoptimal.AkeyadvantageofoursolveroverCPLEXisthatifcompilationwerelimitedto100seconds,thenCPLEXwouldhavenosolutionwhileoursolverwouldhaveasolutionthat,whilenotoptimal,isbetterthananyinitialheuristicsolution.
Sentence 2: 5.5 Optimality of Solutions Ideally,aprogressivesolverisguaranteedtoeventually.ndanop­timalsolution.Althoughoursolverhasnosuchguarantee,theLa­grangianrelaxationtechniqueletsusproveanupperboundontheoptimalityofthesolution.AstheiterativesubgradientalgorithmusedtosolvetheLagrangianrelaxationconverges,bothabetterlowerboundontheoptimalvalueoftheproblemisfoundandthequalityofthesolutionsfoundbytheheuristicsolverimproves.asshowninFigure12,asmoreiterationsareexe­cuted,alargerpercentageofcompiledfunctionareprovenoptimal.After1000iterations,wehavefoundaprovablyoptimalregisterallocationfor83.47%ofthefunctionsand99.35%ofthefunctionshaveasolutionthatisprovablywithin5%ofoptimal.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: A simple computation shows that the simple randomized al­gorithm will sample the .rst interleaving with probability 0.5, the second interleaving with probability 0.25, the third interleaving with probability 0.125, the fourth interleaving withprobability0.0625, and the .fthinterleaving withprob­ability 0.03125.
Sentence 2: onepartial orderwillbesampled withprobability 0.96875 and the other willbe sampled with probability 0.03125.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: Proof The proof proceeds by induction on the derivation of f f e : L. Case x: Thenthe derivation ends with TV AR followedbyan application of subsumption for the re.exive case.
Sentence 2: by the premise of TV AR, f(x)= L, and thus by de.ni­tion of r µ(x)= v(x).
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: Mostofthereentmiroproessorshave32ormoreregis­tersthatarelikelytobesuÆienttoholdeveryvariableina program.However,aggressiveompileroptimizationssuh asfuntioninliningandinstrutionshedulinginreasethe registerrequirementwellbeyondthenumberofregisters.
Sentence 2: moreregistersmightstillberequiredforfurther performaneimprovement.Inthisase,onemighthopeto introdueadditionalregisterswithoutalloatingmorebits forregisteraddressingintheinstrutionenodingandhene withoutmodifyingtheinstrutionsetarhiteturesignif­antly.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: However, as Figure 1 shows, SDT overhead is directly related to the rate of execu­tion of IBs.
Sentence 2: most graphs report results (theSPEC number for 3 runs) only for the SPEC benchmarks that execute a significant number of IBs, namely: 177.mesa, 176.gcc, 186.crafty, 252.eon, 253.per­lbmk, 254.gap, and 255.vortex.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: Unfortunately, the model of types does not include higher-kinded types.
Sentence 2: to ensure full interoperability with genericity in other languages on this platform, compil­ers for languages with type constructor polymorphism must resort to partial erasure, as well as code specialisation in or­der to construct the necessary representations of types that result from abstract type constructors being applied to argu­ments.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: To simplify notation, in what follows we shall equate guards up-to commutativity, associativity and idem­potency of 1, and up-to absorption of -conjuncts.
Sentence 2: every CDC if 9then cin Vwill be considered in a normal form like ffff if 1 BEAr1jK B'EtAjr'then cin n1j'jV for .nite (and possibly empty) index sets Iand J, with 9logically ffff equivalent to A BEAr1jK B'EtAjr'.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: Simulation runs are terminated by meeting one of the scenario, and it variable Success can be determined based on application requirements.
Sentence 2: we classify success as follows: f<i: dpq(tend)is less than initial dpq(0)  f< 0.5i: dpq(tend)is less than half of initial dpq(0)  TCap: target is captured by pursuer  f <g: dpq(tend)is less than the distancebetweenpp(0) and pq(tend)  where dpq(t) is the distance between pursuer and target at t, and tend is the simulation end time.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: 1http://www.jhotdraw.org/ JHotDraw is an especially good candidate for a training pro­gram because it was designed and implemented intentionally to be an example of good object-oriented code, using the lat­est design patterns and coding standards.
Sentence 2: there should not be many cases where code needs to be refactored in an object-oriented manner, but instead only cases where object-oriented solutions did not succeed.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: m. Since p1 sends m1 in round r1 - 2D, Lemma 5 tells us that p2 must have received a message that is at least as great as m1 before round r2.
Sentence 2: p2 cannot pass Line 16 in round r2 by receiving m. (Case 2c) r1 - D<rv: We know that rv <r1, which means that rv .
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: The obtained number is then multiplied with 1000 in order to obtain the relative number of defects per thousand logical lines of code (KLOC).
Sentence 2: relative defect density for programming style N is .NN %i i DN = ×1000 , (5) C L N where i is the index variable denoting each found defect, NN%i is the relative amount of effort spent with programming style N in the task where the defect i has been made, and L CN is the number of logical code lines produced with programming style N. Relative defect density is calculated from the final source code for both pair and solo programming.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: Several realistic design sce­narios requirea designer to constraininteractions between objects (see Sections 6.2.3,6.2.4).API designers need to de­sign and customize object protocols according to the needs oftheAPI(see Section5).APIclients commonlymake mis­takes in followingthese protocols (see Section 6).
Sentence 2: we believe that it is important for API designers to state ob­ject protocols and enforcethat API clients follow such pro­tocols.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: Both types of tasks have a deadline equal to their period, and their density is at least 1 on a unit-speed processor by the de.nition of a heavy task.
Sentence 2: for the remaining n < tasks: 11 1 nn n tt t Ci Ci = = .i = .sum = (m - k) (3) Ti Di i=1 i=1 i=1 We need to show that these remaining tasks are schedulable on m <(= m - k) processors of speed ., where .
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: Atthe extreme, if several processors share the same set of ready tasks,the contentsof their readyqueues isidentical, and so they can be viewed as sharing one ready queue, and can be implemented that way.
Sentence 2: the dispatching model covers multi­processors where dispatchingis implementedus­ing a single ready queue, as well as those with separatedispatchingdomains.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: Once a paper is submitted to a journal or conference, those involved in the evaluation of the submission should have synthesis in mind.
Sentence 2: editors, conference program chairs, and reviewers should as part of the evaluation consider whether or notthe paper provides sufficient details, use a correct terminology and is presented in such a way that the paper will be useful for otherresearchers conducting a systematic literature review.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: Because of the asyn­chrony of the system, however, this information is not neces­sarily useful.
Sentence 2: e.g., it might be that p becomes aware of q but then p is delayed for a long period of time and q proceeds further in the computation or even terminates without being aware of p.if p waits for q, it might wait forever.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: Just as measurements are de.ned with respect to a particular unit, scales are de.ned with respect to a unit and origin.
Sentence 2: we de.ne a class Point as follows: class Point { private final D _distanceToOrigin; Point(D distanceToOrigin) { _distanceToOrigin = distanceToOrigin; } D getDistanceToOrigin() { return _distanceToOrigin; } D distanceTo(Point p) { return _distanceToOrigin -p.distanceToOrigin(); } } Unlike Units, we do not require all points to be instance classes, so we do not de.ne Point as having kind class*.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: However, as our experimental results in Section 4 will show, the always-hit model will fare poorly when we estimate the spilling cost to determine whether to apply the IRE to candidate value ranges.
Sentence 2: we define a term, ld_cycle_irem, to be used in the cost model such that the spilling effect before and after IRE are both accommodated.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: Recalling the fact that the service integrator has indicated that with very high probabilities the system will avoid the user taking a taxi and booking a hotel far away from the attraction, it is possible to derive that some paths in the work.ow are more likely to be followed than the others.
Sentence 2: a service integrator might decide not to bind the entire work.ow before the execution, but to leave the less likely paths unbounded.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: Although voice browsers that can read HTML documents ex­ist (e.g., [2]), they do not adequately convey to users the logical structure and semantics of content in Web documents, nor do they provide users with easy ways to select which parts of a document to listen to.
Sentence 2: users who are visually disabled and/or mobile waste a considerable amount of time and attention listening to irrelevant information.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: For example, a page that has been recently read as well as written is kept in both R and W. In this case, the page data is in one page frame, and the page descriptor is linked to both R and W using different link pointers, in order to manage the areas independently and accurately.
Sentence 2: |R|+|W|+|C| can be larger than S, and the number of ghost pages can be equal to or less than 2S.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: 3.3 Factors Important for Maintaining Trust A vendor needs to not only maintain the trust that a client has put in their capabilities but also to work to strengthen that trust for ongoing business relationships.
Sentence 2: a vendor can greatly benefit from focusing on measures that are important in maintaining trust in an ongoing relationship; hence our goal of identifying critical factors for strengthening trust between a client and vendor.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: There are a lot of parties interested in time series data and all of them have certain tailor-made solutions for their speci.c problems.
Sentence 2: we have developed the Time Series 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: reasoning
Domain: Software and its engineering
Sentence 1: Suppose we wish to build a machine with a particular peak performance of Rpeak .ops per unit time.
Sentence 2: given a node of peak Cnode, we will choose the number of nodes P = Rpeak/Cnode.Tmem from Equation (2) becomes, in the limit of large n, ( ) 1 Cnode 3 Tmem O ·· n logZ n. (6)Rpeak ßmem Note the factor Cnode/ßmem.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: Using the sum of probabilities as an upper bound, the probability that at least one job n2 2k 2 is left for Phase 3 is upper bounded by = = k2 .
Sentence 2: k3 k3 with probability at most 1 - k2 2 , the algorithm does not reach Phase 3, and thus, the overall running time for Phases 2 and 3 is at most 2k ·l3 log2 kl.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: In fact, these values are estimated to 640 mW for Tx and 432 mW for Rx for the time an average web page needs to be transferred [1][2].
Sentence 2: the utility loss of a user for sharing k chunks, U(L(k), is estimated in terms of watching time by: tk UL(k)= aenergy × y × k × L aspeed(t) (14) ( t=t1 where t1,t2,..., tk are the time instants where a user broad­casts.
Relationship: reasoning