sadat2307/MSciNLI huggingface dataset:
Domain: Software and its engineering
Sentence 1: 7.2 Inconsistency resolution for operations Because an operation can be called on behalf of more than one Use Case, and thus can inherit permissions from more than one Use Case, applying rules such as (14) may introduce conflicts.
Sentence 2: conflict resolution must be applied to operations, as we stated it before, we assume that each positive permission of a Use Case is inherited by all its operations.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: (A.u .B.r) =A.t .B.r .A.u .A.t .B.r .B.r distributivity =A.t .B.r .B.r A.t .A.u =false =A.t .B.r absorption Note that the tag expression A.t .B.r .A.u is unsatis.able because it needs both tags A.t and A.u, whereas we can choose at most one tag from each dimension.
Sentence 2: this expression can be viewed as the zero identity to the connective .. A.t.B.r With the simpli.ed tag expression, the semantics of [p]D can be easily computed.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: When selecting a speci.c framework for the ColADA im­plementation, we took into account the three identi.ed frame­work requirements: (1) the availability of a noti.cation mech­anism, (2) the subgraph-based data structure and (3) the MVC compliance.
Sentence 2: only four frameworks in Table 1 are eligible for adding shared editing capabilities.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: (4) Here, the ordering of the computations determines if the right hand side terms u(i,j,k) of Equation 4 contain the old solution value or the already computed new value.
Sentence 2: equation 4 represents a family of Gauss-Seidel smoothers, which produce di.erent results for di.erent orderings of the computations.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: Our agent-based auction server solution combines the best features of: (i) generic software framework for automated negotiations [1]; (ii) market architecture for auction develop­ment [13]; (iii) rule-based declarative representation of auc­tion mechanisms [5]; (iv) special computing nodes available in active networks and realized by means of proxy agents [9].
Sentence 2: it provides certain advantages, including: ser­vice orientation, openness, .exibility, generality, and scala­bility (see [6] and [14] for more details on these aspects).
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: Yet, active users sometimes do choose to spend time learn­ing, because taking the time to learn may pay off in getting the task done more quickly now or in future instances of it (bene­fits/payoffs, in Attention Investment).
Sentence 2: minimalist Learning Theory emphasizes the task at hand in situations that require new learning of a tool, whereas Attention Investment more generally predicts users trade-off decisions in any kind of usage situation having to do with abstractions.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: Programmers cannot be expected to simply abandon their familiar editors, compil­ers, debuggers, and pro.lers; further, it is unreasonable to expect that all future tools will be implemented within the .ne-grained model.
Sentence 2: we believe that the aggregate system must provide support for generating external forms of aggregate artifacts suitable for use by other software de­velopment tools, and importing and extracting aggregates from output produced by such tools.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: 6.5 Combining the Techniques Whenwesoftwarepipelinethedata-parallelizedstreamgraph,weachievea13%meanspeedupoverdataparallelismalone.Thecu­mulativeeffectismostprominentwhentheapplicationinquestioncontainsstatefulcomputation;forsuchbenchmarks,thereisa45%meanspeedupoverdataparallelism.Forexample,thecombinedtechniqueachievesa69%speedupovereachindividualtechniqueforVocoder.ForChannelVocoder,FilterBank,andFM,softwarepipeliningfurthercoarsensthestreamgraphwithoutaffectingthecriticalpathwork(asestimatedstatically)andperformssplittingandjoininginparallel.Eachreducesthesynchronizationencoun­teredonthecriticalpath.
Sentence 2: thecombinedtechniquedepressestheperformanceofMPEGby6%becausetheselectivefusioncomponentofthesoftwarepipelinerfusesonesteptoofar.Inmostcircumstances,fusionwillhelptoreduceinter-coresynchronizationbyusingthelocalmemoryofthecoreforbuffering.thealgorithmdoesnotmodelthecommunicationcostsofeachfusionstep.InthecaseofMPEG,itfusestoofarandaddssynchronization.ThecombinedtechniquealsohurtsRadarascomparedtoonlysoftwarepipeliningbecausewe.sstooaggressivelyandcreatesynchronizationacrossthecriticalpath.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: cable in an equation if all its .elds are both constant and with a replicable type (so that the replication cannot cause unwanted interferences); and that the set of writable .elds is disjoint (non-overlapping) when splitting a view (to ensure a unique writer for each .eld).
Sentence 2: on a split, the set of .elds of a view is either disjoint, or non-disjoint .elds are const and replicable.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: E.ectively, the exact lab .eld at a given node memo-izes the local labels of all the nodes on the path from that node to the root of the document tree.
Sentence 2: to determine whether access to a given node is to be granted, the code needs only to con­sult the exact label, and make no further reference to other labels of other nodes.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: Not only did this cost time, but programmers also frequently made risky assumptions about the program s runtime behavior in the process, often leading to errors.
Sentence 2: instead of requiring programmers to answer these why and how questions themselves, programming environments could provide an interface for asking directly about program output and have the system automatically build a working set of task-relevant code with a precise dynamic slice [18] on the output in question.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: If a reference to this array is also stored in a local variable i.e., [xn,yn]=[*,j] andlengthof this arrayis unknown, we create a new abstract (symbolic) value representing the length of this array.
Sentence 2: we have: » « ..., ai, ...; ..., xn-1, * f+ arraylength, ..., bi, ...; ..., yn-1,i » ..., ai  vk, ...; ..., xn-1,ai  vk, = ..., bi L vk, ...; ..., yn-1,bi L vk,, where vk is a symbolic value that is not does not appear in » ..., ai, ...; ..., xn-1, * ..., bi, ...; ..., yn-1,i , and  and L are de.ned as: { q, if we can conservatively determine p<q p  q = p, otherwise { q, if we can conservatively determine p>q p L q = p, otherwise Particularly, since symbolic value vk .
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: To ensure that the doc­ument replicas at each cooperating sites can always exactly re.ect the initial intentions of each cooperating users, and can eventually arrive at the same consistent status at the end of collaborative session, whenever to synchronize a remote operation, it must take into account the impact of all the concurrent operations executed previously.
Sentence 2: precise capture of causality is crucial in real-time group editors[2, 7, 8].
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: For the second rule, there are possibly three(second-order) substitutions obtained from matching S2( ) with k1[k2[ ]]: k1 = ,k2 = S2( ), k1 = S( ),k2 = S( ), and k1 = S2( ),k2 = .
Sentence 2: recall that k1 and k2 are de.ned by k1 = evAc(x1) and k2 = evAc(x2),and x1 and x2 come fromthe patternAdd(x1,x2).wegeneratethefollowing rules.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: The caches at these sites already exist (were introduced by the devel­oper).
Sentence 2: we (1) ran the tool with caches disabled at all sites to produce an estimate for each site, and (2) for each site ran the original (uninstrumented) program, with the cache disabled .rst and then enabled, to determine the actual savings in .nal tenured heap due to the cache at that site.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: Since the observation likelihood P(o)is .xed across all candidate locations, the decision rule becomes: l = argmax [P(o|l)P(l)].
Sentence 2: (2) l.L it remains to estimate the class-conditional prob­ability, P(o|l), and the prior probability, P(l), for each can­didate location l .
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: Byperforming this rescheduling,thedependence chains that produce many of the latencies identi.ed in the JVM Instruction iadd arebroken(seeFigure1).
Sentence 2: the compiler is given room to produce improved scheduled code and thedispatchphase of theinstruction cycle canbeissued without a data dependant delay.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: One result of this extension is that strict enforcement policies reduce the size of a layer s run because there are fewer possible operations to assess.
Sentence 2: a layer Nt s con.guration at time t is de.ned as a tuple (E,p,H,Rt ), where E and p are the current entities (code or programs running in the layer) and policies, respectively.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: A Systematic Method for Generating Quality Requirements Spectrum Shunichi Suzuki Tomonori Sato Masaaki Tanigawa Shinshu University, Japan Shinshu University, Japan Shinshu University, Japan Akira Osada Haruhiko Kaiya Kenji Kaijiri Shinshu University, Japan Shinshu University and Shinshu University, Japan GRACE Center NII, Japan http://www.cs.shinshu-u.ac.jp/ kaiya/ ABSTRACT Spectrum analysis for quality requirements is useful for measuring and tracking them, but current spectrum analysis largely depends on expertise of each analyst.
Sentence 2: it takes a lot of efforts to perform the analysis and is hard to reuse experiences for such anal­ysis.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: Batista et al [2] state that aspects are not differentfrom other components in the system and that thedistinction between aspects and regular componentsis in the way aspects compose with the rest of thesystem the scope of the composition is broad andaffects multiple components or multiple architecturalelements.
Sentence 2: it is not necessary to introduce another abstraction at the architecture level to represent an aspect.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: For a given MS/MC pair and a media content item, it is difficult to nominate the canonical set of services that are required in an a priori fashion since the MediaPorts that are available to perform a given required service may introduce dependencies that also need to be accounted for.
Sentence 2: the ability to avoid explicit management of MediaPort dependencies serves as another motivation for a peer-to-peer approach to service composition whereby each MediaPort on a given service path is directly responsible for choosing its successors on the path.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: ||Xw1 -Xw2 ||.8 ||Xw1 - Xw2 || Moreover, as in the proof for Theorem 2-(ii), the distances ||Xu - Xw1 || and ||Xw2 - Xv|| are .nite, and T(Xu,Xw1 ) < 8 and T(Xw2 ,Xv) < 8 with probability 1.
Sentence 2: we have T(Xu,Xv) T(Xw1 ,Xw2 ) lim = lim , ||Xu-Xv||.8 ||Xu - Xv|| ||Xw1 -Xw2 ||.8 ||Xw1 - Xw2 || so that (32) holds.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: [· ] min Hence [·]T only yields .-term-graphs without sharing of S-ver­tices, and therefore its image cannot be all of Teag.
Sentence 2: we cannot hope to de.ne a readback function rb with respect to min ·that has the desired property (P3), because that requires that []T the image of the semantics is Teag in its entirety.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: For tra.c networks with two sorts, the velocity dimension is unit distance/unit time, e.g., kilo­meter/hour, and the density dimension is unit mass/unit distance, e.g., ton/kilometer.
Sentence 2: multiplying a velocity v by a density d produces a quantity v * d, namely a .ow, which is measured in unit mass/unit time, e.g., ton/hour.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: For example, a graph type may refer to the types of edges and vertices, which are used in most graph operations.
Sentence 2: the concept Graph used to express generic graph algorithms may require that a graph type name its edge and vertex types, so that the concept can refer to these types in its signatures: concept Graph { typename edge; typename vertex; ... edge .nd edge(vertex u, vertex v, const G&#38; g); }; Associated types are are place-holders for actual types, that is, con­cept they are implicit parameters to the concept.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: http://dx.doi.org/10.1145/2633628.2633635 Central to this technique is the idea to represent a recursive data type as a two-level type (Sheard and Pasalic 2004) Fix f consisting of a signature functor f and a knot-tying .xpoint constructor Fix .
Sentence 2: modularity over the data type Fix f can be ex­pressed in terms of the signature functor f .
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: Foralli, p_< ~ <-ft. Then for A = 1 - ~ fi, we have that 2ai  -]: <- e+ + p_ Zx Proof: If p -= ~ = p then fi = ~ p for all/, and hence A = 1 - ~.
Sentence 2: -~ + p- p-~ + pfiA = 2p-p2 + p2 (1- ~) = p .
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: CMP Configuration Calling Location Param Threshold L2 Size # Cores File Line .... .... .... .... .... .... .... .... .... .... (b) Table for implementing the Parallelize function grouping.
Sentence 2: compared to the right bar, an indi­vidual task of the middle case may be less e.cient because it still contains the parallel code (e.g., parallel merging).
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: M - d0 + g2/w(0) E When M is large, the above simpli.es to µg2tE M ~ M ln .
Sentence 2: w(0) E Fraction of total number of peers 0.9 0.8 0.7 0.6 0.5 0.4 0.3 0.2 0.1 0  0 100 200 300 400 500 600 0 100 200 300 400 500 600 Time (days) Time (days) (a)g =25 (b)g=50 Figure 8: Proliferation of pollution for Version Centric model: Recovery Hence, MM tE = O( ln ) (19) µE Comparing the above with (13), we note the additional factor M. From equations (14) and (16) we note that here the rate of growth of polluted versions is proportional to the rate of growth of good copies, whereas the number of good version stays at the constant g. as time goes by, it becomes increasingly more di.cult to get a good copy.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: Thus for every data constructor of every GADT there is an appropriate Kan extension which can be used to trade that data constructor for one based on existentials and the Eql GADT, and from which an initial algebra semantics for the original GADT can be derived.
Sentence 2: the proliferation of different codings of Kan extensions, which seems a drawback at .rst, simply re.ects the fact that Haskell does not have a proper polymorphic system of kinds.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: At the end, we are left with a formula f(X " ) where X " denotes the set of all remaining symbolic variables xi " .X for which there SC are no concretization constraints in ALT (pcw ).
Sentence 2: we know that all expressions of the form e(xi" ) in f(X " ) are in T, that they did not introduce imprecision in symbolic execution, and that they are represented in the exact same way in ALT (pc SC).
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: Since the taken path of the diverge branch candidate at A always reaches C before it reaches D, even if both C and D are selected as CFM points, dynamic predication would always stop at C. D would never be reached by both dynamically-predicated paths of the branch at A in dpred-mode, and thus choosing D as a CFM point does not provide any bene.t if C is chosen as a CFM point.
Sentence 2: the compiler should choose either C or D as a CFM point, but not both.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: As a result, a static .ow graph that iTarget constructs can be con­sidered as a projection from an execution .ow graph: invocations of the same functions are merged into single operation nodes, and variables that may alias are merged into single value nodes.
Sentence 2: the approximation is sound, as a cut in a static .ow graph is easily translated to one in a corresponding execution .ow graph.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: The routing .exibilities of connections [[ a, a ' ]] , [[ b, b ' ]] , [[ c, c ' ]] , [[ d, d ' ]] , and [[ e, e ' ]] are 4, 1, 10, 6, and 1, respectively.
Sentence 2: the order in which the connections are to be routed is [[ b, b ' ]] , [[ e, e ' ]] , [[ a, a ' ]] , [[ d, d ' ]] , and [[ c, c ' ]] .
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: 4.4 User interface When a VM is created, it is a high-throughput VM by default, and the user interface should be provided to the system administrator, so that the type of a VM can be changed by the system administrator according to the characteristic of the workload in the VM.
Sentence 2: we added new option xm sched-pe into the Xen management tool, that is xm.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: Unlike many pre­vious approaches, our AVIO does not require programmers to provide any speci.cations about synchronization primitives or atomic region assumptions.
Sentence 2: our idea applies for not only multi-threaded programs using standard lock-based syn­chronization, but also those using application-speci.c synchro­nizations as well as future applications that are written in trans­actional memory models.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: This java actor runs on the local host and therefore cre­ates the list of .les to be archived at once on the local host (this is why the SshDirectoryListing emits size information for the .les besides their names).
Sentence 2: the Archiver takes care of copying the list to the remote machine and the execution of the archive command on the list remotely.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: These roles are aggregated by type and proposed to the developer as a list of query re.nements: //s : COMP UT E//idf : FILE (3) //s : CLEAR//idf : FILE (4) //s : SELECT//idf : FILE (5) //s : CALL METHOD//idf : FILE (6) //s : LOOP//idf : FILE (7) In our interviews with developers, we discovered that state­ments are typical targets of search while conducting code reviews or searches for examples.
Sentence 2: the .rst list of proposals is restricted to statements.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: Speci.cally, anynode a that waited at the barrier would have received all messages from another node bthat were sent be­fore breached line 12 and that were received before all nodes reached line 12.
Sentence 2: mDB creates thehypothetical barrier by updating the state of the logically synchronous view at line 12 with all such cache update messages.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: The authors of Livecode­lab began with JavaScript as the end-user language, mov­ing to Co.eeScript (an expressive language that compiles to JavaScript) and .nally to developing their own custom DSL.
Sentence 2: instead of seeking greater expressivity through abstraction, Livecodelab s developers focused on designing a language customized to their needs.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: Once, the generated proxy is installed, it publishes (4) a UPnP printer device which is rei.ed (5) and exported (6) by the UPnP BD [1] as a real de­ vice on the network.
Sentence 2: the UPnP application interacts (7) with the exported virtual device and the invocations are transfered to the proxy by the UPnP BD.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: In Figure 1, points A, B, C, D, E and F constitute the convex hull.
Sentence 2: a triangu­lation of a set of all points in P ..2 is a set of triangles Figure 1: Sample triangulation and use of CCW predicate: F, A, E turn is counter-clockwise thus, CCW (F, A, E) > 0 T whose vertices are elements of P .
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: For sim­plicity, let us assume that, in the original layout (a), all the accesses to the highlighted data elements (grey boxes), x, y, u and v, incur last level cache misses.1 In this layout, x and y are mapped to di.erent rows.
Sentence 2: if an access to x and an access to y incur successive cache misses (x is ac­cessed .rst), then the access to y will also incur a row-bu.er miss.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: Except for the contiguous allocation, the other two would scatter the cached object all over the UNIFIED file, and then decelerate the object access.
Sentence 2: we decide to use the contiguous allocation in our method From Section 2, we know that the multi-R/W scheme used in Squid is beneficial for the machines equipped with less memory, but it degrades the proxy performance due to many system calls.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: As the algorithm descends into the loop body, x is bound to an adaptive value at choice c, and the CHOICE rule marks x as be­ing in.uenced by that choice (I is extended to re.ect this).
Sentence 2: next, we descend into the if statement and apply the IF rule, causing A to be extended to include c since that choice in.uences the guard expression x. when we reach the following assign­ment statement that increments i, the A set contains the choice c as an in.uence, which makes the new de.nition of i adaptive (in.u­enced by c).
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: To save extra space, we apply the technique described below that typically reduces the size of a stub from several hun­dredcharactersto under50.Akey insightisthatJavaScriptisa dynamic language that allows function introduction at runtime; we do not have to transfer complete stubs over the network as long as we can generate them on the client.
Sentence 2: we parameterize the text of each stub with its name and argument names and then intro­duce a helper function exp(function_name, argument_names) to generate the stub body at runtime.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: Unlike the earlier algorithm, our algorithm works directly on points in Euclidean space without embeddings.
Sentence 2: it has the following advantages over the previous algorithm: p( For the l2norm, its query time is O(dn)logn), where p()1/for E(1,10](the inequality is strict, see Fig­ure 1(b)).
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: When given an argument xss of type list(list(T,I2),I1), the function concat returns a pair (pf , res) such that pf is a proof value of prop MUL(I1,I2,I3) for some integer I3 and res is a list of type list(T,I3).
Sentence 2: pf acts as a witness to certify that the length of res is I1 * I2.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: For example, take the assumption assume(MethodDoesNotModify, Any Field, C::f()) This assumption forces IOpt to assume that the analysis success for any .eld and C::f().
Sentence 2: all of the property invocations property (MethodDoesNotModify, T::x, C::f ()) property (MethodDoesNotModify, G::y, C::f ()) ... property(MethodDoesNotModify,subtypesObject::x, C::f()) will succeed.
Relationship: reasoning