sadat2307/MSciNLI huggingface dataset:
Domain: Software and its engineering
Sentence 1: From the analysis of the data we can draw the following conclusions: From the correlation tests we can conclude that there is a strong linear dependency between the precision and the general understandability of the diagrams on the one hand and the architectural understandability on the other hand.
Sentence 2: we can conclude that any measures that increase the general understandability and precision of architectural models directly help to improve the architectural understandability.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Harbulot and Gurd implemented just the first type of Loops sometimes contain operations that can be executed in a loop (one-exit-node, one-successor-node), because it has the most parallel manner via a multitasking environment or multiprocessing potential for aspectization functionality.
Sentence 2: it can handle before, after, and around advice, and it can provide context exposure.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: When an ultra-widely distributed .le data transfer technology, a .le fragmentation technology and an encryp­tion technology are used, then quite di.erent characteristics from a point of cipher strength arise.
Sentence 2: the combination of the following technologies such as the spatial random scrambling of all data .le, the random fragmentation of the data .le, the corresponding encryption and duplication for each fragmented .le by using stream cipher, and in addition, the corresponding noti.cation of the history data composed of the encryption key code sequence which we call metadata in addition can e.ectively realize the prompt data backup system economically only when they are combined at the same time [3, 4, 1].
Relationship: entailment
Domain: Software and its engineering
Sentence 1: ing that MOPS uses signi.cant hand-coded optimizations external to the core push-down model checker.
Sentence 2: for improved performance MOPS .rst slices the program to extract the security­relevant portion in a pre-pass, resulting in a much smaller program to be checked by the push-down implementation, whereas our im­plementation simply generates and solves constraints for the entire program.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: 5.2 Utility Function Whenever a con.ict is detected, either inside a pro.le (intra­pro.le con.ict) or among various pro.les (inter-pro.le con.ict), user s goals, such as maximisation of the quality of the display for an image processing application, or directionality of data synchro­nisation for a calendaring application, must be taken into account.
Sentence 2: users should be allowed to in.uence the con.ict resolution process operated by the middleware as they are the only ones who know what their goals are at the moment and how differ­ent outcomes are valued.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: However, our Al­gorithms 1 and 2 cannot handle this scenario.
Sentence 2: when StatAnalyzer(B9, null) is invoked, StatAnalyzer identi.es the pre-target as Push.After DynAnalyzer success­fully covers this pre-target (Line 4 of Algorithm 2), Stat Analyzer invokes DynAnalyzer(B9, IntStack.Push).How­ever, DynAnalyzer still cannot cover B9, since Push is in­voked only once in the suggested sequence.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: 3.2.1 PnPAP definition and analysis PnPAP is an API on top of a device's operating system, through which applications can access many kinds of networks over various protocols with basically only one method call.
Sentence 2: pnPAP provides an abstraction layer for networked applications, hiding the complexity of various underlying P2P protocols including for example JXTA, SIP and Jabber.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Autonomic Pervasive Applications Driven by Abstract Specifications Ozan GünalpLevent Gürgen CEA-LETI CEA-LETI Minatec CampusMinatec Campus Grenoble France Grenoble France ozan.gunalp@cea.fr levent.gurgen@cea.fr  ABSTRACT Pervasive application architectures present stringent requirements that make their development especially hard.
Sentence 2: they need to be flexible in order to cope with dynamism in different forms (e.g.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: The ability to establish interpretation and reason on higher-level and global-level situations is mandatory, whilst fuzzy system models and granular component data are prerequisite to specify the probability, abstraction and situation.
Sentence 2: multi-level information retrieval forms the input of the reasoning; the pattern of fuzzy future situation, meta-model granularity information and relevant coordination rules and protocols are the keys to formulize the sustainable action [14].
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Speci.cally, it is satis.ed by every schema mapping M=(S,T, S) such that (a) S is a set of s-t tgds, or (b) S is an SO tgd, or (c) S is the union of a set of s-t tgds with a set of target tgds and egds, and has terminating chase.
Sentence 2: this hypoth­esis is satis.ed by every schema mapping speci.ed by Sst .St, where Sst is a set of s-t tgds and St is the union of a weakly acyclic set of target tgds with a set of target egds [9].
Relationship: entailment
Domain: Software and its engineering
Sentence 1: The aim of this paper is to present the methodological challenges of applying ethnography to a case study aimed at characterizing an agile project team's belief system and its origins, sources, and impacts on the team's software development practices [15].
Sentence 2: we focus on the social interactions, communications, and relationships that arise as an intrinsic part of adopting agile software development practices.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: For example, there is a known7 atomicity violation in the version of Java s ConcurrentLinkedQueue we tested (JDK 6, update 20), involv­ing concurrent calls to poll() and remove(o).
Sentence 2: it is 6 The error in the phyl source is that each worker thread s call to globalResults.addAll(results) is not atomic.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Checkpoints and Continuations Instead of Nested Transactions Eric Koskinen Department of Computer Science Brown University Providence, RI 02912 ejk@cs.brown.edu ABSTRACT We present a mechanism for partially aborting transactions through the use of data structure checkpoints and control­.ow continuations.
Sentence 2: we show that boosted transactions[9] already havebuilt-in restorationpoints and a.ord a simple, e.cient implementation.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Although middleware has been used successfully in DRE sys­tems [5, 30, 31], key challenges must be overcome before it can be applied broadly to support the QoS needs of PLA-based DRE systems.
Sentence 2: r&#38;D is needed to help resolve the tension between (1) the generality of standards-based middleware plat­forms, which bene.t from reusable architectures designed to sat­isfy a broad range of application requirements, and (2) application­speci.c product variants, which bene.t from highly-optimized, cus­tom middleware implementations.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Our PGA library is extended to adapt to supercomputers of hybrid architecture (e.g., Stampede cluster with mixed CPU, Intel Many Integrated Core (MIC), and GPU architecture).
Sentence 2: the asynchronous migration strategy is enhanced and a runtime PGA parameter tuning function is developed for the library to be adaptive to dramatically increased heterogeneity among PGA processes on such supercomputers in order to achieve desirable scalability and reliability.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: The basic idea is that the checkpoint is rather a process history containing all successful operations, and at restart, CPES work.ows start from the very beginning but skip all operations that succeeded earlier.
Sentence 2: in­stead of reading the checkpoint data at the beginning of the restart, rebuilding the state of the work.ow and then con­tinuing from that point, the actors in the CPES work.ows continuously check their actual task against the checkpoint and skip the task if it is found to be already done.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: We have measured this parameter while increasing the size of the sim­ulation model (as said up to 1024 simulation objects) and while adopting two di.erent deploy strategies of the simu­lation objects across the cluster.
Sentence 2: in one strat­egy we hosted the simulation ob jects on di.erent simulation kernels that are deployed as much as possible on the same machine.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: First observations indicate that in particular for small systems with few computational resources a significant amount of research will be necessary to elaborate efficiently working solutions.
Sentence 2: this includes the three interrelated areas: 1. determination and exchange of (discrete or other) configuration space models at runtime,  2. efficient computation of space intersections in order to determine matchings, and  3. the construction support for utility functions at development time.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Incorporating our approach in the runtime (i) reduces the overheads, (ii) simplifies the implementation, and (iii) removes bytecode editing from the critical fetch class file-load-execute path.
Sentence 2: the experience gained with this first prototype was very valuable during the design and implementation of the KVM-based prototype, where the isolation model is implemented entirely in the runtime.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: This engendered a surprising (to me) modifica­tion to the language.
Sentence 2: we had defined a region to be a list of index ranges enclosed in brackets, as in the declaration region R = [1..n, 1..n]; and required that to control the execution of a statement the name appear in brackets at the start of the line, as in [R] A := ... ; It seemed obvious to us as computer scientists that when a region was specified literally on a statement that it should have double brackets, as in [[1..n, 1..n]] A := ... ; Users were mystified why this should be and were not per­suaded by the explanation.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: n.8 Attaining .n in (31) for some .xed n requires, in general, knowledge of the network topology matrix F. For n = 1, the minimization in (31) yields h N i=1 .1 = - hN µi , (32) 2 µ i=1 i which can be computed via macroscopic network informa­tion.
Sentence 2: due to the structure of F, NN NNN 11 111 22 µi = fii,µi = fii- fii , NN NNN i=1 i=1 i=1 i=1 i=1 i.e., the numerator and the denominator of (32) can be ob­tained via the average and squared-average number of con­nections in the network.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: In contrast to this negative result, and as the main result of this paper, we show that for asymmetric congestion games with linear and polynomial delay functions, the convergence time of a-Nash dynamics to an approximate optimal solution is polynomial in the number of players, with approximation ratio that is arbitrarily close to the price of anarchy of the game.
Sentence 2: we show this polynomial convergence under the minimal liveness assumption that each player gets at least one chance to move in every T steps.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: The cost for a subst call should also be put against the number of times a cyclic data structure is expected to be garbage-collected.
Sentence 2: each time a cyclic structure survives a garbage collec­tion (of the whole heap), the relative cost of one additional scan of that structure (i.e., the cost of an initial subst call) will drop towards zero.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Recall that, the SLOs are indicative of the maximum degradation toler­able in average I/O latencies, with respect to their I/O la­tencies in fair share of cache space in I/O servers at the .rst level and storage servers at the second level.
Sentence 2: if IO Latfair is the I/O latency of an application Appi when allocated a fair share of cache in both levels of storage caches, then the assured I/O latency (even in the presence of other applications), IO Latassured for that application would be IO Latassured = SLOAppi × IO Latfair .
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Q.8 t(G, L, Q, A) We then de.ne capacity CBB as follows.
Sentence 2: capacity CBB of Byzantine Broadcast in network G is de.ned as the supremum over the throughput of all algorithms A that solve the BB problem and all values of L.CBB(G) = sup T(G, L, A).
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Conversely, the statements that are executed by a high per- centage of the passed test cases are more likely to be correct than those that are executed by a small percentage of passed test cases, and thus are presented more brightly to express the level of confidence in their correctness.
Sentence 2: the brightness of a statement, s, is computed by the following equation: 5In color space models, a pigment with zero brightness ap-pears as black.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: The next reuse vector (NRV)ofa data block is the difference between the next use of the block (speci.ed in terms of a block iteration vector) and It.
Sentence 2: if the data block in question is next used by iteration II, then the corresponding NRV INote that IAs an example, can be calculated as In= I- It.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: The linear-algebraic fact needed in the proof of the following lemma is stated and proved as a separate technical lemma in Appendix A. Lemma 5.
Sentence 2: for all large enough integers m, s with 2 < s<m +1, and for all su.ciently large f, there exists a linear MDS code C over GF(2f ) of blocklength N = ms +1 , s(s-1) relative distance d =1- , and dimension (1-d)N +1, m(m+1) with the property that there exists a Hamming ball of radius tN, where t =1 - s/(m + 1), containing at least (m + 1) codewords of C. C is not (tN, m)-list decodable.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: It is known that 802.11b modems can operate at four different data rates, namely 1, 2, 5.5 and 11 Mbps, by changing both modulation format and channel encoding schemes.
Sentence 2: 1Mbps is achieved by employing DBPSK modulation, 2Mbps is achieved using DQPSK, while the other higher bit rates are achieved by using Complementary Code Keying (CCK) modulation which is a form of bi-orthogonal signaling.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Proof: Consider anytriple t = (s, w, n).
Sentence 2: choose the parameter ct for the triple t to be equal to the product of the parameters cp of all paths p in G that start at s, end at n and go through w. ct = cp (13) p such that t is a subsequence of p. To show that Path re.nes Triple with respect to the post expectation PostE stated in the theorem, we need to show that WP(Triple, PostE ) = WP(Path, PostE ).
Relationship: entailment
Domain: Software and its engineering
Sentence 1: 5.1 Growing a T -tree Given a test suite T and a FSM M, we .rst construct a hierarchical structure, called a T -tree for M. In a T -tree, each node represents a FSM that is being constructed.
Sentence 2: a node contains a table describing the transi­tion and output functions of the FSM represented at that node.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Sutherland modeled inferencesby considering the set of all possible worlds W;i.e., con.gurations of the system, and introduced the notion of an information function that represents a certain view of the system.
Sentence 2: all the infor­mation about a given world w .W is provided as the outputs of information functions that operate on w. Sutherland describes information .ows from function v1 : W. X to v2 : W. Y in a world w .W as follows.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: For the purpose of this paper, we consider a two­phase self-healing process whereby a failure is .rst detected and then dealt with by means of an appropriate corrective action.
Sentence 2: we focus on the second phase, and as­sume the availability of a failure-detection mechanism that, in addition to signaling a failure, provides some contextual information regarding the failure.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: As an integral part of the future Cisco s test scheduling system for validating video conferencing products, we introduce a search-based multi-objective test prioritization technique, considering multiple cost and effectiveness measures.
Sentence 2: our multi-objective optimization setup includes the minimization of execution cost (e.g., time), and the maximization of number of prioritized test cases, feature pairwise coverage and fault detection capability.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Thus, similarly to a virtual method, a virtual class may be overridden in a subclass of its enclosing class.
Sentence 2: trait ECore { [open] trait Expr[t] case class Num(n :Int) extends Expr[Int] } trait EEval requires (ECore with EEval) { trait Expr[t] { def eval :t } case class Num(n :Int) extends Expr[Int] def eval = n } } [close] class Deployment extends ECore with EEval Figure 7: Pseudo-code pretending Scala supports virtual classes a virtual class VC is a virtual member of another class M (i.e., VC is nested in M), so that VC may be overridden in a subclass M of M. This rede.nes the meaning of VC in every member of M (including the members inherited from M).
Relationship: entailment
Domain: Software and its engineering
Sentence 1: A further goal is to require very little in the way of math­ematical background, and to strive for concise and compre­hensible descriptions of programming languages, following Plotkin [39].
Sentence 2: we should avoid (explicit) use of category theory, as that might make our language descrip­tions signi.cantly less accessible to many potential users.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Where relative ordering of accesses to different loca- tions is important, loads, stores, and atomic update instructions may specify additional ordering restrictions.
Sentence 2: the IA-64 sup- ports acquire/release ordering semantics [5] with optional acquire se- mantics on loads, release semantics on stores, and acquire or release on atomic updates; it also offers a memory fence instruction.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: For an edge e(v1,v2), the effective tie break function (ETBF) caused by selecting e in the path cover, ETBF(e), is the sum of MWP({IE(v1)-e}) and MWP({IE(v2)-e}.
Sentence 2: eTBF(e)= MWP({IE(v1)-e})+ MWP({IE(v2)-e}).
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Simplifying annotations In many cases the dynamic and static speci.cations turn out to bevery similar.Fortunately, thereisa relatively simple processto derive the static speci.cation from the dynamic, and vice versa.
Sentence 2: deriving static from dynamic We give a syntactic opening function, [P ]C , which opens all the abstract predicate families in P on the object this at type C. def [a(this,x)]C = aC (this,x) def [a(y, x)]C = a(y, x) where y = this def = [aD(x)]C aD(x) def [pr(x)]C = pr(x) def [false]C = false def [P opQ]C = [P ]C op [Q]C where op ::= * |.| -* def [.x.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: CASE STUDY To establish the workability of the approach, and investi­gate issues that may arise in its application, we refactored a number of APIs and their implementations that form part of the Concern Manipulation Environment(CME) [8].
Sentence 2: we have applied our approach to two APIs called CIT and CAT the Concern Information Tool and Concern Assembly Tool.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: A single set statement can contain multiple declarations, which are evaluated sequentially.
Sentence 2: set idl : Ti =el, id2 : T2 = e2 ..... idn : Tn = e, in S is equivalent to set idl : T1 = el in set id2 : T2 = e2 in set.., in setidn : Tn = en in S Likewise, use idl : Ti, id2 : T2 ..... idm : TrainS is equivalent to use idl : T1 in use id2 : T2 in use ...in use idm : Tm in S 3.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Af.nepredictor: Thispredictorpredicts the new value as an af.nefunction of aquantity(e.g.,time)thatis sharedbyboth the mobile node and the PRISM server, with the previous valuebeing the constant termin the af.nefunction.
Sentence 2: newV alue = a* time+previousValue, assuming that time is the domain of the function.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Statistical tests Pairs under comparison Rank Sum (a) Rank Sum (b) p-level 2*1 sided exact p Italy MUTS-MUTS(a)­Spain(b) 349,50 1480,50 0,3638 0,3830 Italy MUTS MUTEGS (a)-Spain (b) 148,50 1645,50 0,01413 0,0152 Italy MUTEGS MUTEGS (a)-Spain (b) 126,00 1585,00 0,0105 0,0115 Questionnaire QA (a) Questionnaire QB (b) 598,00 677,00 0,2068 - The second and the third row confirm the findings of the experiment run in Italy: the background of pair s components affects the knowledge built.
Sentence 2: the closer the curriculum of both the designers is to scientific profile (like MUTS and Spanish students) the greater knowledge the designers build.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Poisson arrivals [30, 36]: The number of edge bu.ers, which has been denoted as J in this paper, is su.ciently large to ensure that the superposition of their output processes is reasonably modeled as a Poisson process.
Sentence 2: it is assumed that headers arrive at the sched­uler bu.er according to a Poisson process with rate J .
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Firstly, we note that several design-oriented notations for dynamically reconfigurable systems adopt a separation of concerns perspective, where the modeling of the aspects related to the reconfiguration is kept separate from the modeling of the normal system operation.
Sentence 2: this is achieved by defining one or more entities (separate from the entities that model the normal operation) that model both the occurrence of events that trigger the reconfiguration and the corresponding reconfiguration activities.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Based on this library, which possesses rich, well-structured and mathematically­based semantics, we demonstrate how the concepts therein can en­able a sophisticated concept-aware design for a broad range of sci­enti.c generic libraries.
Sentence 2: we show that concepts can enable the description and application of property-based, library­de.ned, optimizations.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: If the lock this is not held, the atomicity cmpd means that interleaved actions of concurrent threads may affect the behavior and correctness of addTwo, even though there are no race-conditions.
Sentence 2: if a concurrent thread also adds entries to the list, then addTwo will not achieve its in­tended behavior of adding its arguments to the list consecutively.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: In Figure 7 we analyze how additional tra.c .owing on the REDS overlay a.ects the performance of the four protocols we consider.
Sentence 2: figures 7(a) and 7(b) describe what hap­ 1 0.8 0.6 0.4 0.2 01  0.8 0.6 0.4 0.2 0  (a) Scenario 1x1, load=0.5.
Relationship: entailment