sadat2307/MSciNLI huggingface dataset:
Domain: Software and its engineering
Sentence 1: In this paper, we propose special purpose programming con­structs to improve the practical application of BDI-based agent­oriented programming languages that have formal semantics.
Sentence 2: we suggest to extend such BDI-based agent program­ming languages with explicit programming constructs for declara­tive goals, their dynamics and di.erent types of goal test actions, events that notify agents about external environmental changes, ex­ception handling mechanisms that notify the execution failure of plans, a recovery mechanism to repair failed plans, di.erent execu­tion modes for plans, and dedicated programming mechanisms for procedure calls and recursion.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Observe that, for large values of q and/or r (> 0.5), the sample mean of m (mean(m)) for Method A is smaller than that for Method B as the simulations have higher chance to reach the state serr (Fig.2) and satisfy(tt U error).
Sentence 2: for models where the probability p for satisfying a desired property decreases dramatically with the transition probability variations, MethodA may su.erfrom the higher mean and variability of computation cost.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: PROOF OF CONCEPT This section presents an proof of concept implementation on the TinyOS operating system diagnosing on a typical sensor network application: Data collection from a set of distributed sensors, e.g., as used for environmental moni­toring.
Sentence 2: we use the MultihopOscilloscope ap­plicationbasedontheCollectionTree Protocol(CTP).We performed experiments withdi.erentdiagnoses formulated inMoMi(a) inthe TinyOS simulator TOSSIM,and(b) on a 24-node testbed of TNOdes [5].
Relationship: entailment
Domain: Software and its engineering
Sentence 1: 2.1 Client Reasoning Because the mandatory calls of a HOM typically have weak speci.cations, the HOM s speci.cation will typically not be suf.cient for client-side reasoning.
Sentence 2: if a client wants to know that a call to a HOM accomplishes some speci.c state transformation, then the HOM s weak speci.cation will generally not be enough to prove what the client wants.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: We also assume that the variance propagation function is linear with coef.cients a1,...,am.
Sentence 2: if fu has an arity of m, and each input xi is approximated by some input x i such that E[|xi - x i|2] = vi, then the .nal variance: E |fu(x1,...,xm)-fu,i( x1,..., x m)|2 = aj vj +2Vu,i .
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Note that ratherthan designingarefactoringthatappliesonlytothe attribute for alternate text concept, the programmer has designed a param­eterized interface so that it can be applied to any attribute of any class.
Sentence 2: the AttributeConcept from Figure5takes three parameters: targetType is the class for which the attribute is de­.ned, attrType is the type of the attribute, and attrName is its name.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: For example, when building the instantiation D, we compute the type handles for Set<str~ng [] > and Lis't.
Sentence 2: these type handles are stored in the vtable that acts as the unique mntime type for D. for each open type expression, a slot is reserved in a type handle dictionary stored in the vtable associated with a particular instantiation.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: This would allow us to refactor all programs that originate from a physically separated program, but unfortunately (or fortunately, depending on the point of view) virtual separation is more .exible and expressive because there is no feature order and because, like in Figure 3, statements in the middle of a method can be annotated [26, 24].
Sentence 2: in  class Foo { class Pxy { C x; C y; } C m(...) { class Foo { ... C m(...) { ... #ifdef A p=h(p, x, y, z); y=z; x=p.x; y=p.y; x=z; ... return x; #endif } ... Pxy h(Pxy p, C x, C y, C z) { return x; #ifdef A y=z; x=z; #endif } p=new Pxy(); p.x=x; p.y=y; } return p; } } Figure 6.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: In this case, upon pack­ing the checkpoint operation within a given entry of checkpoint slots[], the LANai control program ad­equately sets the next .eld of the X-th DMA control block in that entry in order to make it point to the .rst control block of the successive entry of the vector.
Sentence 2: the last (MAXBURSTS.X)DMA con­trol blocks within that entry of checkpoint slots[] are unlinked from the chain of control blocks.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Thus, at the end of the algorithm, .post is the conjunction of all equality predicates that hold for pairs of post-states resulting from pre-states matching .pre.
Sentence 2: .post is the strongest liberal postcondition of .pre for the observed executions R. Checking the condition at line 3 and computing the set and the intersection in line 4 can all be done in O(|M||EQ|) time.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Np do 7: send(msg,n) 8: end for 9: end if ity of reception of messages.
Sentence 2: it is impor­tanttounderstand whetheralowgame eventreceptionrate is due to a poor dissemination caused by the gossip algo­rithm,rather thana lowgenerationrateby agivennode.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Given a cell in the dual space that contains the edge of the shadow, and assuming that the motion of the shadow is relatively slow, one of the sensor nodes corresponding to one line segment that forms the cell can move, so that the size of the cell shrinks.
Sentence 2: we can optimally choose the sensor node and its motion, so that the size of the cell is shrunk the fastest.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Second, we hypothesize that a unified model can further improve our ability to modularize systems, with benefits in evolvability, understandability, communication overheads in development, and parallel development.
Sentence 2: abstracting from the example of the last section, we see that the unified design supports, as a practical possibility, what we might call modularization of higher­order crosscutting concerns.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Note that the second result holds for arbitrary size domains (even exponential) and a more limited class of f, while the .rst result has more general f, but holds only as long as the domain is not too large and the perturbation is not too small.1 We can use the .rst result to obtain separate generaliza­tions of the DN attack to a larger domain or a smaller pertur­(we mention several generalizations later in the paper).
Sentence 2: we will focus on databases representing graphs, and consider summation queries, where the entries included in the sum depend on the global structure of the graph.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: In addition to the time dilation support mentioned above, we have also added the ability to pause, unpause, and sy­chronize guest time to a provided reference time source to Palacios.
Sentence 2: palacios now keeps track of how often timer events are read or injected into the guest, and uses this information to bound how quickly it o.sets guest time towards the desired target time rate.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: (Post a sin sout cout res) This predicate represents the notion that the instruction i is correct with respect to the speci.cation given by the pre­condition P re and the postcondition P ost.
Sentence 2: the predicate is true if the execution of i on a state verifying P re results in a state verifying P ost, assuming that no fatal error has occurred.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Though we propose two speci.c protocols for the node capture detection, the main focus of this work is to inves­tigate a new approach for detecting such attacks.
Sentence 2: we exploit emergent properties of mobile sensor networks, and our solutions are based on the simple observation that if node a will not re-meet node b within aperiod ., thanitis possible that node b has been captured.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Besides showing how to compute this informa­tion we explain how it enables further user interface functionality to be encoded as reusable algorithms.
Sentence 2: we show how this information gives the means for algorithms for the enablement and disablement of widgets when they are not relevant to the result of a user interface, and activation and de-activation of command widgets when the current result of a user interface does not satisfy stated conditions.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: The votefor eachcandidateeventis also weightedaccord­ing to its elimination ef.ciency for a location area, which isde.nedashow equallyin size(orindiameter) an event can cut an area.
Sentence 2: an optimal scan event cuts an area in the middle, since this cut shrinks the area quicklyand thus reduceslocalization uncertaintyquickly.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: 1 Introduction User-declared datatypes and pattern-matching in functional pro­gramming languages like ML and Haskell simplify one of the main tasks for which these languages were intended, namely metapro­gramming the construction and manipulation of syntactical struc­tures.
Sentence 2: the declaration of recursive functions for ma­nipulating the parse trees of object-level languages is made much simpler (and hence less error prone) through the use of patterns to match against parts of trees.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: 3.2 The XCAP Program Logic Bedrock s veri.cation support is inspired by XCAP [22], a program logic for assembly programs that manipulate .rst­class code pointers.
Sentence 2: bedrock directly adopts XCAP s assertion logic (in which code speci.cations are written) and uses a proof approach inspired by XCAP s program logic (in which programs are proved to satisfy their speci.cations).
Relationship: entailment
Domain: Software and its engineering
Sentence 1: To counter these problems, our goal is to extend Mat­lab/Simulink with an explicit .rst-class variability model­ing concept that support modular and hierarchical variabil­ity modeling for dealing with large and complex variant­rich systems.
Sentence 2: we aim at an integration of this approach into the existing development processes and tool infrastructure within Matlab/Simulink.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: // First create a RandomAccessFile object, then /I calculate offset in file RandomAccessFile raf = new RandomAccessFile (filename,access); raf.seek(position); // calculate offset within byte array and number  // of bytes to write, then perform write raf.write(buf,my_start_buf,num_bytes); It is important to note that this approach works correctly both when existing file is overwritten and when a new file is created, because of the semantics of the seek method.
Sentence 2: a seek to a location past the end of the file, followed by a write, extends the length of the file [18].
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Based on this survey result, we posed the following hypothesis: H5 The cost per line of code for parallel code (MPI or OpenMP) will be greater than the cost per line of code for serial code We use the effort data from C3A3, described in Section 4.3, to investigate the cost of HPC code in terms of the amount of effort required per line of code.
Sentence 2: we compared the cost to develop a serial version from scratch to the cost to develop an HPC version starting from an existing serial im­plementation.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Under AIMD, each application adjusts its demand based on the congestion signal c(t) accordingtothe equation: nv(t) n.v(t)= (1 - c(t)) - c(t) v =1, 2, .., V (7) 2 where the .rst term represents the additive increase of one unit of demand and the second term, represents the multi­plicative decrease by halving the demand.Figure 2 depicts the general control block diagram for the model presented above.12 11In general, we denote that change in a variable x(t)by .x(t) 12Since VMs are running on the same physical machine, the e.ect of feedback delay should be negligible, and hence is not accounted for in our model.
Sentence 2: p(t), the appropriate congestion signal, c(t) will ensure a fair convergence across the VMs.Clearly, the convergence time depends on our choice of parameters.a small value of .
Relationship: entailment
Domain: Software and its engineering
Sentence 1: 3.3 Data Recovery on Errors The proposed two-version-based strategy could roll back a .le to its latest valid snapshot when the current version of any chunk of the .le is corrupted.
Sentence 2: when the current version ck,2 of a .le chunk ck at time ti is corrupted, its .le can be rolled back to the latest valid snapshot Sr that includes ck,1.To reconstruct Sr of the .le, chunk IDs in the candidate queue are popped out to check up their relative position so as to e.ciently determine the chunks that need to be rolled back.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: The literature suggests that Reflexion Modeling is effective in identifying inconsistencies between the as-implemented and as­designed architecture of existing systems [8] in hindsight.
Sentence 2: it has been successfully trialled in situations where architectural inconsistencies have become entrenched in a deployed, evolving system over a long period of time and the organization has retrospectively decided to identify these inconsistencies.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Using this information and the dataflow relationships, the Test-Count Technique has assigned an estimated fault likelihood, visually represented by varying shades of red (gray in this figure), to each non-input cell in the spread­sheet.
Sentence 2: the visualization shows the fault likelihood of Regular_Pay, Overtime_Pay, and Gross_Amount to be estimated at Medium while Withholdings and Net_Amount have been esti­mated at Low.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: From the premise we know that Gfirst(pa) = Gfirst(pb) and hence Gfirst(pb) = Glast(pf ).As pw is a maximal atomic cover, we know that inatomiclast(pf ) = .. From the fact that client transitions cannot synchronize (they cannot execute atomic statements or access global memory), and that a process cannot access the local variables of another process, it follows that process q can execute m2 concurrently with m1 from state last(pf ).
Sentence 2: there exists an execution pbase1 · pf · pbD.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: But this code can be thought of as atomic if the pro­grammer cares only about the multiset of elements in the .­nal list.
Sentence 2: the example program in Figure 6 is se­mantically atomic with respect to some bridge predicate like equalMultisets(list,list ), where equalMultisets is a function that compares two collections to see if they have equal multisets of elements.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Core HE R M E S Algorithm ( X for Workpath Sensitivity and X for Workload Sensitivity) 3.3 Uni.ed Algorithm Speci.cation worker may be left with a large number of work items when it becomes immediate.
Sentence 2: a slower tempo in- The two tempo control strategies are designed to comple­creases the workpath length.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: We do it in the next section, but before we want to address the possible doubts of a reader about what the denotation of a .nite type like Bool is in such models.
Sentence 2: since this denotation contains not only (the denotations of) true and false but in.nitely many other elements, then the reader can rightly wonder what these other elements are and whether they carry any intuitive meaning.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Effectiveness of Cross-Platform Optimizationsfor a Java Just-In-Time Compiler Kazuaki Ishizaki, Mikio Takeuchi, Kiyokuni Kawachiya, Toshio Suganuma, Osamu Gohda, Tatsushi Inagaki, Akira Koseki, Kazunori Ogata, Motohiro Kawahito, Toshiaki Yasue, Takeshi Ogasawara, Tamiya Onodera, Hideaki Komatsu, and Toshio Nakatani IBM Research, Tokyo Research Laboratory 1623-14 Shimotsuruma, Yamato, Kanagawa, 242-8502, Japan ishizaki@trl.ibm.com ABSTRACT This paper describes the system overview of our Java Just-In-Time (JIT) compiler, which is the basis for the latest production version of IBM Java JIT compiler that supports a diversity of processor architectures including both 32-bit and 64-bit modes, CISC, RISC, and VLIW architectures.
Sentence 2: we focus on the design and evaluation of the cross-platform optimizations that are common across different architectures.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: The intent of the experiments was to explore whether taking bandwidth utilisation into account would indeed lead to substantial de­creases in the latency of a real WSN.
Sentence 2: since we deal with radio link utilisation, the realism of the radio mediumwasexpectedtohaveavery signi.canteffect.Inthe small-scaleexperiment,1clientwas usedtoof.oad tasksto 5servers (2 of which were located within an area congested bya streaming entity generating traf.c).Weexamined three cases for each load sharing algorithm: (i) without contention, (ii) with contention (extra traf.c generated by the streaming node)but considering onlycomputational requirements, and (iii) with contention and using our approach which addition­ally considers bandwidth requirements.Fora more thorough evaluation of our algorithms, we also tested them on a large­scale mote testbed.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Experimental results performed on a wide range of situ­ations, together with comparative evaluations against two variants of the epoch-based technique, show that the evap­orative approach is able to handle the dynamism of the val­ues measured over the network in an e.ective way, and in the most of the cases is more accurate than epoch-based techniques.
Sentence 2: the evaporative solution is to be preferred either in very-large networks or whenever periodic restarts are to be avoided.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: 46022, Valencia, Spain {sabrahao, einsfran, pcarsi}@dsic.upv.es In this paper, we present a controlled experiment to assess whether the use of stereotypes improves the comprehension of UML sequence diagrams.
Sentence 2: we consider a set of stereotypes that have been proposed to enrich the semantics of interaction messages in UML sequence diagrams in the context of a Requirements Engineering approach for model-driven software development [3].
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Second, it uses an interval caching technique to cut down the memory space required to describe the mapping for a LPA range whose correspond­ing PPAs are also contiguous.
Sentence 2: rather than using X PMT entries to describe a contiguously mapped LPA region with X pages, SOFA uses three numbers to describe such a LPA region: the starting LPA, the starting PPA, and the re­gion s size.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: 4 Case Studies To illustrate the applicability of the framework and aug­mented sequential programming model, this section de­scribes the manual application of the techniques from Sec­tion2totheCapplicationsintheSPEC CINT2000 bench­mark suite.
Sentence 2: for each benchmark, the loop and its parallelization are described.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Hence, the meta-program reduces to C = { /*as before*/ } D = { i n t h(){ r e t u r n new o u t e r .D().k();} i n t k(){ r e t u r n 1;} } which is a well-typed program.
Sentence 2: now the expression new outer.D().k() can be successfully typechecked.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Consider now the priorities associated with each object in the application: DATA PROVIDER PRI for both data pro­viders, COLLECTOR PRI for the collector, STORAGE DE-VICE PRI for the storage device and VIS DEV PRI for the visualization device.The priorities have the following rela­tionships: Relationships_among_priorities: DATA_PROVIDER_PRI > STORAGE_DEVICE_PRI &#38; STORAGE_DEVICE_PRI > COLLECTOR_PRI &#38; COLLECTOR_PRI > VIS_DEV_PRI.
Sentence 2: vIS DEV PRI is the lowest priority.Considering that the priority propagation model associated with both the Collector and the StorageDevice is CLIENT PROPAGA-TED (see Figure 4), the two following lemmas can be demon­strated.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: CRESCENT is designed as a low-cost testbed that can be deployed on com­modity computers with typical RF interfaces, without the need for attaching any other special hardware.
Sentence 2: cRESCENT makes use of the MAC and PHY protocols of conventional 802.11 cards, allowing the user to focus only on the implementation of the routing protocols, with integra­tion with USRP and WARP boards if needed.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Given the median precision of 0.84 achieved by one of our method-level based prediction models (see Table 4), a de­veloper has roughly the same chance of picking a bug-prone method by randomly guessing after eliminating 6 out of those 11 methods (4/5=0.8).
Sentence 2: one needs to manually reduce the set of possible candidates by more than half of all methods until chance is as good as our prediction models in terms of retrieving a bug-prone method.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Second, a meta-pattern that is common in the two classes, but whose attached performance metrics are signi.cantly higher in the slow class, also im­plies highly suspicious and high-impact runtime behaviors to the performance.
Sentence 2: for the common meta­pattern Ps in the slow class, and Pf in the fast class, when- Ps.C Pf .C Tslow ever / > , the causality analysis selects the Ps.N Pf .N Tf ast meta-pattern as a contrast.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: V(G)is given a bit-string O(G, u)corresponding to the advice given by the oracle O to node u about the network, this oracle takes in particular the edges weights of G in input.
Sentence 2: in this model, there is a straightforward (.log n.,0)­advising scheme (O,A) for MST in which each node is given by O the rank of the edge leading to the root of some MST T. for an edge e incident to u .
Relationship: entailment
Domain: Software and its engineering
Sentence 1: While these approaches areoftendescribed as network virtualization ,butinthe broader systems literature, virtualization refers to the act of decoupling the(logical) service from its(physical) realization.
Sentence 2: the virtualized service may be implementedby asinglephysical componentsharedby multiplevirtualized services or byusing multiplephysicalresourcestoimplement a single logical service.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: To handle this situation, we leverage the idea of an option type by providing a Forest-level Maybe type constructor that maps the optional .le system object to a Maybe type in Haskell.
Sentence 2: if T is a Forest type, then Maybe T is the Forest type denoting an optional T. The type Maybe T succeeds and returns representation None when the current path does not exist in the .le system.
Relationship: entailment