sadat2307/MSciNLI huggingface dataset:
Domain: Hardware
Sentence 1: While CSE preserves the cluster structure through the conversion from a proximity representation to a Euclidean vector representation (e.g., the cluster structure is preserved between E1 and P1 , between E2 and P2, and so on), the k-means cost function in the original feature space O1 would also be identical to the cost function of pairwise clustering in the proximity matrix derived using Euclidean distance P1 [19].
Sentence 2: applying k-means clustering in E1 is equivalent to applying k-means clustering in O1.
Relationship: reasoning
Domain: Hardware
Sentence 1: In fact, the classification accuracy based on the base features plus the two kPCA ­based features (LOF value and the first dimension of the embedded space) never surpasses the classification accuracy based on the base features only, in the range we searched for an optimal pair of SVM parameters [18].
Sentence 2: including both subsets of the proximity based features for classification could lead to a significantly greater test escape detection rate than including either of the subsets alone.
Relationship: contrasting
Domain: Hardware
Sentence 1: The idea is to generate an emulated test escape pool such that the corresponding test items of those hidden failing measurements are widely spread among a large number of test items and no single test item can directly detect a large number of emulated test escapes.
Sentence 2: we identified test items that hiding each of them would cause an increase of test escape rate by more than 50PPM to test escapes, and removed the test escapes created by hiding these test items from the emulated test escape pool.
Relationship: reasoning
Domain: Hardware
Sentence 1: In uniform TSV placement, f-TSVs are placed uniformly, and they are considered as placement obstacles when logic cells (IP blocks) are placed in the 3D placement stage.
Sentence 2: in non-uniform TSV placement, the f-TSVs are added to the 3D netlist as TSV cells, and then placed with the logic cells (IP blocks) simultaneously during 3D placement.
Relationship: contrasting
Domain: Hardware
Sentence 1: For the uniform case, since the locations of f-TSVs are determined before logic cells are placed, s-TSVs and the supporting infrastructure (i.e., MUXes and wires) can be inserted right after f-TSV planning but prior to the placement of the logic cells and detailed routing [15].
Sentence 2: it is not necessary to consider the whitespace constraint during s-TSV allocation.
Relationship: reasoning
Domain: Hardware
Sentence 1: To understand how this can be done, note that each router includes a base address register (BAR) which is used to route messages for specific destinations.
Sentence 2: one of the routers in the proposed path, Router0 is connected to the CPU; the BARs in this router are subject to potential overwrite by the host operating system, which can consequently redirect a message passing through Router0 to a different destination.
Relationship: contrasting
Domain: Hardware
Sentence 1: SynchroTrace requires generating traces once for each thread count (i.e. a trace for each 2, 4, 8, 16, 32, and 64 threads per benchmark) and has a total compute time on the order of 100 years.
Sentence 2: the area of these design configurations is calculated with Cacti 6.5 [22] for the caches and Orion 2.0 [23] for the NoC using the 65nm technology.
Relationship: neutral
Domain: Hardware
Sentence 1: IA cores are simulated at 2.0 GHz.
Sentence 2: the simulation is partitioned into multiple threads across the irregular line a Simics thread representing the base platform with the IA core, uncore, system memory, Peripheral Control Hub (PCH), network interface and the South bridge components needed to boot the platform, and one or more SystemC threads each running a SystemC device model as part of the VP.
Relationship: neutral
Domain: Hardware
Sentence 1: Most typically, the number of chemical species and reactions are much smaller than the number of possible states and transitions between these states.
Sentence 2: in the stochastic chemical kinetics formalism, both the sparsity of possible transitions between the states, and more importantly, the special structure of these transitions caused by a small set of reactions, are exploited to arrive at a very compact representation for a MC that may be otherwise very unwieldy to deal with.
Relationship: entailment
Domain: Hardware
Sentence 1: Our merging is more powerful than BRMap’s packing [8], since BRMap only packs operations from if-path and elsepath of ITE guarded by an identical predicate.
Sentence 2: operations in the loop kernel updating the same variable may be predicated by various of combinations of predicates when confront nested ITE (NITE) (see figure 6). 
Relationship: contrasting
Domain: Hardware
Sentence 1: For each rip-up path, it has to be decided where it should be ripped up following the objectives (B)-(E).
Sentence 2: the following algorithm was implemented: In order to achieve a rip-up of current mirrors like it would be done in a handcrafted design (see Fig. 6), current mirrors are detected by a structure recognition method [14], [15], [11].
Relationship: reasoning
Domain: Hardware
Sentence 1: When receiving the response, NIC inspects the SSV of the response to check if the response is sent from the latest data owner.
Sentence 2: the response is confirmed to be valid if there is no preceding write request for the cache line which is not snooped in the SSV from the response(Accordingly, the SSV only needs to provide the snooping status for preceding requests.).
Relationship: entailment
Domain: Hardware
Sentence 1: Outgoing coherence request from the local processor is kept at the outgoing request buffer (oRB) until it receives the data response and completes coherence operation.
Sentence 2: the response is confirmed to be valid if there is no preceding write request for the cache line which is not snooped in the SSV from the response(Accordingly, the SSV only needs to provide the snooping status for preceding requests.).
Relationship: neutral
Domain: Hardware
Sentence 1: Cache coherence defines memory access ordering for the same memory location by two constraints: (1) write must be eventually seen by other processors; (2) writes to the same location must be seen in the same order by all processors.
Sentence 2: to show the generality of our proposed Ordered-NoC
platform, we applied it to MPSoC designs running atop two different topologies (2D-mesh and butterfly fat tree) and supporting two alternative memory models, total store order(TSO) and relaxed memory consistency.
Relationship: neutral
Domain: Hardware
Sentence 1: However, a fixed length LFSR as used in [12], [13] lacks the flexibility of varying distribution of the sequences according to cubes, which causes stimuli repetition.
Sentence 2: a dynamic LFSR is designed based on it, and we select ξ (defined in Equation 2 from Section III) to control the behaviour of the dynamic LFSR as a degenerated ξ-bit LFSR, as detailed next.
Relationship: reasoning
Domain: Hardware
Sentence 1: For the naÂ¨ive method, there are no scalability issues, and the selection algorithm is simply to pick the hardest-to-cover CMs greedily.
Sentence 2: as noted earlier, the naÂ¨ive method miscalculates the probability of full coverage, so if we wanted a probability of greater than 98%, the naÂ¨ive computation often suggests including all or almost all CMs.
Relationship: contrasting
Domain: Hardware
Sentence 1: As the logic function for cells was not known in the original ICCAD-2012 contest benchmarks, the methodology in [15] created a (unverified) mapping to standard cells based on their sizes and pin counts.
Sentence 2: a given cell would be mapped to a cell type that has the same input/output pin counts and the same or slightly smaller width in the given cell library.
Relationship: entailment
Domain: Hardware
Sentence 1: If the reference count is more than two, proposed algorithm regards the page as a hot page and the page is migrated to the MRU position of DRAM [Figure 2d].
Sentence 2: clean pages on PCM are not migrated to DRAM even if its reference count is more than two because read latency of PCM is similar to that of DRAM [Figure 2e].
Relationship: contrasting
Domain: Hardware
Sentence 1: Meanwhile, the LEA will encrypt all candidate jmp destinations and triggers jmp decryption while executing jmp instructions, but some instructions at candidate destination addresses of jmp may also be executed sequentially (e.g. do-while or if-statement alone) without being the des­tination of the jmp.
Sentence 2: recent research aim at balancing the tradeoff between security and such overheads [8-12] by revising the software or modifying processor’s instruction set architecture (ISA).
Relationship: neutral
Domain: Hardware
Sentence 1: Dynamically updating the key would make the attack be harder since attackers must focus on each chip to launch an attack due to the uniqueness of PUF key for each chip, and even though the attackers can get the key luckily, but the key may be updated at regular intervals.
Sentence 2: a successful attack on a chip cannot be easily applied to another one due to the dynamic key.
Relationship: entailment
Domain: Hardware
Sentence 1: In practical systems, N-point DFT is usually performed with the Fast Fourier Transformation (FFT) algorithm, which enables significant reduction in computing complexity from O(N2) to O(NlogN).
Sentence 2: from the perspective of hardware design, the computation-intensive FFT is still a resource-hungry block since an N-point FFT requires 0.5NlogN complex multiplications and NlogN complex additions, which cause very high hardware resource consumption in large N cases.
Relationship: contrasting
Domain: Hardware
Sentence 1: The reason is that industry is urgently exploring beyond-silicon and beyond-CMOS device, interconnect and memory options, as well as heterogeneous, More-than-Moore integration and packaging technologies, in order to maintain Moore s-Law scaling of integration value.
Sentence 2: silicon photonics stands out as the most promising technology to overcome the limitations of electronic interconnects as the system scale increases.
Relationship: entailment
Domain: Hardware
Sentence 1: Inspired by the recent advances of transfer learning, we propose a transfer learning based DSE framework TrDSE to build a more efficient and effective predictive model for the target program with only a few simulations by borrowing knowledge from previous programs.
Sentence 2: trDSE includes two phases: 1) clustering the programs based on the proposed orthogonal array sampling and the distribution related features, and 2) with the guidance of clustering results, predicting the responses of configurations in design space of the target program by a transfer learning based regression algorithm.
Relationship: entailment
Domain: Hardware
Sentence 1: Moreover, it offers the chance to considerably enhance the credibility of judged sports known to suffer from biased evaluation [28]: to prevent controversies and allegations of subjectivity or even fraud, it is reasonable to include objective measures whose output cannot be manipulated in the final performance scores.
Sentence 2: the creation of autonomous machine intelli­gence that retrieves and classifies style information from an easily accessible stream of motion data appears an important future issue in affected sports.
Relationship: reasoning
Domain: Hardware
Sentence 1: For that, we needed a known resting point in the world frame, but only had inertial data in the local and moving racket frame.
Sentence 2: the intention of this approach is not to provide an exact description of racket movements resulting in accurate ball properties, but to proof that it is possible to apply different assumptions and simplifications for unknown occurrences to estimate the ball speed and spin shortly after impact.
Relationship: contrasting
Domain: Security and privacy
Sentence 1: When a transmission is corrupted, the sender is aware of this event and it sends a rewind symbol ‘←’ on the next time it has the right to speaks.
Sentence 2: when the order of speaking is fixed (say, alternating), the parties “lose” one slot: while we would like the sender to repeat the transmission that was corrupted, the receiver is the next party to speak after the round where the ‘←’ symbol is sent.
Relationship: contrasting
Domain: Security and privacy
Sentence 1: In an attempt to construct two-pass leakage-resilient AKE protocols based on the eCK model, three models and pro­tocols have been proposed: The first formalization was the Moriyama-Okamoto (MO) model [8] which allows bounded amount of leakage.
Sentence 2: adversary: The adversary M is a probabilistic polyno­mial time (PPT) algorithm which controls all interaction and communication between parties.
Relationship: neutral
Domain: Security and privacy
Sentence 1: The difference between the two is that the first one compares all signatures with each page of memory, whereas the second one scans memory byte-by-byte, reading 32-bits at a time, and identifies more relevant signatures that can be matched with the page.
Sentence 2: we would expect the second approach to be more efficient for working with a large number as it shifts the primary dependence of processing time from the number of signatures to the size of pages.
Relationship: reasoning
Domain: Security and privacy
Sentence 1: Unlike prior work, which relies heavily on deep manual analysis and results in fragile methods that are not guaran­teed to work on newer versions, CodeIdenti.er presents a fully automated solution that is fast, accurate, and robust.
Sentence 2: second, it identifies the kernel code the PGD is used to make clusters of the similar read-only pages, assum­ing that the kernel-code pages are read-only for code pro­tection.
Relationship: neutral
Domain: Security and privacy
Sentence 1: Android applications are formed by logically separated components that mainly communicate with each other through Intents, which carry data and request the execution of a procedure to another application.
Sentence 2: the Android Intent Passing mechanisms do not provide the receiving component with any information concerning the origin of an intent, thus facilitating the creation of spoofed intents with malicious input data [1, 2].
Relationship: contrasting
Domain: Security and privacy
Sentence 1: The first party would be the DM, preferably an always-on desktop computer secured with the enterprise; the second party would be the DC, a mobile device that would need access to cloud-based data from any location; and the third party would be a third-party Keying as a Service Provider (KaaSP).
Sentence 2: our proposed system does allow for a threshold of at least 2 parties with minimal overhead.
Relationship: contrasting
Domain: Security and privacy
Sentence 1: Larger keys, however, will not solve all the problems because as more devices can handle sufficiently large keys, and more employees migrate their work to mobile devices such as smart phones, the total number of keys that an organization has to manage may continue to increase.
Sentence 2: even though more devices will be able to use longer key lengths, the total number of keys may also become unmanageable for businesses as each employee's device is given its own unique key.
Relationship: entailment
Domain: Security and privacy
Sentence 1: Bearing this assumption in mind, we would like to understand if there are still deficiencies in the malware scan (malScan) mecha­nism itself that can cause potential hazards.
Sentence 2: our research sheds the light on the impor­tance of taking the secure and preventive design strategies for AVD or other mission critical apps for fast-evolving mobile-systems.
Relationship: neutral
Domain: Security and privacy
Sentence 1: Although ad hoc distribution has a 100 device install limit, hackers can rename the Bundle name of the app, iTunes will then treat the renamed app as a new app with another 100 device limitation.
Sentence 2: hackers can use this method to attract customers to download free pirated apps which are not free in Apple Store from their third–party markets, and then use advertisement to gain money. 
Relationship: reasoning
Domain: Security and privacy
Sentence 1: And the cost of each simulation is in proportional to the size of circuits, i.e., the number of gates and interconnects [25].
Sentence 2: on a modern PC with an Intel 3.6GHz CPU, it takes nearly an hour on a circuit with about 25, 000 logic gates to perform 64, 000 Monte Carlo simulations [7].
Relationship: entailment
Domain: Security and privacy
Sentence 1: Consequently, it is only possible to have a fast and complete addition law when a = -1 is a square in the underlying prime field Fp, which is the case if and only if p ≡ 1 mod 4.
Sentence 2: a MoTE curve can only be generated over a prime field Fp whose order is congruent to 1 modulo 4 [6, 16].
Relationship: entailment
Domain: Security and privacy
Sentence 1: In 2004, Gura et al [7] published a now-classical paper in which they demonstrated that, in contrast to conventional wisdom, strong PKC is feasible for small battery-powered sensor nodes.
Sentence 2: they showed that Elliptic Curve Cryptography (ECC) [8], when carefully implemented and optimized, is computationally less costly than was believed at that time.
Relationship: entailment
Domain: Security and privacy
Sentence 1: All previous implementations of ECC for MSP430 processors used either a conventional Weierstraß curve (e.g. [20, 23, 27]) or a Montgomery curve of unreasonably large order (e.g. [10]), both of which wastes execution time and, thus, energy.
Sentence 2: our software supports Montgomery and Edwards curves over a 159 and a 191-bit prime field, which represents a good compromise between performance and security.
Relationship: contrasting
Domain: Security and privacy
Sentence 1: SafeCurves requires f to be at least 2200, in which case computing the ECDLP is infeasible with today's technology.
Sentence 2: a so-called pseudo-Mersenne prime has the form p = 2k - c where c is small in relation to 2k; typically, c is chosen to fit into a register of the target processor.
Relationship: neutral
Domain: Security and privacy
Sentence 1: Most closely to our approach is Aurasium [39], as it deploys a similar redirection technique: it overwrites entries of the global offset table (GOT) – that holds runtime addresses of lazy and non-lazy symbols – with the start address of policy check functions.
Sentence 2: in contrast to XiOS, it does not provide any mechanism to hide the actual runtime addresses in a shadow table.
Relationship: contrasting
Domain: Security and privacy
Sentence 1: Although PiOS revealed that many apps leak the device ID to application developers, it cannot detect Jekyll-like attacks [35] where the malicious behavior is only triggered at runtime.
Sentence 2: moCFI [15] and PSiOS [37] could potentially prevent the mentioned attacks by enforcing control-flow integrity (CFI) and fine-grained sandboxing policies.
Relationship: contrasting
Domain: Security and privacy
Sentence 1: Davi et al. [18] conduct a systematic security analysis of the recently proposed CFI solutions including kBouncer [40], ROPecker [13], CFI for COTS binaries [58], ROPGuard [23], and Microsofts’ EMET tool [36].
Sentence 2: they derive a combined CFI policy that, for each type of indirect indirect branch and behavioral heuristic (e.g., the number of instruction executed between two indirect branches), uses the most restrictive setting among the aforementioned policies.
Relationship: entailment
Domain: Security and privacy
Sentence 1: If such sensitive information is leaked out of the browser without protection, it can be used by unauthorized parties to illegally access users' online accounts, steal their online identities, or track their online behaviors.
Sentence 2: because the execution traces only contain the call relations and do not contain any information from users, they can also be shared (e.g., in a repository along with the extensions)among the analysts to further cover more execution paths of the extension.
Relationship: neutral
Domain: Security and privacy
Sentence 1: Thus even if the user Ui enters his/her wrong password and/or wrong identification, which may be the identification of another registered user, by mistake, both the login phase and authentication phase are still continued, and finally, at the end of authentication phase, S rejects the Ui login request. 
Sentence 2: it causes unnecessary extra communication and computational overheads during the login and authentication phase.
Relationship: reasoning
Domain: Security and privacy
Sentence 1: In case, such signals are transmitted in analog from, recovery must be possible from the analog form, presumably at a minimum after the signal has been attenuated, distorted and transformed in the process of transmission and reproduction.
Sentence 2: in the case of analog video signals with their high bandwidth requirements, the recovery must then either be possible given only a very limited high fidelity recording of the original signal, or from a significantly lower bandwidth recording at a later stage.
Relationship: entailment
Domain: Security and privacy
Sentence 1: One advantage of the SNARK-based scheme is that a signature can be verified very efficiently, independently of the complexity of the computation f being verified, as long as f has a short Turing-Machine description.
Sentence 2: in this work, we will only get efficient verifi­cation in an amortized sense, when verifying a compu­tation f over many different datasets.
Relationship: contrasting
Domain: Security and privacy
Sentence 1: Second, for concrete­ness we chose our construction to be in the Turing Machine model, however, we believe it could be fairly easily adjusted to a different model such as RAM by simply letting the next position be a function of the state into [0, S-1] as opposed to moving the head position.
Sentence 2: our proof struc­ture would remain the same with this minor change to the construction.
Relationship: entailment
Domain: Security and privacy
Sentence 1: The first block of declarations (lines 1-11) specifies the attributes of users, resources, and terminals. 
Sentence 2: the user attributes are organization and clearance (line 8): the former contains the name of the organization to which the user belongs, for simplicity, only two values are considered (line 7); the latter is the user clearance level (line 1). 
Relationship: entailment
Domain: Security and privacy
Sentence 1: 3.5 Commune: Protocol specification Recall that Commune leverages a shared repository, which is an abstraction of the owners storage space on S. The shared repository uses a versioning system so that content cannot be overwritten but only new content can be added.
Sentence 2: commune optimizes performance by splitting a file in smaller units, and encoding/decoding each unit sep­arately.
Relationship: entailment
Domain: Security and privacy
Sentence 1: Similarly, the CP-ABE KeyGen operation requires less than 2 s to be executed.
Sentence 2: adopting a security level of 112 or 128 bits, the time overhead imposed by CP-ABE on Android smartphone is much higher, while we argue being still usable for non-interactive applications (e.g., encrypted data to be uploaded to a cloud storage service).
Relationship: contrasting
Domain: Security and privacy
Sentence 1: As it is shown, the middle plot performed at the selected write duty-cycle, Writeb, has a 50.15% average fractional Hamming weight, indicating that the PUF is perfectly unbiased.
Sentence 2: the top plot performed at Writea has a higher average fractional Hamming weight, due to a longer write duty-cycle which results in fewer write failures.
Relationship: contrasting
Domain: Security and privacy
Sentence 1: Our participants are somewhat uncomfortable with sharing some data with applications, particularly their contact information (62.3%), profile data (61%) or access to their messages or call data (60%).
Sentence 2: they expressed less discomfort providing access to their browser history (37.6%), Internet connectivity (38.5%) and calendar data (45.8%)(Kruskal-Wallis .2(8)=59.74, p<0.001).
Relationship: contrasting