sadat2307/MSciNLI huggingface dataset:
Domain: Software and its engineering
Sentence 1: Moreover, in principle all approaches need to address concepts like resource demands, consumption costs, quality mappings and selections of configuration parameters, but they don t usually explicitly focus on or expose their descriptions and their relationships.
Sentence 2: it would be interesting if one could easily separate the modeling of these concepts, the relations between them, and their usage, from the engineering and technology details selection level, in order to be feasible to easily construct realizations of different system-wide architectural alternatives.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: 4.3 Workloads creation To exhaustively validate our thesis, we tested all the possible workloads featuring a number of instances for both bodytrack and ferret ranging from 0 to 4, imposing that the total number of appli­cations would be greater than three.
Sentence 2: there is always at least one binding domain where two applications share the resources.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: Once an object becomes thread-shared, a process which must be signi.ed by the share annotation, it can no longer be mentioned in another object s invariant.
Sentence 2: examples like the one shown in Figure 13 where the invariant of the RequestPro­cessor class depends on the thread-shared RequestPipe ob­ject, cannot be veri.ed.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: The feedback that usersprovide ononeversionofanapplication isautomaticallycar­ried forward, using defect differencing, to the next version.
Sentence 2: the feedback-import feature can be used to customize future re­ports: Invalid and WontFix bugs keep recurring from one ver­sion tothe next, but can easily be .lteredout so that the user is not distracted by them.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: on selectors that are themselves unde.ned  have the return type [a], which is again pointed without any condition on a.
Sentence 2: launchbury and Paterson s approach to parametricity in the presence of pointed vs. unpointed types can be used to show that law (1) holds without any conditions on p, h, or l, provided all invocations of seq are dropped2 2By contrast, if, e.g., recursion were performed at a type whose (in which case we get precisely the .lter function from Haskell s standard prelude).
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: To eliminate half of the cross-core interference penalty of a is more valuable than b, meaning the bene.t gained, a 20% in­crease in speed, with a is better than the 1.9% speed up in b.
Sentence 2: we should be willing to sacri.ce more utilization to eliminate 50% of the cross-core interference penalty for a than b since a is more cross-core interference sensitive.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: This and Lemma 3.2 imply that the CurrSeq parameter of gv(S ' ) has the value written in Rs by S ' .Since gv(S ' ) reads the value written by U,it follows by the code that if U reads in Rs avalue for CurrSeq greater than or equal to the one written there by S ' , gv(S ' ) will terminate by executing line 26, which is a contradiction.
Sentence 2: u reads in Rs avalue for CurrSeq less than the one written there by S ' .So, U starts its execution before S ' writes to Rs.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: However, if the com­ponent J modi.ed this data as shown in Figure 1c, then the read element would be authors and the obtained value is Single .
Sentence 2: if the component J inserts a data element into the path to some elements accessed by the component C, then the result of interference of these operations is that the component C accesses and reads values of different data elements from what was intended when it uses sequence numbers of elements rather than their names.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: C-DIDUCE isdifferentfromtheoriginalimplementationinthefollowingways:1.BecauseC isnotanobject-orientedlanguage,wetrackprogrampointswhichreadfromorwritetoglobalvariablesinsteadofobjects,andalsostatic-typedobjects;2.formulti­worduser-typedobjects(includingstruct),wecastthe.rstwordintoanintegervalueandusethisasthevalueoftheobject;3.sinceC hasnoobjectreferencesorinheritancerelations,weignorepointertypes;and4.bydefault,C-DIDUCE doesnotrelaxinvariantsduringthecheckingmode.Repeatedviolationreportspointingtothesamelocationaremergedintoone.Otherwise,C-DIDUCE isimplementedthesameastheoriginalDIDUCE (includingtheviolationrankingscheme).C-DIDUCE instrumentsthesourcecodewithcallstotheC-DIDUCE runtimelibrary(containingC-DIDUCE checkingandreportingfunctions).
Sentence 2: tomeasuretheeffectivenessofdetectingvalueinvariantvi­olationswhenusingtheArtemisframeworkwithC-DIDUCE,wemeasuretheoverlapoftheinvariantviolationsintheSPEC 2000 benchmarksdetectedandrankedusingC-DIDUCE and{C-DIDUCE +Artemis}.Thisisjusti.edsinceC-DIDUCE (andDIDUCE)onlydetectandrankruntimeviolationsofinvariants theydonotac­tuallyidentifybugs.theextentthatArtemisimpactstherankingsgivenbyC-DIDUCE isindicatedbyhowmanyviolationsdetectedbyC-DIDUCE andrankedtopX isstilldetectedandrankedtopX whenusingC-DIDUCE withArtemis.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: Reputations are often used to distinguish between users, and in many applications, users care more about relative reputation values than the actual values.
Sentence 2: we say that a sybil strategy (G',U') for node i in G is successful, if some sybil has a better relative rank than i in G. Since imay use any of his sybils to perform transactions in the future, a sybil strategy is successful if at least one sybil has higher rank.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: Also, when an AD is a pointer to an MD in the MAR, the cor­responding MD in MAR is looked up, and the corresponding en­vironment variable is set appropriately.
Sentence 2: the time-wise inte­gration of the FAR and MAR activities happens implicitly through the explicit pointers from the FAR to the appropriate entries in the MAR.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: An attacker could exploit this vulnerability by setting the name parameter to ";alert( xss )//.
Sentence 2: this would cause the resulting inline JavaScript to be the following, thus executing the attacker s JavaScript code:  var username = "";alert( xss )//";  the code section of the application is dynami­cally generated with untrusted input and even with the code and data separated, there is still an XSS vulnerability.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: The two lists are coordinated, so both ß are drawn if our red-black tree were a dictionary (with a key and value from the same type list ß ' .
Sentence 2: for each pair of corre-for each conceptual node), separating the keys and the val­sponding nodes, the conditional types must evaluate to the ues could make functions accessing only the keys (e.g., is same branch.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: While the deployment began with a few hundred users and has been augmented by early adopters, Rendezvous is beginning a phase of systematic deployments that will make it available to twenty to thirty thousand users over the next year.
Sentence 2: while at present our results reflect the experience of volunteer "early adopters," we expect to be able to present a more general set of results in the future, at least for corporate conference callers (a not insignificant usage niche).
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: 3.2.1 Taint Sources The goal of our algorithm is to (1) pinpoint the instructions that have a memory operand that needs to be symbolized and (2) pinpoint every global data location that stores an initial function pointer or a global data pointer which need to be symbolized.
Sentence 2: our taint source contains the instruction address (PC) whenever an instruction involves a literal value operand, or a data value that appears to be a global pointer or a function pointer.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: For instance, for k = 300, at p1 =0.1, this guarantee applies for more than 90% of the acceptable defect rates; but at p1 =0.01, the guarantee applies form less than 3% of the acceptable defect rates.
Sentence 2: the simple strategy can be applied only if a large uncertainty region is acceptable, which means that the Dis­patcher has a strong con.dence in the fact that the defect rate is actually null.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: We restricted the test bed to a LAN environment due to the fact that the JavaParty benchmark bundle has only about 100kB size.
Sentence 2: the LAN scenario represents the worst-case scenario for OSGi4C becausetheloading timeis equalinaWAN set­ting(see Table2) butSOAP-basedWebservice invocation times increase.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: There will also be a parallel thread with the execution time of (1 + Lfid - fi)Pi max and the relative deadline of (1 + Lfid)Pi max .
Sentence 2: if we c si-1 2j m P 2j let Pi = 2 m i , the following inequalities are j=1 i satis.ed: (qi - 2)P max t i (1 + Lfid - fi)P max .i = + i (1 + fi)Pi max (1 + Lfid)Pi max ti.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: As shown previously, it is not di.cult to see that the z-links used in this spanning tree are disjoint from other z-links used in case 1 and 2(b); thus all the links in this spanning tree are contention-free.
Sentence 2: our algorithm for the construction of the spanning tree on a 3-D torus can be summarized as follows.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: INTRODUCTION In the current globalized economic conjuncture of Brazil, the volume of negotiation carried on in the financial market has increased values and the competition, in this market, holds as a success differential the demand of information with more and more quality, transparency, quickness and low cost.
Sentence 2: the pursuit for reduction in enterprise processes complexity using Information Technology (IT) is a challenge sought by software developers.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: In order for the results from unsynchronized writes in the untrusted context to be seen in the trusted context, Codejail provides APIs which synchronize speci­.ed regions of memory in the untrusted context to the trusted one.3 In addition, system calls are restricted by a speci.ed policy when executing in the untrusted context.
Sentence 2: codejail ensures that the untrusted library is sandboxed with respect to memory writes and system calls.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: Notice that it is di.cult for a node to trust the contents of a message, as it cannot determine whether that message originated at the ostensible sender s, or at a malicious device spoo.ng messages that claim to be from s. However, if a receiver does not receive a message in a round, it can be certain that no message was sent; the malicious nodes cannot forge silence.
Sentence 2: we make frequent use of silence to authenticate data.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: The constraint at s3 node is p and the constraint at s6 node is d, so the PCsets of these two paths respectively are as follows: PCset1 = {p, d} and PCset2= {.p, d}.
Sentence 2: the DFC from s2 to s7 is the disjunctive of the two paths, DFC= (p.d) .
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: The CHECK-CAST intersection narrows the set down to {T2} (assuming T1 is not a subclass of T2), which is the resulting type set for field B.b.
Sentence 2: any optimization can (optimistically) assume that a reference loaded from B.b must point to an object of type T2, as opposed to the closure of the declared type, T~.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: However, an important observation is that, since each operation crosscuts each visitor class, adding a new node to the existing class hierarchy will cause an invasive change to all of the visitor classes resulting in a maintenance nightmare.
Sentence 2: no matter if it is a pure object-oriented or aspect-oriented implementation, the visitor pattern is applicable only under conditions when the node structure is static and does not change frequently.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: Thus, the upper bound on R, Rmax= 1,Vfinal1V=1,11(1+1).
Sentence 2: since in this example, Vfinalis always smaller than or equal to V, the average value of Vfinalshould then be (1+11(1+1))12xVi the average rate of con.icting reservations, Ravg, equals to 1,Vfinal1V=1,(1+11(1+1))12= (1,11(1+1))12.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: Besides,since.ash memoriesarepurely electronicdevices and have no moving parts, they have no seek or rotation latency like magnetic disks.
Sentence 2: random access of .ash memory can be as fast as sequential access and the la­tency of .ash memory is almost linearlyproportional to the amount of data being accessed, no matter where the data Table 1: Magnetic Disk vs. NAND Flash [19] Read Write Erase Magnetic Disk 12.7 ms 13.7 ms N/A NAND Flash 80 µs (2 KB) 200 µs (2 KB) 1.5 ms (128 KB) is located.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: In the lookup table, the gain of .nding the physical address of replacement block is amor­tized by the number of OOB data reads incurred during a backwards search to locate a required page.
Sentence 2: the advantages of the lookup table are smaller in a .ash with larger block size, since a larger block holds more replacement pages compared to a same size .ash with smaller block size.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: By Lemma 2, CSowner has the value p in some configuration C that lies between the steps Line(p, k, 1) and Line(p, k, 7[last]).
Sentence 2: if the value of CSowner is not p in the configuration D, then there must exist a step s' in the fragment of the run from C to D such that s ~ changes the value of CSowner from p to something else.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: Second,ineach classversionthestaticinitializerisex­tended toinvoke the pbi_initClass() methods of all class versions inthe end(if thereis no staticinitializerin a class version,itis created).
Sentence 2: after merging of the staticinitializers, the pbi_initClass() methods of all class versions willbe executed, in­dependently ofthe executed code version ofthe merged staticini­tializer.Thatis,allinsertedstatic .eldswillbeproperlyinitialized.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: Furthermore, modern supercomputers are often configured by connecting multiple GPUs in large-scale networks due to the advantages of such architectures, including their very high cost/performance ratios and low power consumption.
Sentence 2: outside of the GMs, it is also essential to have some way of detecting faults in the interconnections between the SMs and GMs, or in the network between the GPUs.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: Dis­abling network bu.ering for puts (this happens to be correct for this benchmark) brings the auto version s performance to within 3% of that of manual blocking, but has no ef­fects on the other benchmarks.
Sentence 2: while our framework is e.ective for small to medium transfer sizes, a zero-copy consistency checking algorithm could further bene.t appli­cations with large-sized puts.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: If we were to lock the data structure for each of Q queries, each query might be forced to wait for in­sertions and other queries, thereby increasing the apparent work by as much as T(QP) and nullifying the advantages of P-way parallelism.
Sentence 2: we lock the entire global tier when an inser­tion occurs, but use a lock-free implementation for the presumably more-numerous queries.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: Since routing nodes in a wide-area pub-sub system are typically managed by entities in di.erent administrative domains, we must assume that publishers do not trust rout­ing nodes in other domains in terms of the con.dentiality of their published data.
Sentence 2: our secure aggregation protocol should allow untrusted routing nodes to perform aggregation of raw data without learning the private input values.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: In other words, xi = cji for 1 =i =k.
Sentence 2: since each count c is independently selected with probability g(c), for each occurrence of c, on the average g(1 c) -1 other nodes have (I,c)but did not sample it; that is, each occurrence of ccan be thought of as representing g(1 c) occurrences of c. we estimate the total count fI of I as x1 x2 xk fbI = + + ···+ (1) g(x1) g(x2) g(xk) The following theorem shows that this estimator is unbiased and establishes its MSE.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: Barring special thread interfaces such as OpenMP, however, the number of threads cannot be dynamically adjusted during runtime for most workloads.
Sentence 2: if the power cap or workload behavior vary signi.cantly during runtime, it is highly likely that the sys­tem operating point will not lie on the power-delay Pareto ef.cient Table 2: A comparison of the average power and execution de­lay of our MLR classi.er with and without thread packing for a 130W power cap.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: Note that Permissions propagated upwards via a doPriviledged node do not propagate beyond the predecessor of the doPrivileged node.
Sentence 2: the above definition (or the algorithm based on it) must be refined to replace G-() by G- n, p), where n ( To clarify all of the concepts introduced in this section, consider the following simple example.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: Change in data correlations may result in changes to the correlation graph.
Sentence 2: each deleted node s periodically checks for validity of the hyperedge (S, s)usedin its C3 condition by gathering data from the nodes in S (using the piggyback strategy over normal data-gathering process as described in Section 2.3), recomputing the a parameters (Equation (2)), and checking if the least square error (Equa­tion (1)) is within the given bound.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: 0 if |f1 - f2|= a I(f1,f2,a)=(|f1 - f2|) (1) 1 - otherwise a For IEEE 802.11b/g three channels of the 2.4GHz fre­quency band are theoretically orthogonal.
Sentence 2: we set a to 30MHz, which results in the following set of orthogo­nal channels {1, 7, 13}.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: In our solution, we exploit the interpretation that ensem­bles can be viewed as a con.guration of a .attened SPL reference architecture.
Sentence 2: we create an SPL con.gura­tion by (i) transforming the SPL reference architecture to an architecture of DEECo components and ensemble de.ni­tions, and (ii) re.ecting the establishing and dissolution of DEECo ensembles at the level of the SPL reference architec­ture.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: At the end of each round, the results in array tempU are copied back to U.The (ij)T loop nest implements the actual 5-point stencil computa­tion, and is the focus of our approach.
Sentence 2: we will omit the outermost t loop and the array copying part (which is not a stencil computation) in the rest of our discussion.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: As a result, based on the concavity of R(ek)inTheorem2and the optimalityof Theorem1,wecandividetheoverall optimization problem into two subproblems, says inter-frame and intra-frame energy assignments.
Sentence 2: what we have to do is to determine the intra-frame energy assignment.Byapplying the Lagrange Mul­tiplier method, we can solvethe problem in Equation (1) optimally, as shown in Algorithm 2.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: By the previous rollback scheme, the federate state is always re­covered at the point of an NMR call to the TiMaC layer.
Sentence 2: this means that, upon state recovery, the federate automati­cally re-starts from the epoch with initial time trecovery .after having performed the state recovery phase through the Recovery-Action B, TiMaC skips exe­cution of Step 1 and immediately goes on executing Step 2 and Step 3 for that epoch.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: i=1 where n is the number of .elds of o; Lo is the lifetime of th instance o; li is the lifetime of the i.eld of o; r(o)is the idle .eld ratio for o; b is the size of each .eld; and Bo is the total size of o (i.e., Bo = nb).
Sentence 2: p(o) is determined by three factors: the idle .eld ratio, size and lifetime of instance o.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: automaticdeductionofacompoundexpression ssemanticvalue:Ifthecompoundexpressionreferencesonlyasin­glenon-voidnonterminal,thatnonterminal ssemanticvaluemustbetheoverallexpression svalue.
Sentence 2: atext-onlyproductionisaproductionwithadeclaredtypeofString.Additionally,itmustnotcontainassignmentstoyyValue andmayreferenceonlyothertext-onlyproductions.Theseman­ticvalueofatext-onlyproductionisthetextmatchedintheinput.text-onlyproductionseliminatetheneedforexplic­itlybuildingupstringsthroughJava sstringbuffers;onasuccess­fulmatch,theimplementationsimplycreatesthestringfromthebufferedinputcharacters.Text-onlyproductionsaretypicallyusedforrecognizingidenti.ers,keywords,andliterals.Forexample,thefollowingtext-onlyproductionfromourJavagrammarrecognizesstringliterals: String StringLiteral = ["] (EscapeSequence / !
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: DEFINITION1(CAPSULESTATEHART).Aapsule statehartSC=(S,E,A,T,P,port)onsistsof anon-empty,fnitesetSofstates,  afnitesetEofevents,  afnitesetAofations,  atransitionrelationTSxExAxS,where e/a(si,e,a,s})ETisdenotedbysi -s},and  afnitesetPofportnames.
Sentence 2: wedistinguishbetweeninternalandexternaleventsanda­tions.Externaleventsandationsareausedbyreeiving andsending,respetively,amessageviaaport.we assumeafuntionport:E+A-P+{I}assoiatingto eaheventorationxaportnameinPorthedistinguished labelIdesignatinganinternaleventoration.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: As DMP-B .ushes store buffers on every fence (not distinguish­ing between different types of fences), it implements a weak order­ing memory consistency model [2], speci.cally total store ordering (PowerPC and Sparc processor architectures have a .avor of such a model).
Sentence 2: dMP-B does not noticeably weaken the consistency model provided by modern execution stacks.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: This happens as because the number of tracked pending calls never rises above k,after the k successive dispatches, the map value must be zero, thus the k +1-th call yields a ..
Sentence 2: the MVP solution for the Ck-reduced instance is an underapproximation of the exact AIFDS solution that includes exactly those paths along which there are at most k successive dispatches to a particular procedure with a given local fact.
Relationship: reasoning