sadat2307/MSciNLI huggingface dataset:
Domain: Software and its engineering
Sentence 1: In this paper we will show, what adapting always beta to the special needs of designing for the Smart Home means, where we not just take care of the software, but also handle hardware components.
Sentence 2: because of the 'materiality' of the Smart Home it is not possible to just put a beta version on the web, but an essential part of the development process is to visit the beta-users at home, build trust, face real world issues and provide assistance to make the Smart Home work for individual home infrastructures.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Such predicates with su.x -d signify that the schedulability of t other than just being established via some exact test, must additionally be ascertainable via a (poten­tially pessimistic) density-based uniprocessor schedulability test (similar to Lemma 2).
Sentence 2: for t [pp] of tasks as­signed on a processor pp of speed sp,to meet deadlines, it must hold that .di = sp.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Because of the black box nature of high-level control software components, any workable method for performance prediction in this domain must be able to deal with the abstraction that arises in component interface contracts.
Sentence 2: often it is not possible to know low-level details of all components; one must have available, and be able to use, only summary information about component behavior in order to predict client system behavior.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: 0 Out1 Out2 Out3 Out4 Out5 No Error Error = 0.25*Range Error = 0.5*Range Error = 0.75*Range Error = Range Figure 7 Mean Error for Faulty Programs 394 We have also studied the IFN capability to identify individual cases that produce incorrect output.
Sentence 2: we are interested to maximize the probability of catching an error (True Positive Rate), while minimizing the probability of mistaking correct outputs for erroneous (False Positive Rate).
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Given a mission critical system with executable software memory size N and vulnerable memory size n, assume K-variants arecreated through simple semantic preserving source code transformations and operate concurrently with their initial version, can the new system survive M attacks from malicious at­tackers?
Sentence 2: what is Pu(K, M) under the given system and attackmodels?
Relationship: entailment
Domain: Software and its engineering
Sentence 1: newtype Modulus s a = Modulus a deriving (Eq, Show) newtype Ms a = Ma deriving (Eq, Show) add :: Integral a .Modulus s a .Ms a .Ms a .Ms a add (Modulus m)(Ma)(Mb) = M (mod (a + b) m) mul :: Integral a .Modulus s a .Ms a .Ms a .Ms a mul (Modulus m)(Ma)(Mb) = M (mod (a ×b) m) Also, we need the function unM to give us the number back from the wrapped data type Ms a. unM :: Ms a .a unM (Ma) = a The type parameter s is phantom.
Sentence 2: it has no term repre­sentation: the parameter s occurs only in type expressions without a.ecting term expressions.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: XSLT style vs. SYB style XSLTstyle is similar to SYB style.
Sentence 2: xSLT s templates with problem-speci.c match conditions are similar to the type­speci.c casesin SYB.A template witha match condition for an element name, e.g., match= salary , corresponds to an SYB-like, type-speci.c case that is universally applicable to the speci.ed type, say the type of salaries.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Since 8d(e)(P 2)- d(m)8 remains the same under the three transformations (translation, rotation, and re.ection), an arbitrary element of R(P 2) is to be an estimator of relative locations of sensors.
Sentence 2: the optimization problem in the right-hand side of (1) has multiple (in.nite number of) solutions.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: The IBC accumulates updates of indirect blocks in memory be­yond multiple segment writes and later .ushes them to disk altogether at check-point time.
Sentence 2: when the seg­ment bu.er is full, modi.ed .le blocks in the segment bu.er are written to an empty segment on disk while modi.ed in­direct blocks in IBC are not.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Coping with the challenge of innovating design, we regarded the living labs as a greenhouse, in the way that novel design concepts can grow within a fertile environment to more robust and comprehensive solutions in an always beta process.
Sentence 2: by creating opportunities for users to have first-hand experiences is useful to address the complexity and situatedness of HEMS use in real-life environments.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Empirical validation of Information and Process based SOA integration SOA have driven both a significant restructuring of the solution and application lifecycle and its supporting methods, as well as new tools and runtime environments to support SOA.
Sentence 2: the advent of Information as a Service coupled with process-centric approaches to SOA promise significant new benefits and new approaches to the design and implementation of SOA solutions and environments.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: The caller gives up the permission x2 @ t2, which is consumed, and in return gains a permission for the result of the function call, at type t1.
Sentence 2: because types have an own­ership reading, a function type t1 .t2 describes not only the shape of the function s arguments and results, but also the side effects that the function may perform, as well as the transfers of ownership that occur from the caller to the callee and back.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: For speci.cations that consist of several aspects and describe some possibly crosscutting concerns, traceability and debugging are very different than their counterparts in imperative programming languages.
Sentence 2: the pres­ence or elimination of a behavior (i.e., a transition from one state to another) in the program, may be the result of the ap­plication of several, possibly overlapping, non-independent concerns.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: In the following, we show that the renaming net­work construction solves adaptive strong renaming, i.e.
Sentence 2: that processes return values between 1 and k, the total contention in the execution, as long as the size of the initial namespace is bounded by M. if we use the optimal AKS sorting network [15] as the basis for the renaming network, then we solve strong renaming using expected O(log M)step complexity.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: We provided a new implementation for the ReplyEnabledDispatchingService interface, using the sec­ond approach above, the one tailored to content-based sys­tems like REDS, to implement the correct routing of replies.
Sentence 2: we used the identi.er of the publisher, which was already provided by REDS, as the special content to be added to replies in order for REDS to correctly route them back to the publisher.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: By Lemma 3.4, each subcommittee contains a fraction of the core of size s -1/log n. Since al+1 = al - 20/ln n, the fraction of good successor nodes in Pl+1 is at least (1 -2lnn)· (al -20/ln n)= al -22/ln n = al+1.
Sentence 2: the last level l* has the desired properties from which the theorem follows: Proof of Theorem 4.1.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: For example, we cannot show that the method call list.add does not interfere with iter.This is because E f wr under(list) # rd under(iter) cannot be proven due to the inclusion E f under(iter) under(list).
Sentence 2: our system also re.ects the fact that calling the methods next or elem on iter do not a.ect list.we can show E f (rd list.1 wr iter)# rd list.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: This CAS operation does not com­mute with operations of concurrent threads, since it inspects and potentially updates the shared variable m. Hence, any execution of busy acquire where the loop iterates multiple times cannot be reduced to a serial execution, and previous tools based purely on re­duction cannot verify the atomicity of busy acquire.
Sentence 2: our previous type and effect system for atomicity [17] cannot ver­ify the atomicity of irreducible procedures like busy acquire.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: We write p | q to mean that p evenly divides q.
Sentence 2: (C14) (falign(f) | fo.C (f)) and (falign(f ) | nvalignC ) if f .eld of C (C15) (nvalignB | dnvbo.C (B)) and (nvalignB | nvalignC ) if B non-virtual base of C (C16) (dtdalign | nvalignC ) if C is dynamic (C17) (nvalignB | vbo.C (B)) and (nvalignB | alignC ) if B is a generalized virtual base of C (C18) (alignC | sizeC ) (C17) implies that (nvalignC | alignC ), as ex­pected.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Currently, the packages delivered in clinical fields may have a software component, but this software is part of the clinical domain, targeted to professionals providing treatment support.
Sentence 2: the clinical software used has little or nothing to do with daily-living software applications that many of us take for granted, e.g., email, web browsers, digital photography tools, music-management tools, trip-planning tools.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: That is, if s and s ' are two states resulting from any two executions of P from the same initial state, then Post(s, s ' ) holds.
Sentence 2: the above construct could be rewritten in the following way: deterministic assume(s0 == s ' 0){ P } assert(Post); if any two executions of P start from initial states s0 and s0' , respectively, and if s and s ' are the resultant .nal states, then s0 == s0 ' implies that Post(s, s ' ) holds.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: The infrastructure of typical hospital environments is currently mostly device-oriented.
Sentence 2: the components implementing a work.ow are statically deployed to .xed devices, which leads to overcapacity due to suboptimal us­age of resources (resources are reserved for particular work­.ows, even if not used); in.exibility in reacting to events; a multitude of deployment and maintenance scenarios; but above all, it requires users to go to the device that supports a particular task.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Since we separate the lexers and their speci.cation, the contract system does not have enough information to track the error back to the language lexer implementation in case of a contract violation.
Sentence 2: from the perspective of the contract system, the contract dep-lexer/c is not between an untrusted lexer and its clients but rather between the con­tract region labeled new-lexer and its context.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Mutation testing su.ers from the problem of equivalent mutants [67].
Sentence 2: mutants are generated syntactically by altering the source code, but this may not have any se­mantic e.ect, leading to a mutant that is syntactically dif­ferent, yet semantically equivalent, to the original program from which it is constructed.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: The proposed scheme ap­plies di.erent quantization step-sizes according to the mag­nitude of messages, where it uses the larger quantization step-sizes for the larger magnitudes of both intrinsic and extrinsic messages.
Sentence 2: if the magnitude of mes­sage, |x|, is less than 2(q-f-3), then the message is quantized with (q : f) uniform quantization and its quantization step­size is 2-f .
Relationship: entailment
Domain: Software and its engineering
Sentence 1: The term entrepreneurship was used, the concept, for the first time, by the economist Joseph Schumpeter in 1950, it was used to sinonim of a creative person that is Able to make a successful innovations.
Sentence 2: entrepreneurship is a term used to describe or Specify, that 'an individual who holds a special way, innovative Activities, organizes and runs the business fits That Their interests and capabilities [6].
Relationship: entailment
Domain: Software and its engineering
Sentence 1: The computation of all the clusters in C amounts to finding all the maximal subgraphs whose nodes are mutually strongly connected (whose edge s weight is = T).
Sentence 2: if one creates a new graph G by removing all edges whose weight is < T from G, then the search for the clusters is similar to finding the largest complete subgraphs (maximal cliques) in G .
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Figure 5: Initial Interaction Design Behavior Ex­cerpt  4.3 Enactment of Macro-iteration Correcting this and the other .aws in the interaction design detected through the heuristic evaluation led to a macro-iteration, following the Integrate Interaction Evalua­tion Results path in our process.
Sentence 2: an interac­tion designer added another loop into the Discourse Model of the interaction design to correct the confusing behavior described above as suggested by the usability experts.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: For completitude, we extrap­olatethecurvetotheborders, butobservethatthedataare accurateand used onaninternal region([1%, 15%] for LR, and[1, 4] for the MLBS).
Sentence 2: we can observe that quality is monotone in the two variables, and particularly increasing with the MLBS, meaning that humans prefer sequences where losses are concentrated over those where losses are spread through the .ow.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: The main di.erence between CloudScale and those commercial SaaS and PaaS solutions is that, when using CloudScale, developers retain full control over their application.
Sentence 2: even though CloudScale hides some scalability-related issues from developers, they are still free to customize the way CloudScale works to their own needs, either by implementing custom scaling policies, adapting the CloudScale framework itself, or managing some COs in the application manually.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Similar reasoning can be used to show that the notion of a data race, as de.ned above, is equivalent to an interleaving­based de.nition.
Sentence 2: if there is an execution with a data race as de.ned above (a type 2 data race in [2]), then there is an interleaving of the actions of the threads, such that no two threads hold the same lock at the same time, and the racing statements appear adjacent in the interleaving (a type 1 race in [2]), so that in a realistic setting, they might have executed concurrently.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: i=1 Obviously, it holds 0 = D(v1 ,v2 ) = n. Because the vectors v are randomly generated by RT1, we can consider D as random variable with the vector of probabilities pi as parameter.
Sentence 2: in other words,given aparticularSUT with speci.cprobabilities pi for the testingtargetsin T, we wantto studythedistribution ofthe random variable D. we are interested in its expected value E[D].
Relationship: entailment
Domain: Software and its engineering
Sentence 1: , an) 1 : k = i or k = j where ak = { 0 : otherwise Given this notation, we de.ne for each wi, wj E W the fol­lowing interaction predicate I1.
Sentence 2: true : E(sij ) - E(si) > threshold, and I1(wi, wj ) = E(sij ) - E(sj ) > threshold false : otherwise si is the compiler setting which turns on optimization wi, sj is the compiler setting which turns on optimization wj , and sij is the compiler setting which turns on both wi and wj .
Relationship: entailment
Domain: Software and its engineering
Sentence 1: BOP executes PPR instances in a pipeline and shares the basic property of pipelining: if there is an in.nite number of PPRs, the average.nishtimeis determinedbythe startingtimenotthelength of each speculation.
Sentence 2: the parallel speed is limited only by the speed of the startup and the size of the sequential region outside PPR.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: We .rst need to establish some terminology: De.nition 9 (Undirected path) For a directed graph G and vertices v1 and v2 in G, an undirected path from v1 to v2 is a path from v1 to v2, in which we are not required to follow the direction of the edges.
Sentence 2: an undirected path is a path that exists when we pretend that the underlying directed graph is undirected.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: The conditions of symmetry and full distribution are inter- esting also for practical considerations: in several cases it is desirable to consider systems which are made of copies of the same components, and have no central control or shared memory.
Sentence 2: symmetry offers advantages at the level of reasoning about the system, as it allows a greater modularity, and at the level of implementation of concurrent languages, as it allows a compositional compilation.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Finally, in order to preserve the consistency of the routing information, we assume that the elapsed time between two consecutive migrations of a subscriber s (to broker bj and then to broker bk) is greater than the upper bound of time required to propagate a message from s to bk using bj as its front-end broker.
Sentence 2: the migrating subscriber cannot move faster than a message it emits, which is not a severe constrain in practice.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: This paper describes our two years experience in designing and implementing SMILE-JS, the first SIP-based middleware for J2ME CLDC enabled devices, exploiting the open source MjSIP SIP stack [11].
Sentence 2: section 2 provides details of SMILE operations and APIs, section 3 deals with transport of messages in SMILE-JS, section 4 discusses serialization of messages in J2ME.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Fig 8 shows an algorithm skeleton of the in­voke loop splitting function invoked in Fig 7, which serves to remove conditionals, e.g., those tagged with the split at begin and unroll check relations in Fig 4, from inside loops, by splitting the surrounding loops whose index variables are involved in the conditionals, so that the condi­tionals become either always true, in which case the check can be removed, or always false, in which case the entire conditional together with its body are removed.
Sentence 2: step (1) of the algorithm removes all conditionals introduced by loop blocking by identifying each outer blocked loop that has been tagged with a symbolic name, e.g., n1, with some loop in its body tagged with tile(n1), and its body contains at least one of the relational tags, split at end(tile(n1)), un­roll check(tile(n1)),or split at begin(tile(n1)).
Relationship: entailment
Domain: Software and its engineering
Sentence 1: The M0as­sertional knowledge and the terminological axioms rep­resenting the M1 model were automatically checked by v a Description Logics reasoner to be non-contradictory .
Sentence 2: quali.ed cardinality restrictions were used to check minimum-cardinality constraints de.ned for UR-DAD modelling constructs like that a requirement is re­quired by one or more stakeholders (the unique name as­sumption is enforced for ontological individuals to prevent the reasoner from inferring their identity).
Relationship: entailment
Domain: Software and its engineering
Sentence 1: We found that the equational theory and the method speci.­cations were not equivalent and none of them contained stronger speci.cations than the other.
Sentence 2: while proving either direction, some lemmas could not be proven without strengthening some of the axioms or adding new ones.Four additional equations had to be added to the equational theory and one postcondition hadto be strengthened in the method speci.cations in order to prove their equivalence.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: This is guaranteed to produce the right frequencies for the con­tentsof rangesof rolesusedin frequency constraints,since for each such range RA, ..., RK , we have r = fmax · rab...k, or r/rab...k = fmax, and similarly for fmin.
Sentence 2: in producing r complete tuples, we are guaranteed to repeat each sub-tuple in role range RA, ..., RK at least fmin and at most fmax times.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Contained in the JSEF package, this class contains the definition of attributes and methods that will be common to all classes defined in 3SEF.
Sentence 2: it defines attributes which maintain basic descriptive information about JSEF objects, such as a name for the object, a description of the object or the resource it represents, the date/time of object creation, the date/time of the beginning and completion of the resource's processing/creation, and the name of person creating the object.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: The memo/miss rule evaluates a memoization expression memo e and yields a trace memo e ·T ' ,where T ' is the trace of the evaluation of e. A present reuse trace T is itself a computation trace from a previous evaluation and is supplied to change-propagation to guide the update.
Sentence 2: evaluation may reuse computations memoized in the previous evaluation: the memo/hit evaluation m rule uses the memoization judgement s; T ; e .
Relationship: entailment
Domain: Software and its engineering
Sentence 1: The optimizations arecrucial to reduce the size of the resulting code.
Sentence 2: figure 11 illustrates how a GDSL library is synthesized.a generic runtime template is specialized forthe input GDSL program by adding declarations for themonadic state, constructors, and heap allocation functions.This bespoke runtime is combined with the generated codeand compiled to a library.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: To allow for a low-overhead, hardware-assisted implementation of the approach, we make several key technical and engineering decisions in the de.nition of our technique.
Sentence 2: we use a con.gurable, low number of reusable taint marks instead of a unique mark for each area of memory allocated, which reduces the overhead of the approach without limiting its .exibility and ability to target most memory-related faults and attacks known to date.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: 16 } 16 }  3.3 Implementing PageRank On Multi-GPUs Based on the strategy of paralleling PageRank computation on graphics card as mentioned above, we need to divide data (the web graph) into GPUs to execute the algorithm on multi-GPUs system.
Sentence 2: we aim to distribute computing PageRank values on multiple GPUs for take advantage of GPUs computing power of the system as well as gain more speed up.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Moreover, determining such tra.c classes and the associated demands requires a global view of the network, something hard to obtain in practice.
Sentence 2: even the problem of determining the in­puts of the OCBR problem, i.e., the tra.c classes with their associated demands, during the period of observation .t, is intractable if we consider the entire network as a whole.
Relationship: entailment