sadat2307/MSciNLI huggingface dataset:
Domain: Software and its engineering
Sentence 1: The dilemma of this groundless and strong division between the domain of persistence and the .eld of programming could be abandoned by institution­alizing persistence in the programming language.
Sentence 2: with all of these methods, a program­mer has to endure the considerable work of eventually facilitating persistence, be it by programming the necessary interaction with an external system or designing the software for a special per­sistence framework.
Relationship: neutral
Domain: Software and its engineering
Sentence 1: In this paper, we identify the challenges in deploying CachePortal to real world e-commerce J2EE-based Web applications.
Sentence 2: for a common network condition in which the round trip time is around 400 ms, the system with 90% hit rate is scaled up to for more than 20 times as pointed out in Figure 16 and in the second row of Table 1.
Relationship: neutral
Domain: Software and its engineering
Sentence 1: The rule seen at the bottom of the screenshot, for ex­ample, indicates what happens when the event b pressed occurs, Display is either date or time, Update has one of the values listed, and so on for the other variables ( * being don t care ): In this case, the variable Update changes to none but most of the other variables stay the same ( = ).
Sentence 2: the shaded cells progress diagonally down a constraint table.
Relationship: neutral
Domain: Software and its engineering
Sentence 1: The currently popular choices Scala, Clojure, Kotlin, Groovy all are explicitly languages for programming the Java platform, and the platform shines through in day-to-day program­ming.
Sentence 2: while there is some overlap be­tween the monadic combinators and CML s combinators, providing both paradigms in a single language provides some useful syner­gies: The Concurrent ML substrate is implemented on top of the monadic substrate.
Relationship: neutral
Domain: Software and its engineering
Sentence 1: It is then surprising that little support has emerged for these often-used patterns, collection and dissemination.
Sentence 2: we also provide a templated inter­face, ProducerSimple that achieves this goal when the ADU is known in advance at compile time and does not vary in size from one invocation of give() to another: interface ProducerSimple { command result_t get(Adu_t* buf, bool first, bool last); event Adu_t* give(Adu_t* buf, bool first, bool last); } Here, the interface ProducerSimple takes a type param­eter Adu t de.ned at compile time.
Relationship: neutral
Domain: Software and its engineering
Sentence 1: Our results show that execution omission errors can be easily captured with the proposed techniques.
Sentence 2: since x@4, the reaching de.nition of use x@6, occurs after predicate p@1, de.nition x@2 would get killed even if p@1 were evaluated to T. p@1T is not in PD(x@6).
Relationship: neutral
Domain: Software and its engineering
Sentence 1: Previous languages supporting these forms of extensibility either restrict their usage to a limited set of programming idioms that can be modularly typechecked (and modularly compiled) or simply forego modular typechecking altogether.
Sentence 2: second, the RMJ compiler must record information in the resulting class .les to tell the RMJ class loader what checks to perform when each class is loaded.
Relationship: neutral
Domain: Software and its engineering
Sentence 1: Considernextallagents,andtheommonrefnementof alli­equivalenelasses,i1n.Thatis,twoprie vetorsareequivalentiftheyarei­equivalentforalli;in Z otherwords,thesetofoptimainZ+forthesevetorsare thesameforallagents.Theselassesareinturnpolytopal subdivisionsofthed­orthantbyhyperplanesnormaltothe Z vetors{ei-Z:i1n;ZEZ+},nMhyperplanesin toto.HenethereareO(nM)suhsubdivisions,andin fattheyanbeonstrutedinNC[6].
Sentence 2: [5]L.Hurwiz,"OnInformationDeentralizationand EÆienyinResourseAlloationMehanism",Studies inMathematialEonomis(S.Reiter,ed.),pp.
Relationship: neutral
Domain: Software and its engineering
Sentence 1: To cope with this aspect we decided to exploit lit­erature results, in particular all those results (e.g., [10, 27]) that have shown how the overhead directly imputable to log/restore can signi.cantly vary for variations of the log interval around small values (e.g., a few units).
Sentence 2: an Evolutionary Algorithm to Optimize Log/Restore Operations within Optimistic Simulation Platforms  Alessandro Pellegrini Roberto Vitali Francesco Quaglia pellegrini@dis.uniroma1.it vitali@dis.uniroma1.it quaglia@dis.uniroma1.it DIS, Sapienza, Università di Roma ABSTRACT In this work we address state recoverability in advanced op­timistic simulation systems by proposing an evolutionary al­gorithm to optimize at run-time the parameters associated with state log/restore activities.
Relationship: neutral
Domain: Software and its engineering
Sentence 1: in open STDIN, "words"; let count = ref 0 in while () { if (/.aaa*./o and not /.ooo*./o) { Shtream.iter {| incr count |} (run_source begin ++$count; from_file "words" -| } grep (fun str -> } Str.string_match aaastar str 0) -| grep (fun str -> print " $countn"; not (Str.string_match ooostar str 0)) end); print_endline (" " ^ string_of_int (!count)) (a) perl-int (b) shcaml-int stringbuf buf; (define .aaa*.
Sentence 2: shcaml s Proc module, for example, provides easier management of subprocesses.
Relationship: neutral
Domain: Software and its engineering
Sentence 1: Technical report, Keele University/National ICT Australia Ltd., 2004.
Sentence 2: each study takes into account a di.erent number of layers in the proposed solutions, whereas some approaches (the ones presented in studies S2 and S5) use a set of in­tegrated modules that interact with each other to provide their services and applications, instead of using a layered architectural model.
Relationship: neutral
Domain: Software and its engineering
Sentence 1: ((h) Throughoutthispaper,weusetodenotethelooptrip ountofloopLiatlevelh,whihisonstantorsymbol­ilyonstantw.r.t.theprogramsegmentunderonsid­ (((1) eration.Denote(v=VV((n)).Weleti(n)=l i(h)i(h+1)((h+1)i(h) and=Vl:h:n-l.Intuitively,equalstothenumberofaumulatedlevel­nloopiterations whihwillbeexeutedinonelevel­hloopiteration.Let i(1)(2) vi=(ViVVi(n)).Inthispaper,wealsodenote7i asthenumberofstatiwritereferenesduetoloalarray regions2inloopLi.Wearbitrarilyassigneahstatiwrite refereneinLianumberl:k:7iinordertodistinguish them.TakeloopsinFigure3(b)asanexample,wehave v (=(N-lV[N-l),vi=([N-lVl),71=72=land 73=74=0.
Sentence 2: basedonequation(l3),givenalegalnetworkfow,wehave l1llE1l E(Vi)qv&#38; =Ef(ek)(qv-qv&#38;)(l4) i=1wk=1 whereek =ViVVj>EE1.
Relationship: neutral
Domain: Software and its engineering
Sentence 1: v is a singleton heap consisting solely of the pointer x, storing the value v. The disjoint union may be unde.ned if h1 and h2 overlap, so we need a predicate def h, declaring that h is not unde.ned.
Sentence 2: in both cases, the task of searching and extending the context is performed by the polymorphic structure x.nd (Figure 3), which re­curses over the context lists in search of an element, relying on uni­.cation to make syntactic comparisons between expressions.
Relationship: neutral
Domain: Software and its engineering
Sentence 1: There are 7 SI units, and they are ordered as metre, kg, second, Ampere, Kelvin,candelaand mol.
Sentence 2: figure 8: Overall structure of the amc AspectMat­lab compiler Thefront-endofAspectMatlab wasimplemented as an ex­tensiontotheNatlabfront-end(Natlabisa neat version of Matlab, developed by the Sable Research Group).
Relationship: neutral
Domain: Software and its engineering
Sentence 1: This immediately leads us to the worst-case complex­ity of FISCH as O(l · k + m · o), where l is the number of tasks scheduled on the data center, o is the number of objects in the abstract job, k is the number of blocks in the abstract job, and m is the number of groups in the abstract cloud.
Sentence 2: their performance can vary signi.cantly in practice and there is no single heuristic that performs best in all situations (Braun [1999], Munir [2008]).
Relationship: neutral
Domain: Software and its engineering
Sentence 1: [9] K Kang, S Kohen, J Hess, W Novak and A Peterson, Feature-orientation domain analysis feasibility study, Technical Report, CMU/SEI-90TR-21, November 1990.
Sentence 2: feature diagram is just a declarative specification in terms of labels, and needs support for tracing a feature (i.e.
Relationship: neutral
Domain: Software and its engineering
Sentence 1: 2.6 Common Tag (CTAG) The idea of linking tags with well-de.ned concepts from the Semantic Web is also adopted by the Common Tag (CTAG) ontology that was released in 2009 [3].
Sentence 2: we decided to develop a uni.ed ontology that takes the best parts of the reviewed tagging ontologies and com­bines them in one consistent conceptualization.
Relationship: neutral
Domain: Software and its engineering
Sentence 1: Variants of this technique have recently been adopted in several bug detection tools, including our white­box fuzzer SAGE, which has found dozens of new expensive security-related bugs in many Windows applications and is now routinely used in various Microsoft groups.
Sentence 2: our memory model is very precise and is used in conjunction with a symbolic execution of a speci.c program path and concrete execution.
Relationship: neutral
Domain: Software and its engineering
Sentence 1: We now present the results (completion times) when the on-chip memory capacity is varied.
Sentence 2: we use notation Mui ,nj ,pk ,al to denote the data transformation ma­trix needed for implementing the preferable memory layout (i.e., for achieving the best data locality) for array Ui in loop nest nj of procedure pk of application al, where 1 = i = Z, 1 = j = X, 1 = k = C, and 1 = l = V .
Relationship: neutral
Domain: Software and its engineering
Sentence 1: To evaluate how accurately our technique can identify the calling context of each HPM event, we show the number of L1 cache miss events for which we can track their calling contexts accurately against the total cache miss events occurring in the JIT-compiled code in the last two columns of Table 1.
Sentence 2: our extended version also captures a data address from the SDAR register (for memory-related events) and the value of the stack frame pointer.
Relationship: neutral
Domain: Software and its engineering
Sentence 1: Our main quantitative .ndings are that: 1. with large idempotent regions, performance over­heads quickly approach 0% as regions grow beyond roughly 50 instructions; 2. small idempotent regions of 10-25 instructions typi­cally entail performance overheads of roughly 10%; 3. for small regions ISA effects typically in.uence per­formance by 2-3% (up to 15%); and 4. a code generation algorithm that allows possible con­trol .ow side-effects performs only slightly worse less than 1% worse on average than a more speci.c code generation algorithm that allows them.
Sentence 2: if it is not pro.table, the compiler can choose to checkpoint the live­in variable to the stack by spilling it before region entry and then re-loading it as needed, as in the latter approach.
Relationship: neutral
Domain: Software and its engineering
Sentence 1: HMAC uses a single key k , and essentially calls NMAC with k = gc(k + ipad) and k ' = gc(k + opad), where c, ipad, opad are speci.c constants hardwired into the design of HMAC.
Sentence 2: pre.x-freeness gives the simplest provably-secure counter-measure to various forms of extension attacks on hash functions, message authentication codes and pseudo­random functions, as discussed in Appendix A.
Relationship: neutral
Domain: Software and its engineering
Sentence 1: (a) Rebuffering Ratio (b) Video Startup Time (c) Average Bitrate Figure 1: Distribution of three standard video quality metrics computed over > 200 million user views across 91 providers.
Sentence 2: figure 1 shows the distribution of rebuffering ratio, video start up time, and average bitrate from views that have started the video playing.
Relationship: neutral
Domain: Software and its engineering
Sentence 1: It can be seen from Fig­ure 5 that PROPHET has the most consistent results with the mobile sink case; it is interesting to observe that al­though PROPHET starts collecting encounter information only after the start of the sensing activity, it still achieves a high delivery ratio.
Sentence 2: when the sink locations are unknown, regular DTN rout­ing protocols may be used, if the sink IDs are known.
Relationship: neutral
Domain: Software and its engineering
Sentence 1: This is a non-trivial task, as such allocations should be au­tomatically freed when the function returns, even when ex­ceptions occur or functions like setjmp and longjmp are used.
Sentence 2: cONTROL FLOW OPTIMIZATION OF POINTER-BASED CODE Pointer-based code often uses control .ow structures that are not easy to analyze.
Relationship: neutral
Domain: Software and its engineering
Sentence 1: Because, our method is ag-to the ith CW interval of v, then its active interval is shifted by i= j nostic to how the service-service calls are made, we don t allow (1-.-1) ×.i=1ci.
Sentence 2: table 1 shows top-k (k=2) hotspots in .ve SCG instances of a functionality F. Based on the frequency of occurrence in top-k lists, the services {x2, x3}are the best candidates to optimize F. optimizing these services together might not have a huge impact on requests to F in general, because they co-occur only once in the .ve top-k lists.
Relationship: neutral
Domain: Software and its engineering
Sentence 1: Indeed, a range of power variation (P and Q) is set for each appliance and when the difference detected between two consecutive data readings can be associated to at least one appliance in the database, the algorithm adds it in the monitoring report with the time of ON / OFF events [6] and the appliances in operation.
Sentence 2: when an erratic behavior occurs, it computes, through a probabilistic method, the most reasonable solution to guide properly the person.
Relationship: neutral
Domain: Software and its engineering
Sentence 1: The category includes the following metrics:  Reporter experience (ExpR) of a reporter repj at time t1 is measured by the number of previous issues reported by the reporter prior to time t1:  r rep ) = count iss ): t iss 1 ( exp j ,t1( created _ < t Assignee experience (ExpA) of an assignee assj at time t1 is measured by the number of previous issues resolved by the assignee prior to time t1: exp ( ,t ) = count iss ): a dev ( t < t j 1 resolved _ iss 1 Average past issue lead time (Apit) of a developer assj at time tk is calculated as an average of the lead time of k 1 previous issues resolved by a developer: k -1 t .
Sentence 2: stakeholder past performance, issue description features, and submission cooperation represent the three input variable dimensions used in this study.
Relationship: neutral
Domain: Software and its engineering
Sentence 1: We use MIXY to look for null pointer errors in a reasonably-sized benchmark vsftpd; we found several examples where adding sym­bolic blocks can eliminate false positives compared to pure type quali.er inference (Section 4).
Sentence 2: our type quali.er inference system ensures pointers that may be null cannot be used where non-null pointers are required.
Relationship: neutral
Domain: Software and its engineering
Sentence 1: Period Elapsed Time Files Checked Suspect 1 24 hours 80,000 16,244 2 24 hours 80,000 15,153 3 48 hours 160,000 1,227 4 16 hours 60,000 9,381 5 32 hours 160,000 0 6 28 hours 160,000 0 pair frequently.
Sentence 2: hD video needs to be clipped by subject, renamed, then transcoded to MPEG format.
Relationship: neutral
Domain: Software and its engineering
Sentence 1: Both types of require­ments (development ef.ciency, and dependability) can be achieved using the component-based development approach based upon formally analyzable component-models and complemented with adequate analysis tools.
Sentence 2: at the same time the growing complexity of embedded systems requires methods that increase the abstraction level, improve reusability, and enable concurrency in the develop­ment process.
Relationship: neutral
Domain: Software and its engineering
Sentence 1: Our model also provides for incrementability -supporting on demand usage of communication and storage resources ­and adaptability and extensibility -supporting evolution triggered by user needs.
Sentence 2: iCSE 2000, Limerick, Ireland &#38;#169; ACM 23000 1-58113-206-9/00/06 $5.00 bandwidth utilization.
Relationship: neutral
Domain: Software and its engineering
Sentence 1: Hence, this paper proposes using COCOMO II, which is a standard algorithmic cost estimation model that consists of many relevant factors in practice.
Sentence 2: categories and Subject Descriptors D.2 [Software]: Software Engineering D.2.9 [Software Engineering]: Management General Terms Management Keywords Portfolio Management, COCOMO II, Software Project Risk, Software Project, Software Development  1.
Relationship: neutral
Domain: Software and its engineering
Sentence 1: Put di.erently, the semantic action of the previous pro­duction is a program transformation directly expressed in the parser: a substitution of an abstract syntax subtree pattern (its leaves being replaced by labels called metavari­ables), by another subtree pattern, as depicted on Figure 2.
Sentence 2: other alternatives to our proposal include functional languages such as Haskell or Caml, featur­ing matching capabilities that considerably simplify the implementation of rewrite rules (the Visitor pattern is made worthless);  language extensions such as Prop [9] or Tom [2], aug­menting one or several general-purpose languages with pattern matching and abstract (not concrete) syntax re­write rules;  AST classes and traversal generation tools, like Treecc [16], which takes a similar approach to ours.
Relationship: neutral
Domain: Software and its engineering
Sentence 1: Commercial transac­tions executed over the Internet do not, with only a few exceptions permit the actual exchange there and then of the goods in question.1 Accordingly, what is exchanged electronically are normally com­mitments of this sort, i.e., promises of future action by one or more persons involved in the transaction.
Sentence 2: the protocol sup­ports a notion of e-commerce commitments as performatives, com­plementing Singh s model of multi-agent commitments.
Relationship: neutral
Domain: Software and its engineering
Sentence 1: A transition should have prestate , poststate and the name of the event which is causing the transition.
Sentence 2: relationship-identifier description type| identifier type type-aggregation | association | generalization  identifier -char description -char relationship-identifier type -id1 aggregation relationship-identifier description type -id1 char generalization all the correctness rules for the class diagram can be verified using the proposed UML grammar.
Relationship: neutral
Domain: Software and its engineering
Sentence 1: Suppose, by contradic­ tion, that for every move m applicable to P , P · m is v-valent for some v. Since P is bivalent, there are two moves m0 and m1 such that P · m0 is 0-valent and P · m1 is 1-valent.
Sentence 2: given an in.nite schedule S, a process p is correct in S if there are in.nitely many occurrences of p in S. 2.1 Set timeliness In what follows, A and B are sets of processes in .n and S is a schedule in .n.
Relationship: neutral
Domain: Software and its engineering
Sentence 1: Otherwise, the garbage collector will get into a very low­throughput regime where only major GCs are occurring.
Sentence 2: for the case when the total heap size is .xed and the Eden size has to be traded off against the size of Old, the derived shapes of key GC functions (such as minor GC time and the amount of data promoted into Old at each minor GC as a function of the Eden size) were used to conclude in Section 6 that the optimal Eden size is expected to be greater than half of the free heap space (heap size minus the amount of data surviving the major GC).
Relationship: neutral
Domain: Software and its engineering
Sentence 1: The popularity of these robotic middleware systems has resulted in sizable libraries of components that are now available to roboti­cists.
Sentence 2: we validated our approach by porting some of our existing JAUS components to ROS, and then executing those components on ROS using the ROS2JAUS bridge, and comparing the results of the hardware-in­the-loop system behaviors.
Relationship: neutral
Domain: Software and its engineering
Sentence 1: In a software system with cloning, a single conceptual change (e. g., a bug .x) can thus potentially require modi.cation in multiple places, if the a.ected source code (or model) parts have been cloned.
Sentence 2: then we cover the more thoroughly studied problem of clone de­tection in source code, to understand which of the methods proposed in this .eld could be applied to arbitrary models.
Relationship: neutral
Domain: Software and its engineering
Sentence 1: We use a specially constructed no-op backend in this section, that simply acquires and releases necessarylocks at critical sectionboundaries(substitutingthe orig­inal lock and unlock calls) and directly returns the address passed in for shared memory references.
Sentence 2: yada and Genome however show extremely high over­heads(17X,5X), andinthe case ofBayes the amount ofinstru­mented accesses is so large that it over.ows the STM buffers.
Relationship: neutral
Domain: Software and its engineering
Sentence 1: Ful.lling the vision of autonomic computing.
Sentence 2: implementing the monitoring of method calls, updating at runtime the model of the current state of the model of supervisor accordingly, and disabling the execu­tion of unauthorized method calls can simply be achieved by instrumenting each method m with: insertBefore( If (!Supervisor.accepts(m)) return; ) (1) Statement (1) indicates that whenever a method m is called, it is .rst checked if calling this method from the current state of the supervisor model is authorized.
Relationship: neutral
Domain: Software and its engineering
Sentence 1: As Wang and Saksena illustrated in [1, 2], the schedulability of a task set under preemptive scheduling does not imply that the task set is also schedulable under non-preemptive scheduling and vice versa.
Sentence 2: figure 3 (b), Figure 4 (b), and Figure 5 (b) illustrate how PCP prevents transitive blocking, chained blocking, and deadlock, respectively.
Relationship: neutral
Domain: Software and its engineering
Sentence 1: One potential weakness of the systematic strategy adopted for this study may be that it is based on a static view of the code.
Sentence 2: a. Dunsmore, M. Roper, and M. Wood, Object-Oriented Inspection in the Face of Delocalisation, appeared in  Proceedings of the 22nd International Conference on Software Engineering 2000, pp.
Relationship: neutral
Domain: Software and its engineering
Sentence 1: THE WEAK SNAPSHOT ABSTRACTION A weak snapshot object S accessible by a set P of processes supports two operations, updatei(c) and scani(), for a process pi .
Sentence 2: hence, W observes w2 and the write operation continues in w2 (notice that if a value v ' with timestamp higher than ts is found in w2 then the write will no longer send v, and instead simply writes back v ' to a quorum of w2).
Relationship: neutral
Domain: Software and its engineering
Sentence 1: ACM Conference on Programming Language Design and Implementation (PLDI), pages 141 152, June 2002.
Sentence 2: our experience porting C programs and building new applications for resource-constrained systems con.rms that experts can use these features to improve memory footprint and sometimes to improve throughput when used instead of, or in combination with, conservative garbage collec­tion.
Relationship: neutral