text stringlengths 5 1.02k | source stringclasses 1
value |
|---|---|
"Cryptovirology-Other uses of cryptography-enabled malware-Apart from cryptoviral extortion, there are other potential uses of cryptoviruses, such as deniable password snatching, cryptocounters, private information retrieval, and in secure communication between different instances of a distributed cryptovirus." | large_corpus_distillation |
exceeded groups with a lower proportion of shared initials." | large_corpus_distillation |
"Shadow heap-Shadow merge-If |S|\u2264|C| , then extract and sort the |P| smallest elements from C , and merge this sorted list with S Replace the elements of S into their original positions in C Make a heap out of T Running time Again, let P denote the path, and T denote the subtree of the concatenated heap ... | large_corpus_distillation |
B\u2212g\u22c5B , so the total instance size is at least (1\u2212g)\u22c5B\u22c5(bI\u22121) . Therefore, FOPT\u2265(1\u2212g)\u22c5(bI\u22121) , so the optimal solution needs at least (1\u2212g)\u22c5(bI\u22121) bins. So bI\u2264OPT/(1\u2212g)+1=(1+g+g2+\u2026)OPT+1\u2264(1+2g)OPT+1 In particular, by taking g=1/n, ... | large_corpus_distillation |
"Jeep problem-Problem-In the travelers across the desert problem, the starting base has unlimited units of supplies. Each traveler can carry at most 1 unit of supplies at any time, and can travel 1 unit of distance on 1 unit of supplies. The other base is at m units of distance away. Contrary to the previous two proble... | large_corpus_distillation |
"Information Object Class (ASN.1)-Abbreviations-Abbreviations used throughout this article: ASN.1 Abstract Syntax Notation One IOC Information Object Class IOS Information Object Set IO Information Object SQL Structured Query Language PER Packed Encoding Rules BER Basic Encoding Rules IDL Interface Definition Language ... | large_corpus_distillation |
bound for such a convex sum is d4\u2212d2 from Carath\u00e9odory's theorem on convex sets, which merely costs more random dits." | large_corpus_distillation |
"K-NFB Reader-K-NFB Reader-The original version of the reader was composed of a digital camera and a PDA, which contained specialised OCR software and speech synthesizers to read the scanned material aloud. It was released at a price of $3,495.The software was later ported to the Symbian operating system, to be used on... | large_corpus_distillation |
"RSA (cryptosystem)-Operation-This works because of exponentiation rules: Thus the keys may be swapped without loss of generality, that is, a private key of a key pair may be used either to: Decrypt a message only intended for the recipient, which may be encrypted by anyone having the public key (asymmetric encrypted t... | large_corpus_distillation |
"Security and safety features new to Windows Vista-Exploit protection functionality-Function pointers are obfuscated by XOR-ing with a random number, so that the actual address pointed to is hard to retrieve. So would be to manually change a pointer, as the obfuscation key used for the pointer would be very hard to ret... | large_corpus_distillation |
"Part-of-speech tagging-History-More advanced (\"higher-order\") HMMs learn the probabilities not only of pairs but triples or even larger sequences. So, for example, if you've just seen a noun followed by a verb, the next item may be very likely a preposition, article, or noun, but much less likely another verb." | large_corpus_distillation |
"Cryptographic multilinear map-Definition-For n = 2 In this case, multilinear maps are mostly known as bilinear maps or pairings, and they are usually defined as follows: Let G1,G2 be two additive cyclic groups of prime order q , and GT another cyclic group of order q written multiplicatively. A pairing is a map: ... | large_corpus_distillation |
"Permutation polynomial-Quadratic permutation polynomials (QPP) over finite rings-Lemma: any polynomial {\\textstyle g(x)=a_{0}+\\sum _{0<i\\leq M}a_{i}x^{i}} defines a permutation for the ring Z/nZ if and only if all the polynomials {\\textstyle g_{p_{t}}(x)=a_{0,p_{t}}+\\sum _{0<i\\leq M}a_{i,p_{t}}x^{i}} defines t... | large_corpus_distillation |
"2.7: Solve Linear Inequalities\n\uf5dc Learning Objectives\nBy the end of this section, you will be able to:\nGraph inequalities on the number line\nSolve inequalities using the Subtraction and Addition Properties of inequality\nSolve inequalities using the Division and Multiplication Properties of inequality\nSolve i... | large_corpus_distillation |
"Concurrent computing-Prevalence-Concurrency is pervasive in computing, occurring from low-level hardware on a single chip to worldwide networks. Examples follow.\nAt the programming language level: Channel Coroutine Futures and promisesAt the operating system level: Computer multitasking, including both cooperative mu... | large_corpus_distillation |
"Chebyshev's inequality-Integral Chebyshev inequality-There is a second (less well known) inequality also named after ChebyshevIf f, g : [a, b] \u2192 R are two monotonic functions of the same monotonicity, then 1b\u2212a\u222babf(x)g(x)dx\u2265[1b\u2212a\u222babf(x)dx][1b\u2212a\u222babg(x)dx].\nIf f and g are of oppo... | large_corpus_distillation |
and are checked for integrity on arrival. Packets have definite boundaries which are honored upon receipt; a read operation at the receiver socket will yield an entire message as it was originally sent.\nNo congestion control \u2013 UDP itself does not avoid congestion. Congestion control measures must be implemented a... | large_corpus_distillation |
"Commercial vehicle-Classification-Commercial truck classification Commercial trucks are classified according to the gross vehicle weight rating (GVWR). Commercial vehicles are divided into 8 classes based upon the gross vehicle weight (GVW). The United States Department of Transportation classifies commercial trucks w... | large_corpus_distillation |
"Time-weighted return-Explanation-Why it is called \"time-weighted\" The term time-weighted is best illustrated with continuous (logarithmic) rates of return. The overall rate of return is the time-weighted average of the continuous rate of return in each sub-period.\nIn the absence of flows, End value start value \u00... | large_corpus_distillation |
"Control city-Control city-Different countries have different practices as far as focal points on directional signs are concerned, and the term control city is not used globally. Where a sign contains a number of destinations for a particular direction, not all of those destinations may be considered a control city. In... | large_corpus_distillation |
"Operator-precedence parser-Relationship to other parsers-Operator-precedence parsers are not used often in practice; however they do have some properties that make them useful within a larger design. First, they are simple enough to write by hand, which is not generally the case with more sophisticated right shift-red... | large_corpus_distillation |
"Definite clause grammar-Other uses-DCGs can serve as a convenient syntactic sugar to hide certain parameters in code in other places besides parsing applications.\nIn the declaratively pure programming language Mercury I/O must be represented by a pair of io.state arguments.\nDCG notation can be used to make using I/O... | large_corpus_distillation |
"Starvation (computer science)-Starvation (computer science)-When starvation is impossible in a concurrent algorithm, the algorithm is called starvation-free, lockout-freed or said to have finite bypass. This property is an instance of liveness, and is one of the two requirements for any mutual exclusion algorithm; the... | large_corpus_distillation |
"G-module-Examples-Given a group G, the abelian group Z is a G-module with the trivial action g\u00b7a = a.\nLet M be the set of binary quadratic forms f(x, y) = ax2 + 2bxy + cy2 with a, b, c integers, and let G = SL(2, Z) (the 2\u00d72 special linear group over Z). Define (g\u22c5f)(x,y)=f((x,y)gt)=f((x,y)\u22c5[\u03b... | large_corpus_distillation |
(i.e., fast and requiring few resources, such as memory or CPU capability), while breaking it requires an effort many orders of magnitude larger, and vastly larger than that required for any classical cipher, making cryptanalysis so inefficient and impractical as to be effectively impossible." | large_corpus_distillation |
"Blichfeldt's theorem-Computational complexity-A computational problem related to Blichfeldt's theorem has been shown to be complete for the PPP complexity class, and therefore unlikely to be solvable in polynomial time. The problem takes as input a set of integer vectors forming the basis of a d -dimensional lattice ... | large_corpus_distillation |
"Operators\nR\nRecall the standard arithmetic operators on discussed above.\nWe all know that sum is commutative and associative, and that product distributes over sum.\n1. Is difference commutative?\n2. Is difference associative?\n3. Does product distribute over difference?\n4. Does sum distributed over product?\nAnsw... | large_corpus_distillation |
"Jordan algebra-Derivations and structure algebra-A derivation of a Jordan algebra A is an endomorphism D of A such that D(xy) = D(x)y+xD(y). The derivations form a Lie algebra der(A). The Jordan identity implies that if x and y are elements of A, then the endomorphism sending z to x(yz)\u2212y(xz) is a derivation. Thu... | large_corpus_distillation |
"3-dimensional matching-Decision problem-Since it is possible that two or more nodes are left uncovered, we also need a \"garbage collection gadget\". It is shaped like a larger rose. It is made of several overlapping triplets, one for each vertex that can be left uncovered in the variable gadget. The number of such ga... | large_corpus_distillation |
always apply equally to IFLs. In fact, in recent IBM Z machines IFLs support simultaneous multithreading, a feature not available for general purpose processors." | large_corpus_distillation |
"Obfuscation (software)-Overview-The architecture and characteristics of some languages may make them easier to obfuscate than others. C, C++, and the Perl programming language are some examples of languages easy to obfuscate. Haskell is also quite obfuscatable despite being quite different in structure.\nThe propertie... | large_corpus_distillation |
"Document Definition Markup Language-Document Definition Markup Language-DDML began as XSchema, a reformulation of XML DTDs as full XML documents, so that elements and attributes, rather than declarations, could be used to describe a schema. As development continued, the name was changed to DDML, reflecting a shift awa... | large_corpus_distillation |
"Digital signature-History-In 1976, Whitfield Diffie and Martin Hellman first described the notion of a digital signature scheme, although they only conjectured that such schemes existed based on functions that are trapdoor one-way permutations. Soon afterwards, Ronald Rivest, Adi Shamir, and Len Adleman invented the R... | large_corpus_distillation |
"CPU cache-Cache hierarchy in a modern processor-Victim cache A victim cache is a cache used to hold blocks evicted from a CPU cache upon replacement. The victim cache lies between the main cache and its refill path, and holds only those blocks of data that were evicted from the main cache. The victim cache is usually ... | large_corpus_distillation |
"Troubleshooting-Multiple problems-Isolating single component failures that cause reproducible symptoms is relatively straightforward." | large_corpus_distillation |
"Costas array-Numerical representation-A Costas array may be represented numerically as an n\u00d7n array of numbers, where each entry is either 1, for a point, or 0, for the absence of a point. When interpreted as binary matrices, these arrays of numbers have the property that, since each row and column has the constr... | large_corpus_distillation |
"Dependence analysis-Dependence analysis-In compiler theory, dependence analysis produces execution-order constraints between statements/instructions. Broadly speaking, a statement S2 depends on S1 if S1 must be executed before S2. Broadly, there are two classes of dependencies--control dependencies and data dependenci... | large_corpus_distillation |
"Glossary of computer science-C-conditional Also conditional statement, conditional expression, and conditional construct.\nA feature of a programming language which performs different computations or actions depending on whether a programmer-specified Boolean condition evaluates to true or false. Apart from the case o... | large_corpus_distillation |
"Discounts and allowances-Types-Dealing with payment Prompt payment discount Trade discounts are deductions in price given by the wholesaler or manufacturer to the retailer at the list price or catalogue price. Cash discounts are reductions in price given to the debtor to motivate the debtor to make payment within spec... | large_corpus_distillation |
"Software map-Mapping software system example-Software maps \"combine thematic information about software development processes (evolution), software quality, structure, and dynamics and display that information in a cartographic manner\". For example: The height of a virtual building can be proportional to the comple... | large_corpus_distillation |
"Functional programming-Comparison to imperative programming-Efficiency issues Functional programming languages are typically less efficient in their use of CPU and memory than imperative languages such as C and Pascal. This is related to the fact that some mutable data structures like arrays have a very straightforwar... | large_corpus_distillation |
"Strong and weak typing-Definitions of \"strong\" or \"weak\"-For example, Aahz Maruch observes that \"Coercion occurs when you have a statically typed language and you use the syntactic features of the language to force the usage of one type as if it were a different type (consider the common use of void* in C). Coerc... | large_corpus_distillation |
"P3b-Theory-Another theory proposed by Kok proposed that the P3b reflects mechanisms involved in event categorization, or the process that leads to the decision about whether an external stimulus matches or does not match an internal representation of a specific category or stimulus. Categorization requires processes s... | large_corpus_distillation |
a given integer. Phrased as a decision problem, it is the problem of deciding whether the input has a prime factor less than k. No efficient integer factorization algorithm is known, and this fact forms the basis of several modern cryptographic systems, such as the RSA algorithm. The integer factorization problem is in... | large_corpus_distillation |
"Oriented matroid-Axiomatizations-(C2) (incomparable) For all if then or X=\u2212Y).\n(C3) (weak elimination) For all with an there is a such that and Z\u2212\u2286(X\u2212\u222aY\u2212)\u2216{e}." | large_corpus_distillation |
"Node influence metric-Node influence metric-In graph theory and network analysis, node influence metrics are measures that rank or quantify the influence of every node (also called vertex) within a graph. They are related to centrality indices. Applications include measuring the influence of each person in a social ne... | large_corpus_distillation |
Quadratic Forms over Fields, T.Y. Lam (2005, ISBN 978-0-8218-1095-8) 68 A Geometric Approach to Free Boundary Problems, Luis Caffarelli, Sandro Salsa (2005, ISBN 978-0-8218-3784-9) 69 Curves and Surfaces, Sebasti\u00e1n Montiel, Antonio Ros (2009, 2nd ed., ISBN 978-0-8218-4763-3) 70 Probability Theory in Finance: A Mat... | large_corpus_distillation |
"Sentence processing-Theories-Good enough theory The good enough approach to language comprehension, developed by Fernanda Ferreira and others, assumes that listeners do not always engage in full detailed processing of linguistic input. Rather, the system has a tendency to develop shallow and superficial representatio... | large_corpus_distillation |
"Hicksian demand function-Hicksian demand function-Mathematically, arg min x\u2211ipixi subjecttou(x)\u2265u\u00af .where h(p,u) is the Hicksian demand function, or commodity bundle demanded, at price vector p and utility level u\u00af . Here p is a vector of prices, and x is a vector of quantities demanded, so the su... | large_corpus_distillation |
"Crowds (anonymity network)-Security analysis-Since the probability that the user's jondo ultimately submits the request is 1/n where n is the size of the crowd when the path was created. Thus we learn that the probability that the eavesdropper learns the identity of the receiver decreases as a function of crowd size. ... | large_corpus_distillation |
"Dow Jones FXCM Dollar Index-Components and Methodology-Simple Methodology: Whereas the USDX uses a weighted geometric mean formulation, USDOLLAR uses a weighted arithmetic mean formulation, which is a much more straightforward weighting of four equal parts that is left to run as the currencies fluctuate. This makes it... | large_corpus_distillation |
"Dining philosophers problem-Solutions-The following source code is a C++11 implementation of the resource hierarchy solution for five philosophers. The sleep_for() function simulates the time normally spent with business logic." | large_corpus_distillation |
"Euclidean vector-Representations-Decomposition or resolution As explained above, a vector is often described by a set of vector components that add up to form the given vector. Typically, these components are the projections of the vector on a set of mutually perpendicular reference axes (basis vectors). The vector is... | large_corpus_distillation |
the random oracle is replaced with an artificial cryptographic hash function; in particular, Fiat-Shamir schemes can be attacked.\nThere are unobfuscatable circuits in TC0 (that is, constant-depth threshold circuits).\nThere are unobfuscatable sampling algorithms (in fact, these cannot be obfuscated approximately).\nTh... | large_corpus_distillation |
G. Now fix some x \u2208 G. Without loss of generality, we may assume that h(x) \u2265 0 (otherwise, choose \u2212x instead). Then, letting n = h(x) + 1, since G is a divisible group, there exists some y \u2208 G such that x = ny, so h(x) = n h(y). From this, and 0 \u2264 h(x) < h(x) + 1 = n, it follows that 0\u2264h(x... | large_corpus_distillation |
"Shannon\u2013Hartley theorem-Statement of the theorem-The Shannon\u2013Hartley theorem states the channel capacity C , meaning the theoretical tightest upper bound on the information rate of data that can be communicated at an arbitrarily low error rate using an average received signal power S through an analog comm... | large_corpus_distillation |
"Empty string-Formal theory-Formally, a string is a finite, ordered sequence of characters such as letters, digits or spaces. The empty string is the special case where the sequence has length zero, so there are no symbols in the string.\nThere is only one empty string, because two strings are only different if they ha... | large_corpus_distillation |
"Side-channel attack-Examples-A timing attack watches data movement into and out of the CPU or memory on the hardware running the cryptosystem or algorithm. Simply by observing variations in how long it takes to perform cryptographic operations, it might be possible to determine the entire secret key. Such attacks invo... | large_corpus_distillation |
"Techmeme-Technology-Techmeme works by scraping news websites and blogs, and then compiles a list of links to the most popular technology-related news of the day, which is continuously updated. The stories selected are chosen primarily by an automated process. The service is fed a list of websites, and then it finds ot... | large_corpus_distillation |
"Sequence alignment-Pairwise alignment-Word methods Word methods, also known as k-tuple methods, are heuristic methods that are not guaranteed to find an optimal alignment solution, but are significantly more efficient than dynamic programming. These methods are especially useful in large-scale database searches where ... | large_corpus_distillation |
"Slender group-Examples-Every free abelian group is slender.\nThe additive group of rational numbers Q is not slender: any mapping of the en into Q extends to a homomorphism from the free subgroup generated by the en, and as Q is injective this homomorphism extends over the whole of ZN. Therefore, a slender group must ... | large_corpus_distillation |
"Randomness extractor-Formal definition of extractors-Definition (Strong Extractor): A (k,\u03f5) -strong extractor is a function Ext :{0,1}n\u00d7{0,1}d\u2192{0,1}m such that for every (n,k) distribution X the distribution Ext (X,Ud) (the two copies of Ud denote the same random variable) is \u03f5 -close to the ... | large_corpus_distillation |
"Toi (programming language)-Specification-In the previous section, the notion of Namespace levels was introduced. Much like how names are scoped, generic variable containers must communicate their scope in terms of location within a given set of scopes. This is what is called 'Ownership'. In a given runtime, variable c... | large_corpus_distillation |
"Reduction strategy-Lambda calculus-Optimal reduction Optimal reduction is motivated by the existence of lambda terms where there does not exist a sequence of reductions which reduces them without duplicating work. For example, consider ((\u03bbg.(g(g(\u03bbx.x)))) (\u03bbh.((\u03bbf.(f(f(\u03bbz.z)))) (\u03bbw.(h(w(\u... | large_corpus_distillation |
were only able to request an entire document. By allowing byte-serving, clients may choose to request any portion of the resource. One advantage of this capability is when a large media file is being requested, and that media file is properly formatted, the client may be able to request just the portions of the file kn... | large_corpus_distillation |
"Determining the number of clusters in a data set-Information\u2013theoretic approach-Putting the results above together, it can be seen that for sufficiently high values of p, the transformed distortion dK\u2212p/2 is approximately zero for K < G, then jumps suddenly and begins increasing linearly for K \u2265 G. The... | large_corpus_distillation |
the location of the extent in which the directory is recorded, the length of any extended attributes associated with the directory, and the index of its parent directory path table entry." | large_corpus_distillation |
Median income by U.S. county includes values between US$20,000 and $150,000, it could be broken into three classes at thresholds of $45,000 and $83,000. To avoid confusion, any classification rule should be mutually exclusive and collectively exhaustive, meaning that any possible value falls into exactly one class. For... | large_corpus_distillation |
Y.\n3. Are X and Y independent?\nAnswer\n1. X has PDF g given by g(x)= 1 for x\u2208{1,2,3} (the uniform distribution on {1,2,3}).\n3\n\u23a7\u23aa\u23aa 1\n1\n1\n8\n, 0<y<1\n2. Y has PDF h given by h(y)=\u23a8 5 , 1<y<2 .\n\u23a9\u23aa\u23aa 1\n2\n8\n, 2<y<3\n18\n3. X and Y are dependent.\nSuppose that P takes values ... | large_corpus_distillation |
"GStreamer-History and development-All release series, the project face difficulties. Every series is not very popular in the Linux community mostly because of stability issues and a serious lack of features compared to competing projects like Xine, MPlayer, and VLC. The project also suffers a lack of leadership as Wim... | large_corpus_distillation |
parameters k= 1 3 and p= 1 4. Compute each of the following:\n1. P(W \u22642)\n2. E(W)\n3. var(W)\nAnswer\n11.4.10 https://stats.libretexts.org/@go/page/10236" | large_corpus_distillation |
"High-level synthesis-History-This technique reduces the task of optimally scheduling operations into different pipeline stages while minimizing registers, which is naively an integer linear programming problem, to a linear programming problem, by making use of the fact that the constraint matrix is totally unimodular.... | large_corpus_distillation |
"Intuitive criterion-Background-There exists a belief such that the punishing action is optimal for the receiver.While this satisfies the definition of PBE, the receiver belief might be \"unreasonable\". The intuitive criterion, like most refinement techniques, is based on restricting the beliefs off the equilibrium pa... | large_corpus_distillation |
"Association rule learning-Algorithms-To illustrate this, let there be a frequent itemset {a, b, c}. a DFS may check the nodes in the frequent itemset lattice in the following order: {a} \u2192 {a, b} \u2192 {a, b, c}, at which point it is known that {b}, {c}, {a, c}, {b, c} all satisfy the support constraint by the do... | large_corpus_distillation |
"Document-oriented database-Documents-Document databases typically provide for additional metadata to be associated with and stored along with the document content. That metadata may be related to facilities the datastore provides for organizing documents, providing security, or other implementation specific features." | large_corpus_distillation |
"Morphological typology-Synthetic languages-There are two subtypes of synthesis, according to whether morphemes are clearly differentiable or not. These subtypes are agglutinative and fusional (or inflectional or flectional in older terminology)." | large_corpus_distillation |
This drawback however is virtually eliminated on modern 64-bit architecture." | large_corpus_distillation |
"Register allocation-Context-Principle In many programming languages, the programmer may use any number of variables. The computer can quickly read and write registers in the CPU, so the computer program runs faster when more variables can be in the CPU's registers. Also, sometimes code accessing registers is more comp... | large_corpus_distillation |
"Email authentication-Nature of the problem-The path depicted below can be reconstructed on the ground of the trace header fields that each host adds to the top of the header when it receives the message: It is important to realize that the first few lines at the top of the header are usually trusted by the recipient. ... | large_corpus_distillation |
"Priority queue-Priority queue-While priority queues are often implemented using heaps, they are conceptually distinct from heaps. A priority queue is an abstract data structure like a list or a map; just as a list can be implemented with a linked list or with an array, a priority queue can be implemented with a heap o... | large_corpus_distillation |
"Exponentiation by squaring-Computational complexity-Each squaring results in approximately double the number of digits of the previous, and so, if multiplication of two d-digit numbers is implemented in O(dk) operations for some fixed k, then the complexity of computing xn is given by log log log \u2061x)k)." | large_corpus_distillation |
"Caml-Examples-Discrete wavelet transform (pattern matching) The 1D Haar wavelet transform of an integer-power-of-two-length list of numbers can be implemented very succinctly in Caml and is an excellent example of the use of pattern matching over lists, taking pairs of elements (h1 and h2) off the front and storing th... | large_corpus_distillation |
"Backjumping-Backjumping at internal nodes-In practice, this algorithm is simplified by collecting all indices in a single set, instead of creating a set for every value of k . In particular, the algorithm collects, in each node, all sets coming from its descendants that have not been skipped by backjumping. When retr... | large_corpus_distillation |
that did not match, along with information on where to merge existing blocks into the recipient's version. This makes the copies identical." | large_corpus_distillation |
"Time-based one-time password-Time-based one-time password-Time-based one-time password (TOTP) is a computer algorithm that generates a one-time password (OTP) that uses the current time as a source of uniqueness. As an extension of the HMAC-based one-time password algorithm (HOTP), it has been adopted as Internet Engi... | large_corpus_distillation |
in {\\textstyle \\mathbf {X} _{i}} means that it is a random vector, not a random (univariate) variable. Then the sum of the random vectors will be and the average is and therefore The multivariate central limit theorem states that where the covariance matrix \u03a3 is equal to The rate of convergence is given by the... | large_corpus_distillation |
other via webcams, or talk directly for free over the Internet using a microphone and headphones or loudspeakers. Many applications allow file transfers, although they are usually limited in the permissible file-size. It is usually possible to save a text conversation for later reference. Instant messages are often log... | large_corpus_distillation |
"Matrix multiplication algorithm-Parallel and distributed algorithms-Shared-memory parallelism The divide-and-conquer algorithm sketched earlier can be parallelized in two ways for shared-memory multiprocessors. These are based on the fact that the eight recursive matrix multiplications in 11 11 12 21 11 12 12 22 21 11... | large_corpus_distillation |
"Lexical verb-Lexical verb-In linguistics a lexical verb or main verb is a member of an open class of verbs that includes all verbs except auxiliary verbs. Lexical verbs typically express action, state, or other predicate meaning. In contrast, auxiliary verbs express grammatical meaning. The verb phrase of a sentence i... | large_corpus_distillation |
one that has subtle problems. Depending on the compiler, the interleaving of threads by the scheduler and the nature of other concurrent system activity, failures resulting from an incorrect implementation of double-checked locking may only occur intermittently. Reproducing the failures can be difficult." | large_corpus_distillation |
and Cruickshank (1991) argued that the role of an explanation is to make some concept, procedure or rule plain and comprehensible. Brown and Armstrong (1984) operationally defined explanation as an attempt to provide understanding of a problem to others. This definition strengthens the view of Perrott (1982) who argued... | large_corpus_distillation |
"PowerLinux-PowerLinux versus Linux/x86-The April 2012 releases by IBM of PowerLinux were designed specifically to run the Linux OS on the company's POWER7-based systems. Unlike servers built on the Intel Xeon processor, an x86 descendant with two threads per core, the POWER7 processor provides four threads per core. P... | large_corpus_distillation |
"Burroughs large systems descriptors-Integration in memory architecture-ASN \u2013 this solution allows physically more memory to be configured in a system, divided into separately addressable chunks. This architecture became known as ASN (Address Space Number) memory. Memory is logically divided into two areas, alloca... | large_corpus_distillation |
"Libtorrent-Features-Merkle hash tree torrents This is BEP30 of the BitTorrent protocol. Merkle hash tree torrents is an extension that lets a torrent file only contain the root hash of the hash tree forming the piece hashes. The main benefit of this feature is that regardless of how many pieces there are in a torrent,... | large_corpus_distillation |
"Euclidean domain-Euclidean domain-In mathematics, more specifically in ring theory, a Euclidean domain (also called a Euclidean ring) is an integral domain that can be endowed with a Euclidean function which allows a suitable generalization of the Euclidean division of integers. This generalized Euclidean algorithm ca... | large_corpus_distillation |
"Product of rings-Properties-An element x in R is a unit if and only if all of its components are units, i.e., if and only if pi\u200a(x) is a unit in Ri for every i in I. The group of units of R is the product of the groups of units of the Ri.\nA product of two or more non-trivial rings always has nonzero zero divisor... | large_corpus_distillation |
neighborhood with large gradients in orthogonal directions - i.e., a corner." | large_corpus_distillation |
"Memory tester-Detected faults-Transient faults are hard to detect, and there are no well defined faults to detect. Errors in RAM introduced by transient faults are often called software errors, the following examples are possible factors that will contribute to transient faults: Cosmic ray (UV light) Alpha particle (D... | large_corpus_distillation |
"Dot (diacritic)-Dots-Overdot Language scripts or transcription schemes that use the dot above a letter as a diacritical mark: In some forms of Arabic romanization, \u0121 stands for ghayin (\u063a).\nThe Latin orthography for Chechen includes \u010b, \u00e7\u0307, \u0121, q\u0307, and \u1e8b." | large_corpus_distillation |
while still allowing recursion.\nIn the study of illative (deductive) combinatory logic, Curry in 1941 recognized the implication of the paradox as implying that, without restrictions, the following properties of a combinatory logic are incompatible: Combinatorial completeness. This means that an abstraction operator i... | large_corpus_distillation |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.