sadat2307/MSciNLI huggingface dataset:
Domain: Software and its engineering
Sentence 1: Oper­ator parallelism is exposed to high-level synthesis through the unrolling of one or more loops in the nest; any indepen­dent operations will be performed in parallel if high-level synthesis deems this bene.cial.
Sentence 2: we have de.ned a set of transformations, widely used in conventional computing, that permit us to adjust parallelism and data reuse in FPGA-based systems through a collaboration between parallelizing compiler technology and high-level synthesis.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: Total II sizes for varied cluster number for N=2000 (Partial range 0<M<60) According to figure 3, for number of levels and layers H>2, there is no significant reduction in the II size since H increases.
Sentence 2: we only compare the total II size with optimal routing table (OPT) [5] size in figure 4 when H=2.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: Thus the single thread task should always be avoided.
Sentence 2: to maximize the performance of the d-heap op­erations, we consider two design objectives: (1) maximizing throughput of the large amount of the SIMD units for faster .nd-maxchild operations, and (2) minimizing negative im­pact from the single-thread compare-and-swap operations.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: When Vj B]o 6 C(j) f~o) _< f(3) + $(.1)~_< f(3o) .4- s(jo)~ ~ :: the index variables j become redundant.
Sentence 2: inequal- ities represented the loop (denoted as 27(j)) are removed from c ( j ).
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: Quality Question Yes To some extent No QQ1 11 1 0 QQ2 9 3 0 QQ3 10 2 0 QQ4 11 1 0 QQ5 5 7 0 QQ6 6 5 1 QQ7 8 4 0 Table 5: Quality Questions answers do not provide concrete evidences yet.
Sentence 2: more re­search is certainly needed for enhancing the maturity of the studies.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: However, it causes the trigger of the controller to occur more frequently than what the designer in [20] expected, and thus increases communi­cation between the controller and the actuators (negating much of the bene.ts of self-triggering).
Sentence 2: the perfor­mance advantages of self-triggered implementations must be evaluated taking the computation time for the trigger time into account.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: While Join matched only once, the Match with I(AMSC) is repeated for all occur­rences of the template in the original MSC.
Sentence 2: once the I(AMSC) has been applied for the .rst time, the op­erator looks for more occurrences of the template captured byAMSC,possiblywitha di.erent instantiationI1 (AMSC), and applies the aspect again.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: 4.4 Expression typing In theJmask language, the evaluation of an expression might up­date some type bindings.Forexample, initializinga .eld removes the mask on that .eld, if there is one.
Sentence 2: typing judgments, shown in Figure 9, are of the form G f e:T,G', where G' is the typing environment after evaluating e.We write G{ p:T} for envi­ronment G with the type binding of pupdated to T. There are two other kinds of judgments in Figure 9.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: Web access is the one technology common to all groups.
Sentence 2: the direction in designing the architecture was to use Internet technology as much 1 Author also has an affiliation with the Department of Computer Science at Georgetown University, 234 Reiss Science Building, Washington, DC 20057, blakeb@cs.georgetown.edu , (202) 687-3084 as possible in gathering data request information, delivering the data to the customers, and integrating the sharing of their tools.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: Since T3 and T2 do not con.ict, strict disjoint-access­parallelism implies that a2 does not contain any non-trivial operation on base ob jects read in .3 .
Sentence 2: the pre.x of a3 until the point that o1 is .rst accessed is also a pre.x of .3 .
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: Unfortu­nately, thisis ofteninfeasiblebecause of the enormous number of combinations; for example, 20 integer inputs whose values only rangefromzerotoninealreadyleaveuswith1020 combinations.
Sentence 2: knowingwhatcombinationsoftestinputdatatoselectfordifferent input parameters to drive the AUT towards the statements nested inside variousbranchesisverydif.cult.afundamentalprob­lemofsoftwaretestingishowtoachievehigherstatementcoverage faster byselecting speci.c values ofinputparametersthatleadthe executions of applications to cover more statements in a shorter timeperiod.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: 4.1 Local Deployment It is important to note that in the case of local deploy­ment, in contrast to J2EE containers, IIS did not perform any call optimisation to replace the remote call with a nor­mal method call, which happened in JOnAS, for example.
Sentence 2: even though the presentation and service layers are deployed in the same container, the communication be­tween them involves serialization; however, the calls are not performed over a network.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: |T | Assuming that every APT contains the maximum allowed number of entries, the probability that an access point can­not be found within K steps is P r{f ail} = (1 - p)K .
Sentence 2: 7 Thanks to the fact that APTs can be considered as uniform random samples of the set of active topics, each node can estimate at runtime the value of |T | [19].
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: Therefore, we have to disguise the type Shift[A,B,C] as something else, notably something that is compatible with type A because A is the argument type of the expected continuation (recall the de.nition of Shift).
Sentence 2: we make use of Scala s pluggable typing facilities and in­troduce a type annotation @cps[-B,+C], with the intention that any expression of type A @cps[B,C] should be translated to an expression of type Shift[A,B,C].
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: SILT requires approximately 0.7 bytes of DRAM per key-value entry and uses on average only 1.01 .ash reads to handle lookups.
Sentence 2: sILT can saturate the random read I/O on our experimental system, performing 46,000 lookups per second for 1024-byte key-value entries, and it can potentially scale to billions of key-value items on a single host.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: When the parameters of higher-priority resources are unknown, it is a safe assumption that the subsequent executions from the ....h release are delayed by .... - .....Thisis pessimistic, since, in reality, high priority resources would suffer no or only a few preemptions.
Sentence 2: an exact method is required [4], [5], which, however, is not useful for an optimization of 1When ....,.... .
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: sgemmToken[i][j] = j; } /* out sgemmToken[i][j] */ } #pragma adf task relaxed execute(1) sgemmToken[j][0] = 0; /* initial sgemmToken[j][0] for column 0*/ } /* end for */ #pragma adf task relaxed execute(1) ssyrkToken[0] = 0; /* initial ssyrkToken[0] for block A[0][0] */ #pragma adf_start #pragma adf_taskwait }         spotrf[0,0]        strsm[j,0]      ssyrk[1,1] sgemm[j,i] a) c) d) f)   Due to the diversity of algorithms and applications, it is therefore unlikely that a single programming model can support efficient implementation of the whole application spectrum [3].
Sentence 2: a number of recent proposals aim to combine different well established models into a single programming model that can support a wider range of computation and communication patterns.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: To make a reference A[200] in the CUDA kernel access the location of A[0] on the device, we need to shift the start address of the array in the CUDA kernel by -memO.set.
Sentence 2: a reference A[i] in the origi­nal OpenCL kernel becomes (A-memO.set)[i] in the CUDA ker­nel.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: An invalid recommendationis one whose application can alter the output prior tothe errormarker.Thegoaloffaultrepairisto.xtheinputinsuch a way that the output at the error marker changes to the expected output; all text preceding the error marker is assumed to be cor­rect.
Sentence 2: we classify a recommendation as invalid if it can potentially change anyoutput text that precedes the error marker.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: 5.2 Introducing R2 LMS Much in the same way as LMS regression is introduced in comparison to OLS regression, we here de.ne R2 as fol- LMS lows 2 medi.1..n{|yi - axi - b|} RLMS =1 - medi.1..n{|yi - y¯LMS |} where y¯LMS is mLMS for the {yi} data set.
Sentence 2: we have P2 (yi-axi-b) i.1..n replaced the average square residuals n and (yi-y¯) i.1..n P2 of Formula (1) medi.1..n{|yi - axi - b|} and n medi.1..n{|yi - y¯LMS |}, which are with their counterparts minimized in LMS regression.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: Thus, their supersets P and Q intersect a contradiction.
Sentence 2: the values of S.+-outputp conform to the speci.cation of S.+, for each process p. .+ 3.4 Using (., S)to solve nonuniform consen­sus The algorithm of Figure 3 uses the failure detector (., S.+)to solve nonuniform consensus.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: In MDD, Uni.ed Mod­eling Language/Object Constraint Language (UML/OCL) class diagrams play an important role for model design, analysis, and transformation.
Sentence 2: the veri.cation of UML/OCL class diagrams at earlier stages in the de­velopment process is an essential task in order to check the correctness of model properties, i.e., veri.cation of a 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: Since all versions (by using both DOSC and CDC met­rics) demonstrated to be too scattered in relation to their components, we decided to analyze the scattering in a more 1http://www.teccomm.les.inf.puc-rio.br/emagno/ajato/ 2http://aopmetrics.tigris.org/ .ne grained way.
Sentence 2: we employed the DOSM metric to measure the degree of how scattered the concurrency con­cern is in relation to all operations in the target systems.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: Served as a negative result, it is shown that (x,p) following (7)­ (8) oscillates inde.nitely in common multi-path unicast sce­narios [27, Section 2.5].
Sentence 2: to our best knowl­edge, almost no solution for multi-path routing utilizes such Primal-dual algorithm.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: Database query languages are of­ten limited in expressiveness: for example, plain SQL conjunctive queries cannot express recursive properties such as transitive clo­sure.
Sentence 2: understanding the relative expressiveness of different (Turing-incomplete) query languages, and the tradeoff with com­plexity of query evaluation or optimisation, are important issues in database theory [1].
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: In addition, a publication also provides a protocol that represents the invoca­tion dependencybetween provided methods and required methods in the code of the component so that the assembler can compose a new composite component(infact,a publicationofthenew com­ponent) accordingto the publications of the existing components.
Sentence 2: a publication can be seen as a pair of publication contracts de.ned below together with an invocation protocol.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: Weevaluatedtheidealizedtrace utilization measure onthedifferent heap shapes.
Sentence 2: a single run for each measurement point suf.cedforthe method of adding shortcuts.Forthe method oftrac­ing through random roots, every measurement point is averaged over5 runs to accountfor the nondeterminism resultingfrompick­ing roots at random.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: This insight canbe exploitedinlifeguardhandlersbycheckingthe frequent case stable state in a fast path while branching intoa slowpathformoredetailed checks.However,eventhe most optimizedcheckingoperationhastodo metadata access, comparison, andbranch.
Sentence 2: (redundant)metadata checks are a secondkeysource oflifeguardoverhead.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: When getID() method is invoked on e, we ex­pect Employee.getID() to be executed; however, if the nor­mal method lookup rule of Java stipulating the most speci.c method to be always selected is applied, Student.getID() is called.
Sentence 2: because it behaves di.erently from Employee.getID(), the result of method call e.getID() does not satisfy the ex­pectation of the user of e. in this case the alter­native method lookup scheme is required.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: This was because the MPICH implementation performs a lazy receive (still correct aspertheMPI semantics) where it starts receiving only when it encounters an MPI_Wait or MPI_Test or whenthe controlisgivenback totheMPI run­time that would force progress.
Sentence 2: in the above example,processP 1would be stuck on the MPI_Wait ofline7.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: On the tinkering consistency measure (number of episodes) ANOVA analysis still showed a significant effect of treatment (p<0.01, F[1,72]=9.64), but did not approach significance for gender or for gender x treatment.
Sentence 2: as the episodes rows in Table 1 show, the High-Support group had less consistent emphasis on tinkering as a problem-solving device.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: The top objective is to avoid reinvention, redesign and reimplementation when building a new product, capitalizing on previously done work that can be immediately deployed in new contexts.
Sentence 2: better products can be delivered in shorter times, maintenance costs are reduced because an improvement to one piece of design work will enhance all the projects in which it is used, and quality should improve because reused components have been well tested [2, 3].
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: The former includes navigation links (e.g., button) to other pages while the latter serves as a container for the service frontends, which can be integrated and ar­ranged within the frontend area.
Sentence 2: the overall ap­plication design and layout is de.ned by the integrated frontends and simple page customizations (e.g., change background color, add image, position navigation area).
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: In [2], we showed by extensive simula­tion experiments that CA-GREEDY yields higher revenue, Workload file (normalized load) Figure 2: Average pro.t per processor-hour by CA-PROVISION and CA-GREEDY vs. normalized load resource utilization, and percentage of users served than the .xed price-based mechanisms.
Sentence 2: it is su.cient to compare CA-PROVISION with CA-GREEDY in this work to .nd the performance gain.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: (Dloglog D) to keep the ef.ciency constant.
Sentence 2: it is not astonishing that the inef.ciency is slightly increasing with D. The matching algorithm always achieves much smaller inef.ciencies at the same buffer size and this gap seems to widen for larger D.  5.4 Mixed Traf.c We have seen that RDA works well both for continuous request arrivals and for bursty traf.c with bounded prefetching buffer.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: 8.3.1 Control Flow Model The pointcut mechanism in AspectJ allows to select distinct points in the dynamic execution of a program which are interpreted as points in the dynamic call graph [20, 15].
Sentence 2: aspectJ can be considered to realize a control flow-oriented conceptual model of join point selection (and it provides dedicated selection means to reflect on this conceptual model, such as the cflow pointcut designator, for example).
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: The Types.STRING and Types.INT are the runtime types for x10.lang.String and x10.lang.Int, respectively.
Sentence 2: 4.2 PerformanceOptimizationbyGeneratingBridgeMethods X10 allows specifying primitive types as the parameter types, butJava doesn t. primitive types for the parameter typesin X10 are translated to the corresponding wrapper classes inJava such as B (line 27) for B[Int] (line 7).
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: The axiom and all other rules are identical to the ones in Figure 4, using fs judgments instead of f. P, H f se : ck on w1 w1 <: w2 (SUB) P, H f se : ck on w2 P, H f se1: ck on w1 P, H f se2: ck on w2 w1 <:0dw2 (CTR) P, H f se1 at e2: ck on 0dw2 Figure 7.
Sentence 2: the relaxed clock calculus starting from a standard clock calculus whose purpose is to reject non-synchronous program, we extend it with subtyping rules expressing that a stream produced on some clock ck1 can be read on the clock ck2 as soon as ck1 can be synchronized into ck2, using some buffering mechanism.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: Also, degree(V (e1,k,S 1)):degree(V (e1,k,S )and degree(V (e2,k,S 1)):degree(V (e2,k,S )).
Sentence 2: it follows from the induction hypothesis on U1 ,S 1 ,e1 and e2 that U1 !
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: For each edge between actors A and B with production/consumption rates rA and rB respectively, initial tokens t, and boolean guard B (see Fig.
Sentence 2: 4), the following data constraint is generated rB · i - t Bi > Af(i) with f(i) =(2) rA rB ·i-t rB ·i-t If actor A has .redtimes, it has produced· rA rArA tokens, which is greater than or equal to the number of tokens required to .re actor B i times, that is rB · i - t. after f(i) .rings of A and i-1 .rings of B, there remains enough tokens in the FI FO to .re B for the ith time.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: All the cases in the sample for testing each hypothesis gave affirmative result.
Sentence 2: the z-score of binomial test for Property 2, 3 and 4 are 4.41 (X = 629, n = 629, p = 0.97), 4.26 (X = 587, n = 587, p =0.97) and 3.41 (X = 376, n = 376, p =0.97) respectively.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: Artur Hecker, Houda Labiod TELECOM ParisTech (ENST) 46 rue Barrault, 75013 Paris +33145817352, +33145817436  {hecker, labiod}@enst.fr corresponds to the set of identifiers x1... xf, then the identifier xj, (1= i.j = f ) corresponds to the identifiers x1... xf as well.
Sentence 2: the identifier x is associated to the f identifiers given by the function h: h (xi) = (x + (i * N/f)) mod N. the identifier space is partitioned into N/f classes 3.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: Asaresult, mostP2Papplicationswouldsaturatethe availableuploadingband­width when the channel has a large population.
Sentence 2: this is also true inTVUPlayer.wewantto studywhetherthrottling up­loadingtraf.cintheP2Pmobile streamingwouldreducethepower consumption.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: Collecting as much informa­ tion as possible on a given variable enforces the constraints on its domain and reduces the search space.
Sentence 2: incon­ sistencies are detected as early as possible, and unfeasible 1SSA (Static Single Assignment) form is an intermediate representation used in compiler design: it is a semantics­preserving transformation of a program in which each vari­able is assigned exactly once [12].
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: Besides that, AUTOSAR pro­vides the interfaces of the software applications (which are divided into Body &#38; Comfort; Powertrain; Chassis; Occu­pant &#38; Pedestrian Safety; and Human Machine Interface, Multimedia &#38; Telematics); these interfaces refer to com­munication among di.erent software components that are present in these applications.
Sentence 2: we can say that informa­tion C1 (communication required among internal modules of the systems and related protocols) is present in AUTOSAR.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: Cost of Miss-Speculation  The cost of miss-speculation can be measured as the sum of the cost of corrective action with the cost of re-executing the work, added with the cost of acquiring and releasing locks for both the conflicted and re-executed iteration.
Sentence 2: the cost of miss-speculation increases as the grain coarsens, as does the amount of wasted work due to rollbacks.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: ATK object for hypertext and hyperlink When focusing on a link, Mozilla A11y fires a focus event for the hypertext with the index of the hyperlink in the hypertext.
Sentence 2: screen reader can inform the blind user that a hyperlink has been focused; When GOK grabs the UI elements of a webpage, GOK uses keyboard to represent each hyperlink in the webpage.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: The goal for video adaptation is to send the most useful data to the sink with minimum waste.
Sentence 2: the metrics we use to  3000 2250 Part (a) end adaption end adaption with e2e reliability 25 30 end adaptation approach 1 20 Number of frames (for each priority and total) Number of frames (for each priority and total) fps fps fps fps 1500 approach 2 15 10 750 approach 3 5 0 0 20 40 60 80 100 0 4.2 3.6 3.0 1,8 0.9 seconds Bandwidth (Mbps) 30 3000 approach 1 25 Part (b) end adaption 20end adaption with e2e reliability 2250 15 approach 1 10 1500 approach 2 5 approach 3 0 0 20 40 60 80 100 750 seconds 30approach 2 0 25  4.2 3.6 3.0 1,8 0.9 Bandwidth (Mbps) 20 Figure 3.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: Moreover, di.erent mappings of the library onto the target platform can give vastly di.erent speed-ups: a test program computing a hash (based on SHA-1) of 1KB of data took 87.8s, 43.4s, and 2.2s, for three di.erent mappings of the library onto the multiprocessor SoC platform used in this work.
Sentence 2: e.cient security processing also requires op­timized mapping of the security library to the target hardware platform, a problem that has thus far received little attention.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: In the .rst case (line 9), (lx ly) is fully known as (Cons (v1, v2) Nil), in the second case (line 11), only lx is know to be One v.As (exit 3) on line 15 gets ex­ecuted only when ly is not Nil, we can .nally deduce that the .rst case never results in entering trap handler num­ber 3.
Sentence 2: trap handler number 3 is executed in a context where lx necessarily is One v, the switch it per­forms is useless and line 16 can be simpli.ed into 3 .
Relationship: reasoning