sadat2307/MSciNLI huggingface dataset:
Domain: Software and its engineering
Sentence 1: Since KCCA provides two projection vectors that maximizes correlation between the control and observational variables, most normal processes would have a relatively high correlation between the two sets of vari­ables.
Sentence 2: we can set a threshold on the deviation of correlation from1(which correspondstoperfectly corre­lated) to decide whether a process is normal or abnormal.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: Unfortunately, analogous to the stateless nature of HTTP, MVC-based web application frameworks lack mech­anisms for tracking state.
Sentence 2: each request is routed completely independentlyofhistory,basedpurelyon thecontentof the current request.whiletheMVCframework vastly im­proves web application organization and control .ow man­agement,itis lefttothedevelopertoimplement any stateful behavior that may be desired.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: Copyright 2006 ACM 1-59593-108-2/06/0004 $5.00.
Sentence 2: 1. context Department inv: self.employee -> forAll (e| e.salary>self.minSalary) 2. context Employee inv: self.salary>self.employer.minSalary 3. context Department inv: self.employee -> select(e| e.salarysize()=0  D epart ment 1 WorksIn * Em ployee nam e : str ing minSalary: M oney nam e : str in g salar y: Mo n ey employer employ ee Figure 1.1 Example Conceptual Schema only when designers are aware of all these different alternatives, they can choose the best definition for the IC.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: log otherwise pi It is interesting to note that the number c of colluders is not (j) involved at the calculation of the score S.It is because i  we assume yi = ./c with 0 = .
Sentence 2: = c. if the pirated codeword is produced only by the averaging attack, the optimal tracing algorithm is easily performed without the knowledge of c. In a noisy case, the score Si (j) is calculated from the dis­torted codeword yi * .
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: 4.2 BPEL engine We have built a BPEL engine as an interpretor based on a SmartTools semantic analyser.
Sentence 2: it has the same join points but the requirements for its DSAL are slightly di.erent: the pointcut language should be .ner grain as well as independant from the implementation, and aspects may need to share information, though this means that they are interdependent.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: dk = E(i) + d + pk =1 dp Then, for each instrumental event j = i, we compute the subsequence sj of seq such that the date of electronic actions is between the date of j and the date of j + 1: sj = [(dj0 xj0 ) ... (dj1 xj1 )] where dj0-1 < E(j) = dj0 = dj1 < E(j + 1) = dj1+1 Each subsequence sj is associated to the corresponding event j instead of i.
Sentence 2: we need to update de­lays such that the dates of the electronic actions remain the same: dj' l = djl - E (j).
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: is the logical conjunction symbol, and A0, , An are atomic formulas (logic facts) of the form: predicate_symbol(Var_1, Var_2, , Var_N) (form 2) where the positional parameters Var_1, ,Var_N of the above predicate predicate_symbol are either variable names (in the case of the back-end inference rules), or constants (in the case of the ITF table statements) [3].
Sentence 2: the input programs are formally transformed, into a set of provably-correct hardware accelerators (or coprocessors ).
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: As described in Section 4.2, tm19 and tm20 have the same size and complexity as tm1, but the maximum search time values for tm19 and tm20 are 5 and 150 time units, respectively, instead of 50 in tm1.
Sentence 2: comparing GA results for these three TMs should reveal the impact of variations in maximum search time.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: */) { state_ = 4; 29 30 } else { state_ = 5; 31 32 } break; 33 case 4: 34 35 /* send message m3 */ 36 // recv message m4 37 ACLMessage msg = myAgent.receive(); 38 Object content = msg.getContent(); 39 40 /* handle the content */ 41 state_ = 3; 42 break; 43 case 5: 44 /* send message m5 */ 45 break; 46 case 6: 47 state_ = 0; 48 break; 49 case 7: 50 /* send message m7 */ 51 isTerminate_ = true; 52 break; 53 54 55 } } public boolean done() { 56 return isTerminate_; 57 585 } } Figure 2: An implementation of Role1 in JADE to modify both of them if some changes to the message exchanges are to be applied.
Sentence 2: maintainability of interactions decreases.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: With static scheduling, where every thread must perform the same amount of work, performance varies from 11.4x speedup with the high tax rate to 8.8x speedup with a low tax rate, because of load imbalance while the N-Queen is running.
Sentence 2: the use of tax must consider both the bene.t to sequential programs and the cost to the parallel programs that are preempted.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: 4.1 Basic WUIs In order to support the construction of WUIs for a large class of applications, we only require that the application program supplies the WUI with the current state of the data and an operation to store the data modi.ed by the user.
Sentence 2: the main operation to construct a WUI could have the type signature (remember that dynamic web pages are of type IO HtmlForm) mainWUI :: a -> (a -> IO HtmlForm) -> IO HtmlForm so that an expression of the form (mainWUI dstore) evaluates to a web page containing an editor that shows the current data d and executes (store d') when the user submits the modi.ed data d'.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: Taking into account these assumptions, the probability that all n assignments in the sample are contained in the lower (100 - P )% of the population is computed as: P (AI)=( 100-P )n. As A and 100 AI are opposite events, the sum of probabilities that they occur is equal to 1: P (A)+ P (AI)=1.
Sentence 2: the probability of the event A can be computed as: I 100-P n P (A)=1 - P (A)=1 - 100 We observe that the probability that a sample of random task assignments contains at least one of the P % of the best-performing assignment is independent of the population size (i.e.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: When d =3, the 3-0, 1-2, and 0-3 cases all entail recursive calls, but only the 2-1 case causes a defective item to be deferred.
Sentence 2: 3p2q 2 D3 = p3D3 +3pq +q3D3 = = p. 1 - p3 - q3 For d = 4, the 4-0 and 0-4 cases both entail recursive calls, the 3-1 case entails a 3-defective recursive call and 1 deferral, the 2­2 case entails 2 deferrals, and the 1-3 case entails a 3-defective recursive call.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: At a particular program statement s, the predicate transparent(E)should be true iff the value of the pro­gram expression in the meta-variable E cannot be affected by s.We take the obvious (but slightly conservative) approach of de.ning this to mean that none of the program variables occurring in the expression are changed by s, so for example a :=3 is transparent to b +c, but not to a +c (ignoring aliasing effects).
Sentence 2: for the predicate transparent(E)and the statement a :=3, we need to gen­erate a constraint for E that allows it to take on all possible program expressions that do not contain a.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: 2.2 Nonuniform Quantization Schemes The .nite word-length of the soft information directly de­cides the size of memory, which plays a role to store the intrinsic and extrinsic messages and dominantly determines the overall implementation area in the partially parallel LDPC decoder.
Sentence 2: the reduction of .nite word-length with­out signi.cant performance loss can decrease the hardware size which includes the computation logic and the memory banks.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: To meet this need, we aim to provide a novel architecture mPat, which is uniquely built upon real-time multi-source feeds to abstract human mobility for real-world applica­tions.
Sentence 2: for the .rst time, mPat is able to provide insights on not only where and when but also how (e.g., by bus) almost all urban residents move.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: a thread, forwards a Start signal to its subtrees before starting its own computation, and forwards a Done signal to its parent node only after receiving all the subtrees Done signals and completing its own task.
Sentence 2: the implicit barrier at the end of OpenMP work-sharing constructs takes a time corresponding to the worst-case propagation delay through the tree, which is logarithmic in the number of threads.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: Figure 6: Consistency Agent Migration Time on Concurrent User Number  Figure 7: Consistency Agent Migration Time on Entity Number Our experiments show that Consistency Agent migration does not affect the real-time interaction of the CVE users, and so do other types of agents.
Sentence 2: our proposed grid-based mobile agent approach will improve the scalability of LCVE without compromising its performance.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: Figure 2 exempli.es the concept.
Sentence 2: a .rst strand indicates that a change of the Communicator whichis usedby the Tra­deComponent canleadtochanges in the performance which can be measured via the sensor PerfS at the interface PI.A second strand indicates that a change of the Communicator which is used by the TradeComponent canleadtochanges in the communication costs which can be measured via the sen­sor CostS at the interface CostI.the controller ComS­elect is able to manipulate performance and communication costs by exchanging the Communicator which is used by the TradeComponent.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: We have observed that the Internet delay space displays special structural and statistical characteristics in that it ad­heres to a power-law that extends over a signi.cant range of Internet distances, namely the intra-continental distances.
Sentence 2: its dimensionality can be characterized using frac­tal measures, sensitive to non-linear as well as linear struc­tures in the delay space.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: Moving more than one page Whenatrapoccurs,itimposessomeoverhead.Thus,itmakessensetomovemorethanonepageineachtrap.Wetypicallymovedeightpagespertrap.Thisopti­mizationalsoreducesthespaceoverheadofthestatus-table andthe.rst-object table.
Sentence 2: double mapping to-virtual-space in the beginning Thetraprou­tineneedstotouchaprotectedpagewithoutliftingtheprotection.asecondvirtualmappingoftheheapisrequired,whichisnotprotectedandisavailableforusebythetraproutine.Toreducethetraptime,weDoubleMaptheentireto-virtual-space toathirdvirtualspacewhencompactionbegins.Ofcourse,thismappingcanberunconcurrentlywiththeprogramrun.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: n .4. ii.1 The reason is that cycle 1 and cycle 2 cannot provide protection for same span, cycle 2 and 3 can t either, so cycle 2,3 and cycle 1,2 can share spare units on span 3-5.
Sentence 2: we can anticipate that the shared-p-cycles design can achieve better efficiency than the conventional p-cycles design.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: We denote the set of generators at, a., u., v., w. de.ned above by C. By the product formulas of Table 2, every element of C is a linear combination of 2-long products from A and, conversely, every element of A is in (C).
Sentence 2: in order to prove that ((A)) is 2-closed and to give a full description of the algebra operations, it is enough to show that the product of any two elements of C remains in (C)and to compute the product and scalar product of any two elements of C. Step 3.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: In case, the j-th log-likelihood ratio does have the absolute minimum value of all K inputs, the minimum of the K inputs except the j-th one equals the second-to-minimum value.
Sentence 2: on the K input LLRs to a given check node, we take the minima of all numbers except one, where we first omit the first one, then the second one, then the third one, etcetera in a check node the set of minima of K values, except the j-th one, can be stored using only 3 values (a dataset) instead of K=30: The overall minimum value,  The overall one-but-minimum value,  The index j for which the minimum input value occurs.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: To avoid this exponential blow-up, we impose a total order on abstract locations such that if ai and aj are aliases, they both point to a common location *ak such that ak is the least element in the alias partition class of ai and aj .
Sentence 2: in the init heap rule of Figure 8, ai points to *ak where k = i under constraint: (*ai = *aj ) .
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: This is, however, incon­sistent with the relation obtained by looking at column two in the FAS, i.e., the relation obtained by this column is s1,2 = 3s2,2/2.
Sentence 2: the two vector sets are incompatible, which of course is possible (and also highly likely) since the values in the vector sets are obtained from (expert) opinions and experiences.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: Whenwelook attheBGPinformationavailableinthe .ows, a very large number of pre.xes are announced from multi­ple ISP-X PoPs.
Sentence 2: in many cases ISP-X selects an exit PoP from a list of PoPs where the destination pre­.x is announced and in general it prefers the PoP that is geographically closest to the entry PoP.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: The di.erence is that in interval Ii, we assume device Di is transitioned while in interval Ii-1 we assume Di is not transitioned.
Sentence 2: this totally covers at most 2mcases were Ropt = d-Bi,i=1 ...m.Fur­ther, we also evaluate the energy consumption when Ropt = c and Ropt = d. an implication of Corollary 1 is that there are at most 2m+ 2 cases that need to be examined to determine the optimal solution.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: A, and is the empty set otherwise.
Sentence 2: on the range (1.5, 2), we have µout((1.5, 2)) = µ((0.5, 1.0) n [0.5, 8)) + µ(Ø n (-8, 0.5)) = µ((0.5, 1.0)) = 0.05 and on the range (9, 12), we have µout((9, 12)) = µ((8, 11) n [0.5, 8)) + µ(Rn (-8, 0.5)) = µ((8, 11)) + µ((-8, 0.5)) = 0.25 i.e.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: Since the first eight bits extracted from the final codestream whose decimal value equals 255, which is an un-embeddable index value, this means that it is transformed from an embeddable index value with secret digits embedded.
Sentence 2: the decoding procedure falls into Case 2, so the original index value 0 is reversed, and the base-4 secret digit 0 is extracted by mapping Figure 4.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: [1] Figure 4: Playlist aspect When implementing CreditsAspect, the programmer as­sumes a one-to-one relation between the playing of a song and its purchase.
Sentence 2: the compositional intentions for its advice are the following: Ignored: NoProceed() After: MultiProceed() These compositional intentions mean that the advice is assumed to not be executed if the join point is ignored by another advice (.rst line), and for each execution of the join point the advice is assumed to be executed as well (second line).
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: However, it differs from them in three aspects: i) lock acquisition and actual writes are shifted to commit time; ii) the validation proce­dure is modi.ed to satisfy the new transactional require­ments; and iii) the necessary information is saved in local semantic read-sets and write-sets.
Sentence 2: oTB gains the following bene.ts over pessimistic boosting.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: Finally, the Tightness Coe.cient Tij of nodes ui and uj isde.ned as the 1 http://wiki.limewire.org/index.php?title=Overview ratio of arcs that their neighbors have in common and the maximum numberoflinksbetweentheir neighbors; thegoal of this parameter is exploiting the high average value of the clustering coe.cientinthe a.nity network,in ordertogive priority to items related to most representative neighbors.
Sentence 2: relevance reli(sk) is computed as a function of Tij, rate(uj,sk)and A.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: Since each sweep of u. costs 2. logN moves, the total number of moves is: h X N.(h +1, 1)2. log N. .=0 This quantity is the sum of the sweep costs at each level, until the virtual node needs its .rst rebalance.
Sentence 2: the amortized number of element moves is h X 1 N.(h +1, 1)2. log N. (9) N .=0 PROOF OF THEOREM 3: We bound N.(.,1), the number of sweeps of the leftmost child u. at level .
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: We start by considering j1 and showing that aj1 = bsl i .
Sentence 2: let us assume that j1 was assigned in phase p, for some p,1 = p = k. If aj1 exceeds the value b· sl i then the a-values for all the remaining l- 1 clients also exceed b· sl i by the timeAlgorithm3 entersphase p. the total payment from S(i)exceeds b· si.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: In essence, Smalltalk and Java share the common object-oriented execution model where objects interoperate by sending messages.
Sentence 2: lan­guage interoperability can best be established at this level, Figure 1: Smalltalk interacts with Java through the languages FFI interfaces with C. buf := JavaWorld.java.io.BufferedReader new_Reader: (JavaWorld.java.io.FileReader new_String: sometext.txt ).
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: In his classic paper on the essence and accidents of software engineering, Brooks stated that the hardest single part of building a sofware system is deciding precisely what to build...
Sentence 2: the most important function that the software builder performs for the client is the iterative extraction and re.nement of the Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: Hence, the fastest agents collect at least M ·|F| uncollected values during the .rst cvmin events (rather than during the .rst 2 · cvmin events).
Sentence 2: after X := 2 · cvmin ·r(n-|F|-1) l- cvmin events (denoted M·|F|by a segment e'), all the values are collected.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: )(Ol[t - 1] - µl[t - 1]) , (12) By repeated application of (12) we get Ol[t] - µl[t] = (1 - .
Sentence 2: )t (Ol[0] - µl[0]) (13) for a given E> 0, if Ol[0] - µl[0] t> log1/(1-.)
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: x)) The idea behind these de.nitions is to implement each state monad of the type ST (a,t) as a function that takes a witness and the region a as arguments and returns a witness, the region a, and a value of the type t. It is easy to see that if a state monad program is well-typed by the monadic type system, then it is also well-typed with our type system using the above de.nitions for the monadic primitives.
Sentence 2: our approach is more expressive than monads.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: Resource Discovery Framework Self-Chord Routing Information and LRU Policy Metadata Snapshots in Grid Communities Type of Grid Peer-to-Peer Hierarchical Hierarchical Ant travels on a graph Yes, moves along a logical ring Yes, moves on a hierarchical tree Yes, moves on a hierarchical tree Ant memory No Yes Yes Ant start state Yes Yes Yes Ant termination state Yes Yes Yes Ant transition rules Yes Yes Yes Ant probabilistic decision rule No No No Use of pheromones No No Yes, by way of Self-led Critical Friends Pheromone decay No No No Mobility Yes Yes Yes Autonomy Yes Yes Yes Communication Limited, with nodes only Limited, with nodes and LRU Limited, with nodes and metadata snapshots Adaptation Yes Yes Yes Persistence No No No Local interaction Limited, with nodes only Limited, with nodes and LRU Limited, with nodes and metadata snapshots in this method suggests that the concept of stigmergy is not adhered to.
Sentence 2: indirect communications between ants are weak and there is no exploitation of global knowledge.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: In contrast, Velodrome (our prototype checker for Java) detects 133 non-atomic methods (and misses the remaining 21 by not generalizing from the observed traces), but produces zero false alarms.
Sentence 2: in the termi­nology of information retrieval, Velodrome provides slightly less recall but vastly increased precision a trade-off that we believe is quite appropriate for all but the most safety-critical applications.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: For the literal part, f(x) = in the example, we had to choose a language that a humanwould easily type, and LATEX looked like the only reason­able choice: MathML was ruled out by its verbosity.
Sentence 2: although we de.ned few quotation kinds for documents, anadded complexity came from more levels of possible nesting,as a consequence of three input kinds that can contribute totexts in documents: literal strings, playing a role akin to the character data (CDATA) of XML, to write natural-language text;  literal LATEX code fragments, which appear as escapesfrom literal strings to denote a mathematical formula;  symbolic code fragments, which appear as escapes fromLATEX code to denote a symbolic calculation whose resulthas to be displayed.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: Invisible watermarking (or simply watermarking) has become a well-accepted technique for protecting digital im­ages and other forms of multimedia content, and the search for better watermarking methods remains an extremely ac­tive area of research [4, 5, 9, 14, 18, 22].
Sentence 2: as satellite imagery and GIS have found ever increasing commercial ap­plicability, watermarking is invariably being considered for use in these applications.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: A void result (Ø) is assigned to the op­posite port automatically.
Sentence 2: the then and the else output ports receive a nested array with the same struc­ture and size, as de.ned by the input nesting levels, ports depths and iteration strategies used, but complementary in the sense that if a value is available in one of the ouput, the corresponding item is empty in the other output and vice versa.
Relationship: reasoning