sadat2307/MSciNLI huggingface dataset:
Domain: Software and its engineering
Sentence 1: Li ai(t) = Li + t (4) Ti Moreover, according to the protocol, each type of traf­.c has a dedicated window.
Sentence 2: the service curve for each switch (SWk) is shown in (5), where the rate of the service is a factor of the network capacity C. The rate BW -I of the service curve is expressed as EC , where BW is the duration time of the dedicated window for the message, e.g., Local Synchronous Window duration time and I is the idle time that is used to prevent the overrun problem in the mentioned window, which is the size of longest packet among all messages in similar type as mi.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: It will be invoked either from the DBChangesThread s run() method (see line 12 of Figure 3) or from the Java thread library, after a thread for an Examine job is started on line 21.
Sentence 2: for purposes of our model, the run() method might be called from either a color environment including the DBChanger color or one including the DBExaminer color.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: 3.2 Applications of LDA Once an LDA model is learned on a corpus, one can use the learned probability distribution over words ft to display a list of W words, sorted by decreasing probability, for each topic t. For instance, if topic 1 has high-probability words school teach student book , one can assume this topic to be about academics.
Sentence 2: the semantic content of the entire corpus can be summarized by displaying these topics1 .
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: More importantly, the complexity of the two algorithms di.ers radically: RTA is essentially linear in the size of the program, while the points-to anal­ysis is potentially cubic in the number of statements in the intermediate representation.
Sentence 2: the techniques and re­sults from [4] cannot be directly applied to the problem of estimating the run-time progress of the points-to analysis in Spark.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: Observe that with the limitations of the mobile devices, it is not practical to run a testing tool directly on the mobile device.
Sentence 2: the solution is to provide a strategy that allows the test to be executed cross-platform, i.e., in some way, the information about the execution of a given mobile application should be collected and provided to a testing tool which analyzes and generates reports about the coverage of the executed test cases.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: Since in this experiment we are interested in how imple­mentation structure a.ects MC/DC coverage, we are inter­ested in a small test suite so that redundant test cases do not arti.cially in.ate the coverage measured on the inlined im­plementation.
Sentence 2: in our experiments, we performed test suite reduction and we used a simple greedy method.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: To determine the initial object, we use the coalgebra over algebra view, as categories of G-coalgebras have a trivial initial object: (0,0 G 0), where 0 is the initial object in the underlying category and 0 G 0 the unique arrow from it.
Sentence 2: (in,µF,fan) with fan = N. in is indeed initial.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: Instead of using the actual garbage collection times, for both cases we idealized the garbage collector by using our lower bound on the last reachable time for an object as the time of garbage collection.
Sentence 2: the bene.ts shown in the graph are independent of the garbage collection strategy (provided a trac­ing collector is used) and would apply even with a perfect tracing collector.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: Consider, for example, the following code:public class String { @Scoped StringBuilder data; int offset, length; @ScopedThis public String(@Scoped StringBuilder sb, int off, int len) { data = sb11.Our draft safety-critical Java API introduces a variant of String­Builder that lacks methods to perform mutation on the contents of the character string array.
Sentence 2: this implementation is valid as long as the StringBuilder argument resides at the same or more outer-nested scope level as the constructed String.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: Naturally, when .ltering a list, one expects to again re­ceive a list.
Sentence 2: list overrides filter to re.ne its result type covariantly.For brevity, List s subclasses, which im­plement this method, are omitted.For consistency, remove shouldhavethe same resulttype,buttheonlywaytoachieve this is by overriding it as well.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: It can be shown that f(x, y)= x/y satis.es conditions 1 and 2.
Sentence 2: given any complexity measure with an upper bound, the measure ch(m)= cx(m)/cxM (m) is actually a cohesion measure, like the ones (NRCI, ORCI, PRCI) in [6].
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: Second, one crucial step in their proof replaces a recursive syn­chronous function with an equivalent automaton constructed using Parikh s lemma [26].
Sentence 2: their analysis cannot be performed in an on-the-.y manner: the language-theoretic automaton construc­tion must be performed on the entire exploded graph which can be exponentially large in software veri.cation.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: This shows how to apply the extract method refactoring pattern directly on the code or on the model through the FiGA framework produce the same result.
Sentence 2: the developers can modify class and activity diagrams to remove and add class and activity elements, and these model changes are producing .ne grain FiGA change operators that are capable of modifying the source code by adding and removing code elements at the level of single statements.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: When a user is about to install an app onto his Android device, this app will go through our bytecode rewriting engine (BRIFT) and be rewritten into a new app, in which sensitive information .ows are monitored by the inserted bytecode instructions.
Sentence 2: when this new app is actually running on the device and is observed to send out sen­sitive information, this behavior (along with the program context) will be reported to the policy management service for decision.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: By induction on the thread evaluation relation (we only consider the most interesting cases): Case E-A: this rule is side-e.ect free so S l = S and T l = T .
Sentence 2: it su.ces to show that E[pop.ae1[v/x]] is well-typed with the same e.ect as E[u], where u equals (vl v)seq(.a ) and vl is equal to .x.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: Also indirect components of the prototype entity may be marked by "prototype parameter" attributes giving them identifiers which represent placeholders in the template structure and are translated to slot names when a prototype is instantiated.
Sentence 2: in order to reproduce the template it s only needed to denote the prototype in entity structure and "fill in the gaps" corresponding to identifiers, thus avoiding the need to manually copy the template structure.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: Namely, by using f(·) instead of prime representatives, Equation 4 becomes ai-1 ai = f(ßi-1 mod N) (this is actually performed by cut­ ting the last 14 bits of ai and comparing the result with the ai-1 SHA-256 digest of ßi-1 mod N).
Sentence 2: tverify =(o-1 + 1)(t1 + t4), (7) which is also not dependent on n. Table 2: Actual values of the complexity measures of our scheme (computed with the derived equations) for various values of o =0.1,0.125,0.3,0.5, .
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: Using simplifying axioms alone on m produces only a 0.6% speed-up.
Sentence 2: the optimizations learned from either training set lead the optimizer in the right direction, and the remaining axioms simplify the resulting expressions into the fully optimized m. These .ndings show that our technique can be e.ective at cross-training even on a small training set.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: RegionshavetwousesinZPL.Thefrstistodelarear­rays.Forexample,thefollowinglinesdelaretwoarraysof integersovereahofthepreviousregions: arAB:Rintr A2B2:R2 intr TheseonduseofregionsistoprovideindiesforZPL's arrayexpressions.Forexample,onsiderthefollowingode fragment: R A:= R2 bin A:=Indx1 A2:=2A nd R B2:= Thefrststatementassignsthevalue0toelementsofA.
Sentence 2: sineitispreededbytheregionsopeR,allelementsofA willbeinitializedto0.Thenextlineopensanewregion sopeR2,whihspeifesindiesforthetwostatementsthat itenloses.thenextassignmenttoAmodifesonly thosevalueswhoseindiesarespeifedbyR2.thosewhose rowandolumnindiesareodd.Thesevaluesaresetusing theimpliitarrayInd x1,whosevaluesequaltheirindies inthefrstdimension.Thenextstatementreplaeseah SimpleAssignmentPartialredution Transpose ZPL:RA:=B 1n1B:=+««RA RA:=B Indx2Indx1 doi=1n doi=1n doi=1n Bi1= doj=1n doj=1n doj=1n F77:Aij=Bij Aij=Bji Bi1=Bi1+Aij nddo nddo nddo nddo nddo nddo Figure2:AnexampleofthewayinwhihregionsemphasizediferentarrayaessstylesInZPLthethree statementslookquitedistint,alertingtheprogrammertothediferenesintheirparallelimplementations Byontrast,thestatementsappearmuhlessdistintinFortran valueofA2withtwieitsorrespondingvalueinA.Note thatthefnalassignmentisillegalbeauseitreferstoB2 usingindiesnotinludedinitsdefningregionR2.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: While these studies confirm that the integration of human factors in prediction models is worth studying, success in the use of some metrics was inconsistent among these studies.
Sentence 2: we decided to investigate some of these inconsistent metrics and also to propose other metrics that have not been used in the context of issue lead time prediction models (i.e., developers past performances) to confirm (or not) their effectiveness.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: In that type of imple­mentation, it is very dif.cult to implement a roll-back approachfor transactions, perhaps impossible to do so without introducinglocking overheads that would substantially perturb execution pre­dictability.
Sentence 2: we have adopted a roll-forward approach inwhich a method that is reachable by ordinary threads must com­mit its changes explicitly in an epilog.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: Based on the analysis of this newly acquired in­formation, a new generation of services and decision support systems can be realized, enabling more intelligent decisions, and ultimately a more e.cient energy system.
Sentence 2: high-performance acquisition of smart metering information from large scale distributed infrastructures is of key impor­tance for the upcoming Internet-based enterprise services and mash-up applications.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: To effect the required controller interaction, we would modify this mutator method as follows: void setObjectname (String objectname) {  this.objectname = objectname; for (Listener l : listeners) { l.notify(obj); } } Notice that method setObjectname is automatically generated.
Sentence 2: every time code re-generation takes place, this method will be created anew and any hand-made changes will be completely lost.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: The same pattern as partial FCDG (a) t ..... Sapid ..... ./ ~ ..... 0 "-~ f ..... -7 dependence analyzer _~.Tlibr ary combinatian "1~ analyzer Ceaample searcher % J  FCDG DB Figure 2: experimental system exists mostly in the datab--qe.
Sentence 2: the idiom (a) is a candidate of high level library [unction.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: The read or write speed of NFS is 15.2MB/s, GMFS is 26.9MB/s, and RAIF is 13.0MB/s when assuming that read and write are executed at the same frequency.
Sentence 2: the throughput of the reading and writing of GMFS is 2.0 times compared with RAIF, and 1.7 times compared with NFS.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: (Substitutabil­ity may be rephrased as reusability of contexts, in the sense that if some context is applicable to an object of one type then the same context is also applicable to any object of its subtype.)
Sentence 2: design concerns about inheritance and sub­typing relations are somewhat di.erent: it has to be taken into account, for inheritance, how new classes may reuse ex­isting implementation and, for subtyping, how objects may be used in client code.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: Additionally, the TraceabilityLink class includes another attribute for changing the default value of the link type (Value attribute in Figure 1), according to the value of the particular relation between two artifacts (SourceArtifact ID and TargetArtifact ID attributes in Fig­ure 1).
Sentence 2: if a value of a prioritized product requirement is assigned to a speci.c traceability link type,e.g.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: A typical bandwidth contract is based either on average band­width usage over 5 minute buckets for the month, or on the 95th percentile peak tra.c usage in 5 minute buckets for the month.
Sentence 2: depending on the speci.cs of the contract and usage in the month so far, it is possible to estimate the cost (in dollars) of sending additional bits across each link in the network.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: By MPVD, each processor will be assigned 2 high-criticality tasks as illustrated in Figure 3a.
Sentence 2: the Table I AN EX A M P L E TA S K SE T Task Ti Di .i Ci(LO) Ci(HI) ULO i UHI i t1 10 10 HI 2 3 0.2 0.3 t2 10 10 HI 2 3 0.2 0.3 t3 10 10 HI 2 3 0.2 0.3 t4 10 10 HI 2 3 0.2 0.3 t5 10 10 LO 7 7 0.7 0.7  low-criticality task t5 cannot be allocated to any of the two processors no matter how do we tune the virtual deadlines of the high-criticality tasks (since 0.2+0.2+0.7>1).
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: Each forwarding node sends its data to the .rst ancestor storage node on the path to the sink.
Sentence 2: as our simulation and other previous research show, the radius (ri) of the area covered by the nodes that are i hops or less from the sink is proportional to i.Let ' ri this ratio be c= i , we can estimate the number of ' nodes whose distances to the sink are between (t -1)cand ' tc, i.e., the nodes with depth t.Let num(t)represent the total number of the nodes whose depth values are t, 2 '2 2 '2 '2 num(t)= .p(t c-(t -1)c)= .p(2t -1)c. For a node with depth of t,let s(t) be the expected hop distance to its closest storage ancestor.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: Within an active object, each do method thatis executedin a state,is encapsulated as a TBBtaskor aTBB taskgraphdependingonthe complexity of the method andits ability to beparallelized.
Sentence 2: there arebasicallytwo sets of user-levelthreads, namelyPthreads andTBB threads.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: Speci.cally, if the number of observations at the .rst point is m, and there are n new n arrivals, the change in entropy is at most m log(2m) [2].
Sentence 2: since we know the entropy (approximately) at the end of round i, and we wish to know if it changes by at most Et/2 (the minimum change needed to change the output of the coordinator), we can set Etm ti+1 = , 2 log(2m) where m is the total number of observations made at the end of round i.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: Currently, we use the default First Come First Served (FCFS) scheduling policies for Torque/Maui, but the GRO C is empowered to set policies at its points of presence as de­sired.
Sentence 2: the application manager is able to rely on the VO s GRO C to implement policies and preferences on how its available resources might be used by different members of the community, and to adapt these policies as the resource pool size changes.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: The operation writePersistentObject associates an event stream with a location which is a path through the tree while readPersistentObject re.ects the values stored at that location into a stream.
Sentence 2: referring to the draft-saver from section 2.3: writePersistentObject(draftBox.changes(), ["draft"]); saves drafts at the top-level .le "draft".
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: In most cases, there are an in.nite number of scenarios that require following a strategy to select the appropriate tests.
Sentence 2: within the context of software development and testing, we extend the de.nition of con.rmation bias to include one or both of the following: (1) the tendency to verify software code and (2) the incompetency to apply strategies to try to fail software code.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: A mea­sure that agrees with the de.nition of the software attribute it purports to measure is said to be theoretically valid, and can be used and understood by researchers and practition­ers.
Sentence 2: only after rigorous de.nitions are available for software attributes will it be possible to run rigorous empir­ical studies that allow researchers and practitioners to assess the truthfulness of claims.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: embed t = Embed t unembed (Embed t)= t  4.5 Freshening and unbinding Unbinding is not quite as straightforward as binding.
Sentence 2: given a term Bind pt, it is only safe to call open p t if none of the binding variables of p clash with existing free variables in t. before opening, we must .rst freshen p by assigning suitably fresh names to its binders.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: The MAP for Rocchio was 0.54 with a minimum average precision of 0.46 and a max­imum of 0.66.
Sentence 2: dQM provided 3% higher MAP, but again the di.erence was not statistically signi.cant at a signi.cance level of 0.05 with the t-test.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: If every tile in the assembly were represented by a differ­ent node on the network, it would be trivial to argue that the computation were discreet; however, since a single node on the network may represent several tiles, the argument has to take into account the fact that the node is not aware of its location in the assembly, and thus it does not know the location of the bits of input.
Sentence 2: every node on the network may be aware of either some bits of the input or the solution, but not both.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: After exploring the design space of the context modeling and making a balance between sensitiv­ity, performance overhead, and robustness, we choose to model the context using parameterized source and sink pairs.
Sentence 2: our approach ful.lls all the requirements: 1) ac­tual privacy leaks are captured accurately at runtime, with the sup­port of inserted taint tracking code; 2) the performance overhead of our approach is minimal, due to the static data.ow analysis in advance and numerous optimizations that are applied to the instru­mentation code; 3) the deployment of our approach is simple, as we only rewrite the original app to enforce certain information .ow policies and no .rmware modi.cation is needed; 4) policy enforce­ment is context-aware, because the user s decisions are associated with abstract program contexts.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: They argue that the model-based pointcuts de.nitions are less likely to break upon evolution because they are no longer defined directly in terms of the actual base code structure.
Sentence 2: the fragile pointcut problem is transferred to a more conceptual (and probably more stable) level and turned into a synchronization problem between the conceptual model and the base code whenever this code evolves.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: Thisapproahhasseveralbenefts:First,itimprovesthe spatialloalityoflattietraversals,sinethe"pointers"be­inghasedarenowontiguousinmemoryratherthanstrided bythenodesize.Seond,itallowsustoeliminatethe"next­in­rowpointers"forthelattienodesduetothefatthat theyareimpliitinthememorylayout.Third,itallowsus toeliminatethealloationoffeldsthatarenotrequired,or toalloatethemonlyforthedummyorheadernodes,aswe willnowdesribe.
Sentence 2: asourompilergeneratesloopnestsandallstotheruntime libraries,itkeepstrakofwhetherthepointersandindies ineahsparsenodearerequiredbythegeneratedode.The sameisdoneforthedenseandornerdiretories.Foreah region,theompileremitsasummaryofthisinformationas showninFigured.Thissummaryisusedbytheregion's runtimeonstrutortoalloateonlythestruturesthatthe programrequires.Forexample,inNASCGandMGthe ompilerdetetsthatthesparseregionsareonlytraversed inrow­majororder.thesetupodewilleliminate thedensediretory,muhofthesparsediretory,andmost ofthefeldsforthelattieanddummynodes(Figuree,f).
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: Thus we made the access to the contracted functions as cheap as if con­tracts had not been applied.
Sentence 2: type checking with option contracts results in a reduced overhead even for type checking computationally intensive modules (on aver­age less than 15%, see section 5 for details) while perform­ing the syntactic, arity and dependencies checks that would prevent the discrepancies we discovered.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: Although concrete functional logic languages use sophis­ticated narrowing strategies to evaluate programs (Hanus 2007), narrowing derivations have a strong correspondence to rewriting derivations, i.e., each narrowing derivation usu­ally corresponds to a rewriting derivation after applying the substitutions computed by narrowing.
Sentence 2: if we approxi­mate the call patterns occurring in all rewriting derivations (as done in the following), we obtain also approximations of all possible call patterns occurring in narrowing derivations.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: The following is a sample optimal 2 × n matrix (i.e.
Sentence 2: a sample numerically best real number erasure correcting code for 2 erasures) p 3p (2n-1)p cos cos ... 2n 2n 2n G = p 3p (2n-1)p sin cos ... 2n 2n 2n Note that when n is large, 1 + cos p f(2, n) = 1 - cos n p n 2n p the condition number of the worst conditioned sub-matrix of even the numerically best real-number codes increase to in.nite approximately linearly when the number of original data items (processors) n increases.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: Preemptive transactions resolve con.icts using LCM [7] (step 2).
Sentence 2: fBLT defaults to LCM when no transaction reaches its d. If only one of the transactions is in the m set, then the non-preemptive transaction (the one in m set) aborts the other one (steps 15 to 26).
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: Finally, it s possible for developers to unwittingly ac­cept GET requests while thinking the data came from POSTs popular libraries such as Perl s CGI.PM module allow a developer to fetch a parameter without caring if it came in via a GET or POST request.
Sentence 2: pOST requests could be converted to GET by the at­tacker, and the application action will still be performed [2].
Relationship: reasoning