sadat2307/MSciNLI huggingface dataset:
Domain: Software and its engineering
Sentence 1: Interview 3: Tracks as an Authoring Tool Mark .nds the comments view pretty interesting and be­lieves it would be useful with even only 2 to 3 people in a team.
Sentence 2: he would need to have a local server to support the comment threads since the machines used for analysis are standalone (not connected to the internet) due to security reasons.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: Structural Testing Based on Minimum Kernels Elena Dubrova Royal Institute of Technology, IMIT/KTH, 164 46 Kista, Sweden Abstract Structural testing techniques, such as statement and branch coverage, play an important role in improving de­pendability of software systems.
Sentence 2: .nding a set of tests which guarantees high coverage is a time-consuming task.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: The most aggressive default optimization level, e.g., -O3 in the GNU C compiler, corresponds to a pre-set combi­nation of compiler optimizations, with each optimization param­eterized using simple analytical models or heuristics.
Sentence 2: it has been widely observed that there exist combinations of com­piler optimizations that outperform the default optimization levels for many programs by a signi.cant margin.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: For instance, the atomic memory objects can be cached in NVIDIA Fermi GPUs and the L2 cache hit bandwidth is en­hanced signi.cantly in NVIDIA Kepler GPUs [3] (for instance by 73% in Geforce GTX680).
Sentence 2: there is a lack of systematic exploration in the application of native atomics to general commu­tative computations operations.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: Using a static analysis on the observed run s, we .rst collect all null-WR pairs a =(e,f).
Sentence 2: then, we prune away null-WR pairs for which there is no lock-valid run in which f is reading the null value written by e. Then, for each null-WR pair a =(e,f)left, we use our precise logical prediction algorithm to obtain a lock-valid, data­valid and creation-valid run in which f is reading the null value written by e. instead of using run sfor the purposes of the prediction, we slice a relevant segment of it, and use the segment instead.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: To cope with such constraints, log-based NAND flash file systems such as JFFS2 [1] and YAFFS [2] have been developed, which have shown the optimized performance for the flash memory.
Sentence 2: most CE devices have been choosing the File Allocation Table (FAT) [3] as their file system to provide compatibility with PCs.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: As a consequence, we implemented the component reconfiguration engine and all of the other kernel components by exploiting this framework facilities.
Sentence 2: current implementation of the Spring dependency injection container does not natively support dynamic component addition or removal; as a consequence, we had to adopt the Spring Dynamic Modules extension, that targets this issue by integrating Spring with OSGI framework features for dynamic service load/unload.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: Pipelining is especially crucial on in-order processor architec­tures, which cannot rely on an instruction window in hardware to extract parallelism between loop iterations.
Sentence 2: in-order ar­chitectures also tend to suffer more from long-latency operations likecache-missing loads, because the processor pipeline has to stall if neededdataisnotyetavailablefromthe memory subsystem.The high static instruction-per-clock rate (IPC)of pipelined loops of­ten only limited by the number of parallel execution units in the target processor can be substantially reduced by memory stalls at runtime.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: It is to be noted that, while dead memory recycling is indeed able to reduce the mem­ory space demand (which can be observed as several drops in the curve when going from one epoch to another), these savings are not suf.cient to enable the application to successfully .nish its ex­ecution.
Sentence 2: if no recycling scheme is employed, we would incur the insuf.cient memory error much earlier (the .fth epoch), as indicated by the Memory Demand (no recycling) curve, which shows the memory demand of the application when no dead mem­ory reuse is employed.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: Meanwhile, MobiSN provides core implemented core functions and services for a mobile ad-hoc social network, such as the profile generating, friend matchmaking etc.
Sentence 2: due to the high dynamism of the vehicular social networks, it is hard to track down every possible scenario in advance, while MobiSN does not provide the extensibility support to developers, thus it is difficult for it to provide sufficient applications and services to users of vehicular social network systems.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: In the .rst evaluation, the PMO approach produced no false warnings since there were no interac­tions among database queries.
Sentence 2: in the second evaluation, running the tests generatedby the PMO approach resultedinfalse 3 http://odyssey.codeplex.com/  Table 1: Results of Two Empirical Evaluations Subject Medical Device LOC 2994 C 12 M 46 CM 91.9% CP 64.4% CM -CP 27.5% Odyssey 1227 2 53 89.7% 77.2% 12.5%  void SaveCategory(Category category){ ... if (category.Id == 0) Dal.CreateCategory(category); Dal.UpdateCategory(category);  ... } public void UpdateCategory(Category category){ int n = Execute("update Category ...", category.Name, category.Order, category.Id); if (n != 1) throw new DBEntityNotUpdatedException(); } Figure 2: An example segment of Odyssey code warnings for 8 methods of class BizContext, as compared to no false warnings when running tests generated by MODA.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: This separation of the guarantee will be helpful in our veri.cation, because each part is treated differently.
Sentence 2: we still need to consider the dif.culty that even if an aspect B does not interfere when activated before or after an aspect A, it might interfere during A s execution.To handle this, the speci.cation is further extended to include internal assumptions that describe for each aspect A what is expected of aspects to be executed during A.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: Tool support for crosscutting concerns of API documentation Michihiro Horie Tokyo Institute of Technology 2-12-1 Ohkayama, Meguro-ku, Tokyo 152-8552, Japan www.csg.is.titech.ac.jp/~horie ABSTRACT Writing detailed API (Application Programming Interface) documentation is a signi.cant task for developing a good class library or framework.
Sentence 2: existing documenta­tion tools such as Javadoc provide only limited support and thus the description written by programmers for API doc­umentation often contains scattering text.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: A time­based measurement unit makes it hard to establish a contract concerning the resource usage between a client and a server, as the client does not exactly know how much workload can be completed within a given resource limit (since this depends on the hardware characteristics of the server).
Sentence 2: using the number of executed bytecode instructions is indepen­dent of system properties of the server environment.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: 5 Note that 49 and 10 are already unreachable, but the analysis does not detect this, because the abstraction formula is not computed for such non-abstraction states.
Sentence 2: this does not cause a problem because all computations needed for the 5 construction of non-abstraction states like 10 are inexpensive compared with the cost of abstraction computations.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: For an assignment of 1:2 (or 33%:66%), the scheduler may service a few requests for pro- cess p, and correspondingly, about twice as many requests for process q.
Sentence 2: if these processes maintain only one outstanding request at critical moments, then as in the pre- vious example, the work-conserving scheduler is forced to al- ternate between requests from the two processes.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: Systems like Incoop [2], Haloop [3], DryadInc [25], Yahoo continuous bulk processing (CBP) [16], Comet [11], and Nectar [10] achieve this by allowing their applications to reuse existing computation results.
Sentence 2: those systems are not de­signed for scenarios with fast continuous data updates and timely computation results.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: These approaches define specific notations for modelingrequirements such as PLUCs of the PLUTO approach [20] andgeneric requirements specifications [23], from which test cases canbe created.
Sentence 2: they embed test data in the form of parameter values.the category partition method used in PLUCs does not consider the testing order because it just creates test cases throughthe combination of chosen categories.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: VerifationusesstrongeranalysisthanMCex­tensions.However,MCextensionsappeartobemore generallyefetive.Tothebestofourknowledge,ver­ifationpaperstendtofndasmallnumberoferrors (typially0­2),whereastheMChekersinthispaper foundhundreds.Verifation'slowerbugountsseem largelyduetothediÆultyinwritingspeifations, whihsaleswithodesize.Asaonsequene,only smallpieesofodeareverifed.Inontrast,beause MCoperatesdiretlyonsoureode,it(liketradi­tionalompileranalyses)appliesaseasilytomillions oflinesofodeasitdoestoonlyafew.
Sentence 2: tworeentstrong­typingsystemsaretheextended statitypeheking(ESC)projet[8]andIntrinsa's PREfx[15].Bothofthesesystemsusestrongeranal­ysesthanourapproah.theyonlyhekfor afxedsetoflow­levelerrors(e.g.,buferoverrunsand nullpointerreferenes).Theirlakofextensibility meansthat,withtheexeptionofESC'ssupportfor fndingsomelassofraeonditions,neithersystem anfndthesystem­levelerrorsthatMCandetet.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: Dowlatshahi and Safaei developed a multiparty voice communi­cation algorithm for P2P networks where streams are selectively mixed acording to upstream and downstream requirements, thereby reducing bandwidth requirements between peers [Dowlatshahi and Safaei 2006].
Sentence 2: a minimum spanning tree is constructed based purely on delay constraints and coordinates in the physi­cal network thus, nodes may be far apart in the virtual space, but have to forward packets for which they have no interest in.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: If this type of parallel algorithms is implemented on a par- allel processing system with a shared memory, memory con- flicts will occur frequently on the shared memory as the num- ber of processing nodes increases, and it is hard to achieve linear speedups in the calculations.
Sentence 2: this could be implemented on a distributed memory parallel com- puter with a message-passing mechanism, where objects are distributed to each local memory.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: Conclusion We have proposed the DRFx memory model for concurrent pro­gramming languages.
Sentence 2: like prior data-race-free memory models, DRFx guaranteesthat all executions of arace-freeprogramwillbe sequentially consistent.whiledata-race-free models typ­icallygive no or weakerguarantees for racyprograms, DRFx guar­anteesthatthe execution of a racyprogram willalsobe sequentially consistent as long as a memory model exception is not thrown.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: Table5showshowwellourtransformedloopsperformedin relationtotheoriginalloop'sidealshedule(thesheduleon 8F Us 16FUs Clusters 2 4 2 4 II 27.2 19.7 29.8 35.8 Copies 7.0 0.4 7.2 ­2.0 Table4:Transformedvs.OriginalPartitionedLoop 8FUs 16FUs Clusters 2 4 2 4 II 21.7 10.8 20.6 27.8 # Improved 150 133 147 164 Table5:Transformedvs.Original"Ideal"Shedule anarhiteturewithasingleluster).Theaverageperent improvementinIIovertheoriginaloderunontheideal arhiteturewas10.8.27.8%.Mostoftheloopsinourtest suite,65.78%,notonlysignifantlyimprovedovertheorig­inalloopsheduleonthepartitionedarhiteture,butalso improvedovertheoriginalloopsheduleontheidealarhi­tetureswithoneregisterbank.The"#Improved"row showshowmanyofthe211loopstestedatuallyallowedus togetbetterresultsthanthatavailable(forun­transformed loops)withthe"ideal"aseofasingleregisterbank.The loopswheretheIIdidnotimprovewithunrollingwereases wheretherewasatieorasmalldegradation.Theseloops didnothaveenoughdata­independentparallelism.
Sentence 2: someoftheloopsthathadadegradationontainedinner­loopreurrenesandwereunrolledforparallelism.manyoftheloopshavinginner­loopreurrenesshowedan improvement.Weouldfndnoonlusiveexplanationfor thisbehavior.Webelieveitisduetotheheuristinatureof theompilationmethod.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: It is observed that the lifetime of the proposed ERA-WL was at least multiple times of that of both DWL and SWL under all of the evaluated traces when DFTL or FAST was adopted, because the proposed ERA-WL per­forms wear leveling based on the write errors in blocks and could precisely identify the time to reset transient errors by erasing blocks.
Sentence 2: dWL and SWL only consider the P/E cycles of blocks, but neither erase blocks to prevent unrecoverable errors caused by transient errors in time nor distribute more eases to the blocks having fewer write er­ror bits.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: With a UDP payload of 100 bytes, the entire packet .ts into a sin­gle mbuf object and in the kernel-groupcast case is simply copied within the kernel when creating packets for each re­cipient.
Sentence 2: for a UDP payload size of 1000 bytes data is stored in an mcluster object and in-kernel copies of the payload data are avoided.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: Finally, the static approach does not need to pay the cost of copying the code at run-time (including potentially ex­pensive I-cache .ushes), that the dynamic approach has to pay.
Sentence 2: in our experiments this copying takes 5ms for a 10000-line program (190KB generated code) on a Celeron­800, so that should usually not be a problem3 .
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: no longer encodes the value of i, so the algorithm does not know which query point colored a given pixel.
Sentence 2: qi s being independent implies that there is at most one query point for each pixel p that could color p, namely, the query point closest to p and it lies within distance r from p. In our case, the query points lie on a grid Qand we assume that r < s.B/2.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: The standard implementation(that does not use re.ection) de.nes a tiny accept method that is overridden in all the nodes, that calls the appropriate visit method for that node.
Sentence 2: n¨ ageli[26]discusses ownership in design patterns, and showsthat previous ownership work was not .exible enough toexpress thevisitor pattern.A visitorisalwaysmutable becauseitmay accumulate information during thetraversal of the nodeshierarchy.some visitors only need readonly accessto the nodes, and some needtomodifythe nodes.In the former case,theownerofthe visitor and nodes maybedifferent, andinthe latter case,itmustbe the same owner.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: Since knowledge in software development projects is scat­tered acrossvariouspeople, systems, formats and spaces, the creation of a Software Engineering Semantic Web could help software developers to share a common format for inte­gration and combination of data drawn from diverse sources.
Sentence 2: as in the case of the Wikipedia, most of this knowl­edge is explicit, but not machine-understandable.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: Whenwevarythenumberofcomputeprocessorsfrom4 to32inFigure10,compressionscaleswellwithdensearrays likeGENx,sothevisibleI/Ocostdecreasessmoothlywith morecomputeprocessors.Asmentionedearlier,thetotal turnaroundtimeisnotreallyafectedbythelongervisible I/Ocostwithfewercomputeprocessors.Interestingly,the buferoverfowsincreasewiththenumberofcomputepro­cessors.Withfourcomputeprocessors,thereisnooverfow.
Sentence 2: thisisbecausewithfewercomputeprocessors,compression takeslonger,increasingthevisibleI/Ocost.SinceBCmi­grateswhilebufering,itfnishesmigratingdatafromthe previousoutputphaseduringthecomputationphaseand currentoutputphase.withmorecomputepro­cessors,wehaveashorterI/Ophase,andoverfowsoccur.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: This is because Y~,, = Yo 'J"°h('~";)r."; Y~ mod- o Yp ' ¢rxl ~)'o h(mw'ru) )yuh(m.,,rtl)F, ~u ~?
Sentence 2: 'e modn _- ((ro'rO Y,Ye )-Y~h¢"'";) -' e, " '-~ ....., o" .. ~, r Yl, ) ;~_-(0r'4 y.-i g ~r'4o Yl, modp = g;e~ modp it is even more difficult than solving discrete logarithm problem for the attacker to solve Y'0 from the equation r,)-~;-'~..,4r' ;,.y~'hc..,.,;r' Y'o= (r 0 y~, ''~ g modp.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: 2.2 Recursive Types The standard implementation of Hindley/Milner-style type infer­ence fails at programs like [ f ]0+[x : xs]1- =[add ([ f ]2- xs) ([ f ]3- x)]5+ The reason for this failure is that x must have type a and type list a at the same time.
Sentence 2: x could be assigned the re­cursive type µa.list a, which is theoretically sound.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: Given a list of names, say @ John , @ Mar y and @ Bob , the following piece of code appends @ Doe to each of the names, yielding @ John Doe , @ Mary Doe and @ Bob Doe : names = [NSArray arrayWithObjects:@ John ,@ Mar y ,@ Bob ,nil]; [[names collect] concat: @ Doe ]1 Varying receiver Natural order.
Sentence 2: we are not limited to iterating over the receiver of the argument message.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: INTRODUCTION The problem of e.ciently allocating a number of concur­rent potentially real-time tasks onto one or a few proces­sors is important to the .elds of real-time and multiproces­sor scheduling, hardware/software co-synthesis and compi­lation.Dynamically scheduling and then performing each context switch consume time, reducing system throughput.
Sentence 2: embedded systems designers can sometimes take advantage of application information to statically schedule or even eliminate context switches.This reduces the in­struction throughput required, allowing the use of a slower processor clock or even a less complex and less expensive processor.Slower processors have a lower demand for in­struction and data throughput, potentially averting the need for memory hierarchies, superscalar instruction issue and branch prediction.Using a processor without such features simpli.es system design, performance prediction and analy­sis.Lower clock rates lead to bene.ts such as reduced power and energy consumption, reduced electromagnetic emissions and susceptibility, easier hardware design and debugging, and simpli.ed power supplies and distribution networks.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: Our virtualization model is largely common to L4 s normal execution model: we use i) L4 threads to virtualize the processor; ii) L4 memory mapping mechanisms to provide and manage guest-physical memory, iii) an IPC to allow emulation of sensitive instruc­tions through the user-level VMM.
Sentence 2: in virtualiza­tion mode, threads and address spaces have access to an extended ISA and memory model (including a virtualized TLB), and have restricted access to L4-speci.c features, as we will describe in the following.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: SINR3 achieves lower average BER than original average BER.
Sentence 2: there is a restriction in the original TAST code that obstruct its use in multiuser MIMO-OFDM closed-loop systems: For linear receiver, because  has no effect on SINR, we e TAST code must be a square or rectangle code, i.e., the number of p i /4 can replace the rotation M2 in (6) with a 2 × 2 FFT basis sub-carriers (or time intervals) must be the same as or be integer times of the number of antennas, and in every sub-carrier (or time interval), the antenna number must be the same.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: As clearly indicated in Figure 12(b), the graphs of BITVEC and BITVEC+ are the same until a certain instrumentation step af­ter which BITVEC can no longer instrument while BITVEC+ uses increment based scheme to further instrument the graph.
Sentence 2: figure 10 also shows that although BITVEC+ can achieve higher sampling periods compared to BITVEC , but it can introduce inter­ference as indicated by a drop in Figure 12(b) between steps 40 and 50.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: 2.3.1 Run-time Test Complexity Memoryusage.Theadditionalmemoryrequiredat run­timeisforthelistsofLMADsusedatrun­timeto evaluateRTLMADs.OurRTLMADevaluationsheme issimilartoaregister­basedevaluationshemeforanarith­metiexpression.Insteadofmahineregistersweuselists ofLMADs.Intheworstasethenumberofour'regis­ters'growslinearlywiththenumberofmemoryreferene statementsintheoriginalode.However,throughoutour experiments,thisnumberdidnotexeed50.Also,thisnum­berisknownatompile­timeandtheyanbestatiallyal­loated.Thesmallnumberontopofsomeofthenodesin Fig.12representstheIDofthe'register'assignedtostore theresultoftheRTLMADevaluationatthatpartiular node.Iftheaesspatternisfoundlinearatompile­time (asindiretindexing),thenthesizeofa'register'isinput datainvariant(thesizeofanLMADisproportionaltothe numberoflineardimensionsinthespaeitrepresents).If theaesspatternisfoundlinearatrun­timeeventhoughit didnotseemlinearatompile­time(asinsubsriptedsub­sriptsthattakelinearvaluesatrun­time),thenthesizeof the'register'willstillbeonstant.Thesizeofthe'register' inreasesonlywhenareurrenehasanon­linearaesspat­ternthatannotbeaggregatedusingLMADsevenatrun­time.Intheworstase,thesizeofa'register'anbeequal tothesizeofthedatatestedfordependenes.Wehave,so far,notenounteredtheworstaseinourexperiments.
Sentence 2: thetimeomplexityis(worstase)thatoftheLRPD test,i.e.,proportionaltoeitherthenumberofdistintmem­oryreferenesornumberofreferenesfordenseandsparse aesspatterns,respetively.inpratie,thea­tualomplexityisordersofmagnitudesmaller,depending onthedegreeofrefereneaggregationthattheHAmanages toextrat.Manytimesweneedonlyonstanttimetoeval­   uateasmallnumberofonditions.EvenwithRTLMADs thattakenon­onstanttimetoevaluate,ourframeworkan easilytakeadvantageofvaluereuse(a.k.a.shedulereuse) throughaggressivehoisting.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: NOR Yes No Filesystem File storage; Calibration Tables  MicroHash MMC Yes No Yes No Stream/Index Stream Storage and Indexing      ELF NOR No Yes Yes No Filesystem Same as Matchbox  YAFFS NAND No No Yes No Filesystem Portable devices  medium.
Sentence 2: memory is often a scarce commodity on small sensor platforms, with Telos and Mica motes contain­ing 10KB and 4KB of RAM, respectively.
Relationship: contrasting