sadat2307/MSciNLI huggingface dataset:
Domain: Software and its engineering
Sentence 1: These instruments include an emulation of a classic ana­log drum machine, a two-operator FM synthesizer, a three­oscillator monosynth, a sampler, and many other options.
Sentence 2: although Gibber is similar in that it uses a general­purpose language (in this case JavaScript), we argue that our research enables end-users to create audiovisual works at a higher level of abstraction, easing the burdens of mul­timodal programming for beginning creative coders.
Relationship: neutral
Domain: Software and its engineering
Sentence 1: It tells that if any term of typing G, S f t can be seen as G f s, then any term of typing G f t can also be seen as G f s. Since weakening holds for term judgments, we can do the following reasoning to justify this rule.
Sentence 2: these are as follows and are admissible in Fcc: a f s a f C1[ß .
Relationship: neutral
Domain: Software and its engineering
Sentence 1: [Information extraction] When a mobile agent invokes the migration function to a di.erent type of mobile agent plat­form, an incarnation agent is created.
Sentence 2: eXPERIMENTS Interoperability middleware, which is the basic framework for the proposed interoperability method, has been devel­oped, and experiments involving migration between Plan­gent [5] and Flage [6] were conducted using an information­gathering application.
Relationship: neutral
Domain: Software and its engineering
Sentence 1: Smartphones are equipped withmultiple position sensors including GPS,WiFi, and cellular radios; these can be sampled to obtain times­tampedpositionestimates that canbe deliveredtoa server, and processed to estimate driving times on different road segments at a .ne spatio-temporal granularity.
Sentence 2: we drill down into the results and show that this accuracy is achieved in spite of large travel time estimation errors on individual segments.
Relationship: neutral
Domain: Software and its engineering
Sentence 1: Trapezoids are executed in the form of thread blocks whose execution do not interfere with each other except for device memory accesses; when multi­ple memory requests are issued in bulks by multiple thread blocks, the requests are queued in the device memory and a thread block may have to wait for requests from other thread blocks to complete before it continues.
Sentence 2: s Stencil Probe [19] which does not take into account the ef­fects of ghost zones yet.
Relationship: neutral
Domain: Software and its engineering
Sentence 1: This decision-making pattern was selected to process the monitoring data obtained from sen­sors deployed by the Sensor Factory pattern and detect when a recon.guration was required.
Sentence 2: speci.cally, the monitoring and decision-making patterns are responsible for probing the latency of servers, identify­ing abnormal behavior, and selecting appropriate recon.g­uration plans that best balance costs, latency, and .delity constraints given its current environment.
Relationship: neutral
Domain: Software and its engineering
Sentence 1: 2 Since at the beginning of round m,there are f failures or more, and at the beginning of round m - 1, there are at most f -1 failures, there must be, at the beginning of round m, a processor pj that fails, and all correct processors at the beginning of round m receive a message from pj in round m - 1.
Sentence 2: if simula­tors that are waiting time-share and execute other protocols while waiting, and the BG-agreement is not resolved, we can conclude that at least one simulator does not participate in other protocols.
Relationship: neutral
Domain: Software and its engineering
Sentence 1: We have also modi.ed the nonterminal that represents type declarations to allow declarations of sugar libraries.
Sentence 2: in [3], the authors report that they need to re­solve the set of extensions (for example, in grammar C it may use syntax de.ned in C or B, but not in A) to generate the table for parsing the action part and this is not an easy task.
Relationship: neutral
Domain: Software and its engineering
Sentence 1: A function f that is a self-mapof a complete lattice is monotone if x.y implies f(x).f(y).
Sentence 2: for a recursive method mn, the rule [CALL] uses the followingplaceholder for its summary to be computed: Fmn ={OK : mnOK(X),ERR : mnERR(W)}.
Relationship: neutral
Domain: Software and its engineering
Sentence 1: www.lepus.org.uk [3] Gamma, E., et al.
Sentence 2: there exists a set of sets of dy­namically-bound methods in ComponentHrc  To reveal more about the classes and methods in the ComponentHrc hierarchy, we apply the Enumeration and Partition concretization operators, resulting in Chart 3, discovering that  class Container aggregates (has at least one array field holding instances of [subtypes of]) Component  classes Component, Button and Scrollbar define a set of dy­namically-bound methods, sharing the same set of method sig­natures (ComponentOps2)  each method in class Container whose signature is in ComponentOps2 forwards the call to the respective method in class Component  In fact, Chart 3 completely matches the description of the Compos­ite [3] pattern in LePUS3 [2], convincing us that classes Button, Component, Container and Scrollbar participate in an instance of the Composite pattern.
Relationship: neutral
Domain: Software and its engineering
Sentence 1: Gaia s authors suggest the application of object-oriented techniques to the generated design in order to obtain a more concrete one [5].
Sentence 2: representing the Overall Protocol Taking as ex­ample the ReceivePaper protocol ([5], p 348), we have rep­resented that protocol from the point of view of Gaia and AUML (see Figure 2).
Relationship: neutral
Domain: Software and its engineering
Sentence 1: To attack the polluted, semi-structured bug data problem, DebugAdvisor judiciously adds structure, such as construct­ing bags of terms from documents, and they de.ne a new sort of query, a fat query, that unites structured and unstructured query data [1].
Sentence 2: these three query languages are designed for analyzing a single, property-speci.c trace; OSCILLOSCOPE collects raw, un.ltered traces and tackles the bug similarity problem in the form of trace similarity.
Relationship: neutral
Domain: Software and its engineering
Sentence 1: GC time # of GCs GC time compress 40.512 .371 20 7.420 db 74.829 .687 12 8.244 OC + LBT 100 jack 37.263 javac 34.843 jess 25.605 mpegaudio 25.011 mtrt 21.758 .409 .772 .468 .403 .661 49 64 93 8 61 90 20.041 49.408 43.524 3.224 40.321 80 jbb 1531.5 bh 25.507 health 30.348 voronoi 14.441 1.015 .412 .510 .793 25 9 1 4 25.375 3.708 .510 3.172 70 compressdbjackjavacjessmpegaudiomtrtjbbbhhealthvoronoiGeom.
Sentence 2: the need for such an adaptive strategy did not arise frequently.
Relationship: neutral
Domain: Software and its engineering
Sentence 1: In the privacy enhanced system, additional overhead to convey keying information, {pi,Di; i =0,1,...,I}, is introduced in a secure package.
Sentence 2: the highly connected nature of the Internet makes it easy to automatically collect information from many di.erent sources and compile a dossier on an individual -his/her likes and dislikes, shopping patterns, whereabouts and so on.
Relationship: neutral
Domain: Software and its engineering
Sentence 1: There is no way to represent disjunctions explicitly in any of these elements, which eliminates a possible source of exponential explosion in the size of the element.
Sentence 2: 5.2 Results We applied our techniques to automatically generate invariants for some standard sorting routines and other similar problems that have been studied as challenge problems for generation of quanti.ed in­variants in the literature.
Relationship: neutral
Domain: Software and its engineering
Sentence 1: Inthispaper,wepresentthedesignandimplementationoftheCompressor:anewef.cientcompactionalgorithmthatrequiresonlyshortpausesandissuitableforJavaandC#runningonmodernSMPsandsupportinglargeheaps.TheCompressorisincremental(i.e.,applicationthreadscontributesomecompactionworkduringeachallocationormutation),parallel(i.e.,compactionworkcanruninparallelonmultipleprocessors),andconcurrent(i.e.,partsorallofthecollectioncanrunconcurrentlywhiletheapplicationisexecuting).Inadditiontoreducingpausetimes,theCompressoristhe.rstcompactorthatrequiresonlyoneheappasswhileachievingfullcompaction.Namely,itcompactstheentireheaptoasinglepackedareaandpreservestheorderofallocatedobjects.Allknowncompactorsrequireatleasttwopasses.Therefore,aparallelversionoftheCompressor,designedtoworkwhiletheprogramishalted(inaStop-the-Worldmanner)is,tothebestofourknowledge,themostef.cientcompactorknowntoday.
Sentence 2: allocationsthatoccurconcurrentlywiththerunoftheCom­pressorarehandledasfollows.Allallocationsperformedafterthemarkphaseiscompletedareputintherequire-update pages,asdiscussedabove.Oncetherootsareupdated,newlycreatedobjectsdonotrequirepointerupdates.Fromthispointandon,weallo­cateobjectsinto-virtual-space pagesthataremarkedHANDLED.ThesepagesarenotprotectedandarenottouchedfurtherbytheCompressor.
Relationship: neutral
Domain: Software and its engineering
Sentence 1: However, because checking the state of the test database after each test run can be prohibitively expensive, we propose to re-engineer the tradition testing frameworks as well as to improve the OPTIMISTIC test execution strategy so that a test trace is able to check the state of the test database with minimal overhead.
Sentence 2: in terms of test quality, we point out that the OPTIMISTIC execution strategy in [9] indeed trades test quality for ef.ciency.
Relationship: neutral
Domain: Software and its engineering
Sentence 1: It has several integrated circuits on the  (b) Back side Figure 4: Power management module.
Sentence 2: 6.2 Energy Harvesting and Power Supplying To observe the interactions between the energy harvester and the energy consumer (power management module + sen­sor node), we use NI9229 and LabVIEW to monitor the current and voltage at the three points marked in Figure 2.
Relationship: neutral
Domain: Software and its engineering
Sentence 1: Meanwhile the AIS represents an antibody as a test data and maintains a memory set to save good test data which be able to kill mutants.
Sentence 2: the average execution time of approaches Model Time (s) AIS GA SA SmplSw 2772.85 14348.81 10474.15 Quadratic_v1 8619.93 21445.35 19943.68 RandMdl 6629.87 23370.20 21821.83 Tiny 4451.38 12474.87 10360.35 Quadratic_v2 12670.05 34858.63 32120.53    mutants.
Relationship: neutral
Domain: Software and its engineering
Sentence 1: This approach works very well on vector architectures as it creates large vectors on which the vector processors can operate.
Sentence 2: generally, the Java versions perform quite well, with the O-O versions running within 6% of the performance of native code on the PowerPC using the Jalapefio JVM and within 33% on the Pen- tium with the IBM JVM.
Relationship: neutral
Domain: Software and its engineering
Sentence 1: Otherapproahes,likepre/postspeifationsannot speifymandatoryexternalallsthatomponentsmust make.ThisrestritionalsoappliestoMeyer'sde­signbyontrat[20]andtheJavaModelingLanguage (JML)[18],althoughtheyareespeiallytargetedat omponent­baseddevelopment.
Sentence 2: [4]M.Broy,F.Dederihs,C.Dendorfer,M.Fuhs,T.Gritzner, and.Weber.Thedesignofdistributedsystems-anintro­dutiontoFOCUS.TehnisheUniversitiatMiunhen,Jan­uaryl992.
Relationship: neutral
Domain: Software and its engineering
Sentence 1: Since the state of the original .le system at execution time is also not captured in the heap dump, an exception would normally be thrown when this mechanism attempts to ac­cess the .le system.
Sentence 2: for each sample application, we used the JDI to connect to and pause the live process, captured a single heap dump, and then ran the benchmark against both the live process and the snapshot.
Relationship: neutral
Domain: Software and its engineering
Sentence 1: Aswell,product line engineersusing multi-objective optimization need to identify strategies for selecting optimally con.gured products, given the various trade-o.s among optimal con.gurations in the presence of multiple con.ictingdesigngoals.
Sentence 2: the selected models describe real-world software of su.cient complexity such that tool support is needed to reason about their vari­ants.
Relationship: neutral
Domain: Software and its engineering
Sentence 1: In Proceedings of the 11th International Conference on Advanced Information Systems Engineering (Heidelberg, Germany, June 1999).
Sentence 2: mTRSC(ap) = MTRSC(ap-1) -[Rcd(ap) -D(ap)] and MTRWC(ap)=MTRWC(ap-1)-[Rcd(ap)-M(ap)].
Relationship: neutral
Domain: Software and its engineering
Sentence 1: 0 M1M2 M3M4M5M6M7M8  Figure 4: New Bottleneck Detection Approach: Average Duration of Active Period In comparison, the conventional method was unable to detect the bottleneck with sufficient accuracy.
Sentence 2: in order to improve the throughput of the bottlenecks, it is necessary to first find the bottlenecks.
Relationship: neutral
Domain: Software and its engineering
Sentence 1: Instead, input operations are not automatically rollbackable (since this would entail, in principle, facilities for management of input data from, e.g., an interactive user, which are still not present in ROOT-Sim).
Sentence 2: as such, the events triggered by CC can be re-mapped onto actual sim­ulation events to be exchanged across di.erent simulation objects.
Relationship: neutral
Domain: Software and its engineering
Sentence 1: Figures 1(a) and 1(b) show the breakdown of power consumption of a randomly chosen PARSEC [10] benchmark .u­idanimate on two typical modern multicore systems with eight and sixteen cores respectively.
Sentence 2: the power virus has to strike the right balance between stressing different power consuming components in the system to be able to maximize the overall power.
Relationship: neutral
Domain: Software and its engineering
Sentence 1: For example, by specifying a large area as partofthetop-levelpredicate,quickdeployment canbe ensuredfor criticalqueriesinthe citizenjournalist application(Section7.1), al­beit at the cost ofdeployment to alarge number ofphones.
Sentence 2: [23] B.Hoh,M.Gruteser,H.Xiong,andA.Alrabady.Preserving privacyingps traces viadensity-awarepath cloaking.In ACMCCS,2007.
Relationship: neutral
Domain: Software and its engineering
Sentence 1: 6.3.1 The Effectiveness of Trinity Synchronization We apply our two synchronization strategies separately on an arbitrarily link in our Trinity WSN, and we run the  (a) The current at testing point A (b) The voltage at testing point B (c) The voltage at testing point C tests for more than 8 hours with CSMA enabled.
Sentence 2: only shutting down the radio during Tsleep is not enough, we have to shutdown everything except the oscillator, which leads to the sleeping mode shown in Table 2.
Relationship: neutral
Domain: Software and its engineering
Sentence 1: We therefore developed a Yes/No program using three turn mazes.
Sentence 2: doherty, E, Bloor, C., Cock-ton, G., Engel, W., Rizzo, J., Berg, C., (1999) Cyberlink-An Interface for Quadriplegic and Non -Verbal People, Pages 237- 249, Conference Proceedings, CT99 3 ra International Cognitive Technology, Procs at www.cogtech.org/CT99 7.
Relationship: neutral
Domain: Software and its engineering
Sentence 1: In P. Blackburn and M. de Rijke, editors, Specifying Syntactic Structures, chapter 7, pages 185 211.
Sentence 2: suppose we check the as­sertion that cons is deterministic: assert ConsDeterministic { all e: Element, l: List, c, c : Cons | (cons (e, l, c) and cons(e, l, c )) => c = c } Thisisinvalid, and theAlloyAnalyzer willgive a counterex­ample such as: List = {L0, L1, L2}; Cons = {L1, L2}; Nil = {L0}; Element = {E0}; elt = {(L1, E0), (L2, E0)}; rest = {(L1, L0), (L2, L0)}; e = {E0}; l = {L0}; c = {L1}; c = {L2} in which the two applications of cons produce distinct lists L1 and L2 that are structurally identical.
Relationship: neutral
Domain: Software and its engineering
Sentence 1: It should also be noted that the problem here is not re­lated to labelled trees, which remain the preferred structures for a variety of computational tasks: document manipula­tion, semistructured data management (cf.
Sentence 2: embedded in mainstream lan­guages via language-speci.c bindings, they also promise full integration with existing computational facilities (e.g.
Relationship: neutral
Domain: Software and its engineering
Sentence 1: In fact, if we happen to instantiate the ambiguous type vari­able to another candidate type T_AppendList Int in the above example, length (cons 1 (cons 2 nil) :: T_AppendList Int) the meaning remains identical since the both codes use essentially the same branches for length.
Sentence 2: s nil :: s  Later, we can add constructors in subclasses: class List s x .
Relationship: neutral
Domain: Software and its engineering
Sentence 1: For example, a prop- erty specifying that on all executions of a system, events a and b alternate (but not specifying whether a finite or in- finite number of such events must be observed) is in class (both, all).
Sentence 2: with our proposed classification scheme the analyst explic- itly indicates whether the property is specifying finite, infi- nite, or both finite and infinite sequences, as well as indicates whether the property is to be checked on finite, infinite, or all executions of the system.
Relationship: neutral
Domain: Software and its engineering
Sentence 1: The four formal methods student's elevator projects were subjected to a test suite and all of them passed all test cases.
Sentence 2: the formal methods students claimed to hardly study for these examinations due to their small contribution to the final grade (final examination weight for the control group was equal to the final examination weight plus in and out of class quiz weight for the formal methods students), A detailed comparison was made between the formal methods student's elevator projects and the elevator projects written by the teams of non-formal method students (see [1] for a complete analysis).
Relationship: neutral
Domain: Software and its engineering
Sentence 1: memoing, theoretical sensitivity, theoretical pacing).
Sentence 2: when problems are constrained by the nature of the research questions from the outset (e.g., spe­cific concepts and approaches) data collection will be constrained by how the researcher has defined the problem and the nature of the specific ques­tions which reduced sensitivity and openness to emerging theory that may be meaningful to soft­ware developers [27].
Relationship: neutral
Domain: Software and its engineering
Sentence 1: Unfortunately, despite introducing many important compo­nents, GHC RTS did not scale on multicores, leading to poor per­formance of many network applications that try to use lightweight Haskell threads.
Sentence 2: in the experiments, we turn off hyper-threading to prevent the system scheduler from scheduling multiple native threads that should run in parallel to a single physical CPU core.
Relationship: neutral
Domain: Software and its engineering
Sentence 1: 2.1 Type Specialization Dynamic languages are dynamically typed, i.e., a variable can refer to values of different types at different points dur­ing a program s execution.
Sentence 2: if the types used for specialization change during execution, the runtime performs deoptimization by initiat­ing long jumps to deoptimization routines in the compiled machine code.
Relationship: neutral
Domain: Software and its engineering
Sentence 1: E f c/ e:TE f c ok E f c [e]T / :T c The coloured brackets are typed in colour c, while the internal expression is typed in colour c ' .
Sentence 2: in the .rst stage, section 2, we de.ne our core calculus, which closely follows our previous work in [7], with two main changes: a subtype check replaces the equality check at unmarshall time and the system is extended to include simple records and structural subtyping.
Relationship: neutral
Domain: Software and its engineering
Sentence 1: In accordance with the principle of modular checking, when ESC/Java produces the guarded command for a routine R, it translates each routine call in R according to the speci.cation, rather than the imple­mentation, of the called routine.
Sentence 2: iNTRODUCTION Over the last decade, our group at the Systems Research Center has built and experimented with two realizations of a new program checking technology that we call extended * Current address: Microsoft Research, One Microsoft Way, Redmond, WA 98052.
Relationship: neutral
Domain: Software and its engineering
Sentence 1: Security, dependability and trust metrics for products, systems and services L1  Product/system/service Product/system/service Product/system/service L2 life cycle management security rating or assurance security engineering L3 Conceive Design Realize Service Evaluation Testing Verification Certification System-level System-level technical security technical risk solution management DL: L4 Design-level technical security solution: IL: L5 Implementation-level technical security solution: SW/HW platform Application Network security, DL security, DL security, DL SW/HW platform Application Network security, IL security, IL security, IL  Figure 3.
Sentence 2: we do not detail categories below Level 3 in order to leave more room for future refinement and structuring.
Relationship: neutral
Domain: Software and its engineering
Sentence 1: Note also that the number of violations of a variable v is given by vi[v] <-max(0,o[v]-1); The e.ect of assigning value val to variable var is given by the expression if (var == val) then 0 else o[val] + max(0,o[var]-2) -(vi[val] + vi[var]) The overall implementation is rather simple in this case.
Sentence 2: each time a better solution is found, the instruction solution = new Solution(m); makes sure that solution now maintains the best solution found so far.
Relationship: neutral
Domain: Software and its engineering
Sentence 1: In contrast to CLOUDSCAPE, these frameworks provide a restricted form of coordinating tasks in a distributed application through the scatter-gather idiom; i.e., they provide a mechanism to map tasks over a number of machines and subsequently gather a result from the machines.
Sentence 2: in the example, the two behaviors are spawned to run indepen­dently in parallel, resulting in: H ' ; L ' :object[!L ' .created | L '' .removed]{create : ...; remove : ...}|L '' :object[L ' .created]{create : ...; ...} -.
Relationship: neutral
Domain: Software and its engineering
Sentence 1: Proofs from Tests Nels E. Beckman Carnegie Mellon University nbeckman@cs.cmu.edu Aditya V. NoriMicrosoft Research India adityan@microsoft.com Sriram K. RajamaniMicrosoft Research India sriram@microsoft.com Robert J. Simmons Carnegie Mellon University rjsimmon@cs.cmu.edu ABSTRACT We present an algorithm Dash to check if a program P satis.es a safety property ..
Sentence 2: in each iteration of the main loop, the algorithm either expands the forest F to include more reachable states (with the hope that this expansion will help produce a fail an­swer), or re.nes the partition S. (with the hope that this re.nement will help produce a pass answer).
Relationship: neutral
Domain: Software and its engineering
Sentence 1: decreased: 0.9 to 0.4 Acceleration coe.cient c 1.49445 Velocity bound V d (ubd - lbd)/2 max Refreshing gap m 7 Boundary condition Damping walls Termination 1200 iterations Table 1: PSO settings tioned modi.cations concern the ability to both handle dis­crete variables and a changed search bounds condition.
Sentence 2: more experiments with further test objects taken from various application domains must be carried out in or­der to be able to make more general statements about the relative performance of particle swarm optimization and ge­netic algorithms when applied to software testing.
Relationship: neutral
Domain: Software and its engineering
Sentence 1: 2.4 Decentralized Aggregation to Resist Aux­iliary Information Attacks The goal of the P3 middleware is to compute the popular items in an interest-group.
Sentence 2: such an ap­ 2 LSH is conventionally used for doing scalable nearest­neighbor-search (NNS) in a centralized setting, including its usage in scalable recommender systems [10].
Relationship: neutral