sadat2307/MSciNLI huggingface dataset:
Domain: Software and its engineering
Sentence 1: We suggest an integrated approach that protects the data while providing a built-in authentication system for the in­volved service providers to assess the authorization deci­sions.
Sentence 2: an e.ective solution can be given by a combination of Java policies for authentication, to manage the data protection using nested JARs, and map the access control rights in terms of programmable constraints.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: While Figure 11 shows how our system can effec­tively insert and remove instrumentations without incur­ring any performance penalties after class rede.nition, Fig­ure 12 shows that steady-state performance is comparable to a setting where an aspect is woven at load time with the standard AspectJ weaver on the standard Java Hot-SpotTM Server VM 1.6.0 23.
Sentence 2: we show val­ues for the execution of the benchmarks without any instru­mentation, and for the three combinations of pro.ling fea­tures (represented by three different aspects) described be­fore.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: By analogy with real data types, we impose the restrictions that there are only a .nite number of constructor names, and for any given constructor the length of the associated list is .xed.
Sentence 2: the .nite list of constructors will contain "Nil" (of arity 0) and "Cons" (of arity 2), with which we can model the lists of the previous section.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: This further implies that, when analysis is applied to models de­rived from designs or implementations of actual software systems, a model of the system as built is unlikely to be suitable for auto­mated analysis.
Sentence 2: compositional, hierarchical analysis (where state-space explosion is avoided by simplifying models of subsystems at several levels of abstraction) depend on the modular structure of the model to be analyzed.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Its parameters are a closure f and a value arg; its task is to simulate the application of the source function encoded by f to the source value encoded by arg, and to return its result.
Sentence 2: if [eDdenotes the image of the source expression e through defunctionalization, we intend to de.ne [e1 e2Das apply [e1D[e2D.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: SAs, SONs and BFs affecting either the checker in­put nodes (Xi,1i) or the transistors they drive), to satisfy the TSC property the checker requires the application of only two two-railed input words, out of all the possible 2n.
Sentence 2: such input code words must ensure that each (Xi,1i) couple (i= 1,...,n) assumes both (10) and (01) logic values.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: [10], such design of H makes it very di.erent from a monolithic random oracle, even if the compression function f is mod­eled as a .xed-length random oracle.
Sentence 2: the extension attack here is as follows: given y = H(M) for any unknown value M, one can easily compute the value y ' = H(M, M ' )= Cascade(M ' , f, y), for any su.x M ' .
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Code sizes for benchmarks (in kilo byte) Benchmark - Inline Fusion F/I barneshut 205.4 231.7 231.7 100% boyer 227.0 227.2 227.2 100% coresml 1.7 1.5 1.5 100% countgraphs 92.2 94.3 94.3 100% fft 36.6 37.7 37.7 100% knuthbendix 132.8 156.0 156.0 100% lexgen 243.3 295.6 295.6 100% life 51.3 62.6 62.6 100% logic 144.8 154.8 154.8 100% mandelbrot 8.4 8.3 8.3 100% mlyacc 1436.8 1641.6 1641.6 100% nucleic 636.2 583.3 583.3 100% ray 95.6 104.4 104.4 100% simple 263.5 347.7 347.7 100% tsp 70.8 78.5 78.5 100% vliw 794.6 941.3 944.9 100% benchmarks reported in this section are quite preliminary; we per­formed them only for verifying the above two points.
Sentence 2: we put almost no effort to tune the fusion algorithm against the compiler and the language.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: The developer introduced ELIDE modifiers to support a better factorization of the program: Each class became re-sponsible for its own persistence, but the similarities of per- sistence that crosscut those classes were captured in ELIDE modifiers.
Sentence 2: we defined read end vri1~e mod- ifiers to introspect on trace data type classes end to generate the appropriate read() end vzizeO methods to support persi-qtence.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: When a load/store is issued, some bits of the address (indicated in the load/store) are used to specify whether to go through the dTLB or whether to find the translation within a specific TR.
Sentence 2: one can use the top log n bits (where n-1 is the number of TRs) to indicate whether the address should go through the dTLB for a translation (which corresponds to all these log n bits being 0) or whether to take the physical frame number from a TR, and if so, which specific one.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: A service adapter is a specialized Web Service proxy, designed through the Adapter pattern, which adapts the contract of a particular service according to the contract (speci.ed by the de­veloper at design time) expected by the in-house components.
Sentence 2: we refer to ASC as an adapter that accommodates the actual contract of a service S to the contract expected by an in-house component C. an adapter carries the necessary logic to transform the operation signatures of the expected client interface to the actual interface of a selected Web Service.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Less ob­viously, pre.x-free encodings are often essential to ensure security of iterative constructions in cryptography, such as CBC-MAC [6] and cascade constructions [14, 4, 10, 20].
Sentence 2: pre.x-freeness gives the simplest provably-secure counter-measure to various forms of extension attacks on hash functions, message authentication codes and pseudo­random functions, as discussed in Appendix A.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Also, for the sake of space, we only report results for those thematic units that contribute to quantify the construct of clarification requests, namely Check Misunderstanding, Check Provisional, and Unknown categories.
Sentence 2: the Check Misunderstanding unit categorizes any utterance providing evidence that a previous message was not fully accepted (e.g., "Not sure I get your question ", "What?").
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Inbrief,these verypreliminaryexperimentsshowthefea­sibility of the proposed approach.
Sentence 2: it becomes very easyfor collective communicationdevelopersto re-use code as shown with thegridbroadcastoperation.For static application developers, the impact is very low as the usual collective operations canbeprovided.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Similarly, the weight of a data access edge is determined using the minimum and maximum message sizes (msgmin and msgmax) sent along with the maximum/minimum data rates (ratemin and ratemax) in the NoC communication channels.
Sentence 2: the lower msgmin bound can be expressed as lb = , whereas the upper bound ratemax msgmax is given as ub = .
Relationship: entailment
Domain: Software and its engineering
Sentence 1: As an executable architectural framework, re-ADA can directly be mapped into Ada95 code and constructed on the basis of CORBA to support distributed computing over-the-network.
Sentence 2: the well-formalized QIM through mapping dependability into quantitative attributes that are attached to architectural artifacts makes it possible to statically verify quantitative attributes during architectural design, and dynamically monitor them at runtime.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Second, we change the if -clause that contains merge(., .1), where .1 is now a pair of agree and disagree,to iterate over extensions of merge(., agree) that cover param­eters in disagree and check if the extension disagrees with some bindings in disagree.
Sentence 2: we change the single line if .2 = merge(., .1)=.badsubst in (2) and (4) to if .1 = merge(., agree)=.badsubst for .2 in extensions(.1, disagree) if merge(.2, disagree)= badsubst This reduces the time complexity to the same as that for the basic algorithm, for memoization, and for precomputa­tion, respectively, except with the factor substs replaced by substs ×2labelpars .
Relationship: entailment
Domain: Software and its engineering
Sentence 1: The resource consumed by a put is then naturally measured by the product of its size (in bytes) and its TTL.
Sentence 2: for the purposes of fairness in OpenDHT, a put of 1 byte with a TTL of 100 seconds is equivalent to a put of 50 45 6 5 4 20 3 15 2 10 Total Bytes*Seconds (MB*hours)  Total Storage (MB) 5 1 0 1 2 3 4 5 6 7 8 9 10 0 1 2 3 4 5 6 7 8 9 10 Time (hours) Time (hours) Figure 4: Non-starvation.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: 2.2 Pseudorandomness are many block ciphers that had once been considered safe and were subsequently broken, there exists a selection of them that suc­cessfully underwent a thorough peer-review process without being broken, and are generally considered to be trusted primitives.
Sentence 2: we found that a formal de.nition of pseudorandomness is essential for designing and evaluating a splittable P RN G. we found that the concept of pseudorandomness used in cryptography matches closely our goal of creating random-looking numbers, which we explain in this section.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: 5 While there exists a prototype implementation of a type-checking QuaFL compiler, it is still under development, so there is no de.nitive or complete collection of type inference rules at this time.
Sentence 2: variables that have quantum types must be used ex­actly once, but may be used as a form of control (corresponding to control qubits in logical quantum circuits) arbitrarily many times without restrictions.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: PLM is well defined for a wide range of products, processes and services but its standardization in many of the security processes, and in particular in processes that involve the use of mobile devices, appears to be still missing.
Sentence 2: a private or business organization cannot take part in the whole lifecycle management of a mobile device; the lifecycle begins with an OEM (Original Equipment Manufacturer) purchase and continues until its final disposal.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: The transferfunctionfora simple assignmentin copy mode is then Ident[v .. {e}].
Sentence 2: v must have the value of e after this assignment, while all other variables retain whatevervalues theyhadbefore theassignment.Intransfer mode, let Donor ={e}n V -{v} bethe set containingthe source variable(if any)ofthe assignment.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Direction: Angular relationships among character components Bezier Values: Mathematically derived points that capture shape of Figure 5 Examples of two types of features contained in graphs: Direction and Bezier Values When isomorphic graphs are aligned, a direct one-to-one correspondence between each geometric measurement comprising the feature vector can be established.
Sentence 2: when two graphs are identified through the isomorphic graph matching process, their feature vectors are also aligned and corresponding features can be compared in detail.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: A function is also a 5-tuple  that defines changes to a base tuple in terms of: refinements to a base state chart (.s)  refinements to a base action document (.a)  refinements to a base view document (.v)  refinements to a base actions business logic (.b)  refinements to a base jsp page (.j)  Suppose we want to synthesize the 5-tuple  of a portlet P by starting with a base portlet C (a constant) and refining it by the features (func­tions) F1 and F2.
Sentence 2: our portlet specification P is: P = F2 F1 C =   =<.s2 .s1 s, .a2 .a1 a, .v2 .v1 v, .b2 .b1 b, .j2 .j1 j> =  (13) the 5-tuple of our desired portlet is synthesized by composing the base state chart with its refinements, the base action document with its refinements, and so on [6].
Relationship: entailment
Domain: Software and its engineering
Sentence 1: There are also some projects, like Service-Oriented Architecture for De­vices (SOA4D), managed by Schneider Electric, or Web Services for Devices (WS4D) [17], managed by MATERNA and the univer­sities of Dortmund and Rostock, which provide DPWS stacks im­plemented in different programming languages.
Sentence 2: we selected the WS4D Java Multi Edition DPWS Stack (JMEDS) as it is compatible with both the Standard (J2SE) and Micro (J2ME CLDC) Editions of the Java platform, hence supporting a wide range of devices.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: The above analysis implies that: Feature (f.4) Foreachperiod Ii,1, it holds that ti,1 = I- i,1.
Sentence 2: i- Feature (f.5) Foreachperiod Ii,j , it holds that i,j = ti,j = I- + µ.. i,j It is also easy to infer that there must exist at least one bin bk satisfying k< i and ti,j <Ik +.Otherwise, ti,j would not be contained in any period Ik where k< i.bi would be the opened bin with the lowest index at time ti,j .
Relationship: entailment
Domain: Software and its engineering
Sentence 1: To ensure that those skipped log records can be identi.ed after a crash of the MSP, at orphan recovery end, in addition to truncating its position stream, the session writes an end-of-skip (or EOS) log record, which contains the LSN of the orphan log record just found.
Sentence 2: the EOS log record points back to the orphan log record.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: What we see then is that the Situation Abstraction that Dey and Abowd write about is more of a system-wide role fulfilled by a layer, rather than a reusable abstraction (al- though we note that the facade design pattern is a layer- like object [6, p. 185]).
Sentence 2: the situation of an entity is two stages of interpretation by the Situation Mod- eling layer.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Victim caches help with conflict misses, and in the previous subsection we discussed timekeeping metrics that can be used as reliable indicators of conflict misses, par- ticularly dead time and reload interval, t Here, we propose using these conflict indicators to manage the victim cache.
Sentence 2: we want to avoid entering items into the victim cache that are unlikely to be reused soon.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: For the same reasons as for synchronous method calls, it is convenient to interpret all rd permissions mentioned in a method speci.cation as representing the same permission amount.
Sentence 2: if a fork and its corresponding join occur in a scoped fashion (in the same method body), we would like to be able to express that we can match up the same permission amounts from corresponding rd predicates.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Our .nal experiments investigate the impact of in­accuracies in the estimates on Conventional and GreenVarPrices.
Sentence 2: we consider four scenarios of normally distributed in­accuracies for GreenVarPrices, our realworkloads, and theAverage week: (1) inaccuracies ranging between -20% and +20% with an average of 0%; (2) ranging between 0% and +20% with an average of +10%; (3) ranging between -20% and 0% with an average of -10%; and (4) ranging between -40% and 0% with an average of ­20%.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Besides, we intend to de.ne JTL transformations for more com­plex (existing) approaches [2], in order to investigate the aspects illustrated in Section 4.3.
Sentence 2: we are very interested to observe JTL at work in cases where the forward transformation is non-bijective and multiple architectural alternatives may result from the back propagation of changes.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: In addition to parallel threads that perform speculative computations, a main thread is used to coordinate their activities.
Sentence 2: the main thread as­signs speculative computations to parallel threads, speculatively copies-in data into the memories allocated to parallel threads, checks for misspeculations, and if no misspeculation occurs it copies-out the speculatively computed results from memories of parallel threads to the memory allocated to hold the non-speculative computation state.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Although there are sev­eral studies on simple core calculi for languages with depen­dent types such as for Scala and gbeta [27, 10, 14] such languages are typically more complex than the standard Java setting and more dif.cult to manage.
Sentence 2: the fact that nested types are accessed through a restricted set of ex­pressions raises subtle interactions with somewhat orthogo­nal aspects such as immutability of .elds and variables see Section 5 for a more detailed discussion.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: The technique proposed in this paper includes mechanisms in order to avoid the appearance of cliques of a degree higher than the number of PCs.
Sentence 2: the proposed technique features: heuristics to select the most appropriate decision (see Section 4.4.3), that takes into account the number of edges in the VCG to prevent this situation; and, a process to detect cliques based on a graph coloring scheme [4], applied after a decision has been studied by the deduction process and selected by the heuristics.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Sincethetypegiveninthe client moduledoes notmention save-.le and the class is unsealed by the time it is instan­tiated, sealing contracts do not catch this faulty method in­vocation.
Sentence 2: a method invocation from untyped code to typed code can be unsafe and must be rejected unless a contractprotects the method.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Error: An error is a situation, the condi­tions of which contradict the speci.cation.
Sentence 2: an error is always the same as a speci.­cation violation, i.e., if the situation does not comply with the preconditions or postconditions, as [4] states, e.g., if a tra.c light changes directly from green to red.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: 3.MAPPING SSE-CMM TO PATIENT-CENTERED HEALTHCARE DOMAIN 3.1 Objectives On one hand, mapping SSE-CMM process areas into the patient­centered healthcare domain enables us to develop a complete set of metrics for security and privacy risk assessment of PHR systems.
Sentence 2: such mapping helps us in establishing a set of metrics and/or criteria to evaluate the PHR systems security maturity levels either covered or uncovered by the imposed HIPAA regulations in the patient-centered healthcare domain.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: In the context of this paper, we focus on the de.nition of an ADL conforming to the principles of Component-Based Software Engineer­ing [8].
Sentence 2: we demonstrate that FraSCAla can be used to describe a generic component model, which can be incrementally re.ned towards a more concrete component model and ultimately a domain-speci.c component model.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: In particular, tree transducers are closed under sequential composition [27].
Sentence 2: there is an effective procedure that takes two (total, deterministic, top-down) tree transducers A (from F to G)and B (from G to H), and pro­duces a tree transducer C (from F to H) with [C] = [B] .
Relationship: entailment
Domain: Software and its engineering
Sentence 1: 5.2 The Decomposition Strategies Decomposition strategies aim at establishing the decomposition tree of a theatre by defining how variation point sets are partitioned and which controllers are assigned to nodes.
Sentence 2: a strategy consists of a collection of rules that are triggered by the occurrence of a scenario in a theatre and describes how this scenario can be resolved and exploited by D&#38;C. the strategies determine when and how theatres can be decomposed.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Then, we may attempt to merge state(x) with state(y).However, h(x) = h(y) may not imply h(x+ z) =h(y + z),where h is the objective function, because different conditional branches may be used to compute h(x + z) and h(y + z); thus, merging state(x) with state(y) will break the property in Lemma 4.3.
Sentence 2: we need to be careful about the branches in the objective function.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: The ability to pass communication channels between processes as any other value a phenomenon called name passing or channel mobility provides much expres­sive power to the language.
Sentence 2: it allows the concise en­coding of most known computational models and also introduces Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for pro.t or commercial advantage and that copies bear this notice and the full citation on the .rst page.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: 1.4 Our approach In short, we believe that the ideas behind wobbly types are good, but that they could and should be better presented and explained.
Sentence 2: one should clearly separate two subsystems: one that performs traditional type inference in the style of Hindley and Milner, and enjoys a principal types property, so that it produces types that are indeed insensitive to the order in which the inference algorithm traverses the tree, and one that performs local type inference, that is, ad hoc propaga­tion of explicit type annotations, either in Peyton Jones et al.
Relationship: entailment
Domain: Software and its engineering
Sentence 1: More interestingly, when t is not known beforehand, it is possible to build small-space streaming synopses over S to estimate such point-frequency moments to within E fac­tors of the corresponding stream moments.
Sentence 2: (we can estimate point-frequencies accurately in small space as long as they are large with respect to the overall (expected) count of ele­ments in the stream; these correspond to the typical streaming error guarantees for point estimation in the deterministic setting [7, 20].)
Relationship: entailment
Domain: Software and its engineering
Sentence 1: Multiple programmers are allowed to access and edit the same source code directory, and even the content of the same source code file at the same time, as follows: 1) One programmer s editing operations performed on source code directories (i.e., adding/deleting/renaming a directory or file) are immediately propagated and executed at all remote sites, as if the programmer is performing the same operations at all collaborating sites.
Sentence 2: changes on source code directories performed by any individual programmer are immediately and automatically made visible to all other col-laborating programmers.
Relationship: entailment