text
stringlengths 5
1.02k
| source
stringclasses 1
value |
|---|---|
"Augmented map-Interface-In addition to the interface for a standard ordered map, the augmented map should also support functions for range sums. In particular: aug_left (m,k) : returns the augmented value of all entries in m with keys no more than k aug_right (m,k) : returns the augmented value of all entries in m with keys no less than k aug_range (m,k1,k2) : returns the augmented value of all entries in m with keys in range [k1,k2] aug_val (m) : returns the augmented value of all entries in m .Some functions, although are not defined based on augmented values, can make use of augmented values to accelerate their algorithms. Usually, they would require some certain representation of augmented maps, and certain conditions for input parameters."
|
large_corpus_distillation
|
"Book Citation Index-Book Citation Index-The Book Citation Index (BCI, BKCI) is an online subscription-based scientific citation indexing service maintained by Clarivate Analytics and is part of the Web of Science Core Collection. It was first launched in 2011 and indexes over 60,000 editorially selected books, starting from 2005. Books in the index are electronic and print scholarly texts that contain articles based on original research and/or reviews of such literature."
|
large_corpus_distillation
|
"Mobile payment-Carrier billing-In comparison to premium short code programs which often exist in isolation, relationship marketing and payment systems are often integrated with CRM, ERP, marketing-automation platforms, and reservation systems. Many of the problems inherent with premium SMS have been addressed by solution providers. Remembering keywords is not required since sessions are initiated by the enterprise to establish a transaction specific context. Reply messages are linked to the proper session and authenticated either synchronously through a very short expiry period (every reply is assumed to be to the last message sent) or by tracking session according to varying reply addresses and/or reply options."
|
large_corpus_distillation
|
"Definable real number-Definable real number-Different choices of a formal language or its interpretation give rise to different notions of definability. Specific varieties of definable numbers include the constructible numbers of geometry, the algebraic numbers, and the computable numbers. Because formal languages can have only countably many formulas, every notion of definable numbers has at most countably many definable real numbers. However, by Cantor's diagonal argument, there are uncountably many real numbers, so almost every real number is undefinable."
|
large_corpus_distillation
|
"Syntax-Theoretical syntactic models-Categorial grammar Categorial grammar is an approach in which constituents combine as function and argument, according to combinatory possibilities specified in their syntactic categories. For example, other approaches might posit a rule that combines a noun phrase (NP) and a verb phrase (VP), but CG would posit a syntactic category NP and another NP\\S, read as \"a category that searches to the left (indicated by \\) for an NP (the element on the left) and outputs a sentence (the element on the right).\" Thus, the syntactic category for an intransitive verb is a complex formula representing the fact that the verb acts as a function word requiring an NP as an input and produces a sentence level structure as an output. The complex category is notated as (NP\\S) instead of V. The category of transitive verb is defined as an element that requires two NPs (its subject and its direct object) to form a sentence. That is notated as (NP/(NP\\S)), which means, \"A category that
|
large_corpus_distillation
|
"PL/I-Implementations-IBM PL/I optimizing and checkout compilers The PL/I Optimizer and Checkout compilers produced in Hursley support a common level of PL/I language and aimed to replace the PL/I F compiler. The checkout compiler is a rewrite of PL/I F in BSL, IBM's PL/I-like proprietary implementation language (later PL/S). The performance objectives set for the compilers are shown in an IBM presentation to the BCS. The compilers had to produce identical results \u2013 the Checkout Compiler is used to debug programs that would then be submitted to the Optimizer. Given that the compilers had entirely different designs and were handling the full PL/I language this goal was challenging: it was achieved."
|
large_corpus_distillation
|
A two-party computation protocol is secure if for all adversaries there exists a successful simulator."
|
large_corpus_distillation
|
"Ellipsis-In different languages-In French In French, the ellipsis is commonly used at the end of lists to represent et cetera. In French typography, the ellipsis is written immediately after the preceding word, but has a space after it, for example: comme \u00e7a... pas comme ceci. If, exceptionally, it begins a sentence, there is a space before and after, for example: Lui\u2009? ... vaut rien, je crois.... However, any omitted word, phrase or line at the end of a quoted passage would be indicated as follows: [...] (space before and after the square brackets but not inside), for example: ... \u00e0 Paris, Nice, Nantes, Toulouse [...]."
|
large_corpus_distillation
|
"Bucket queue-Bucket queue-The bucket queue is the priority-queue analogue of pigeonhole sort (also called bucket sort), a sorting algorithm that places elements into buckets indexed by their priorities and then concatenates the buckets. Using a bucket queue as the priority queue in a selection sort gives a form of the pigeonhole sort algorithm. Bucket queues are also called bucket priority queues or bounded-height priority queues. When used for quantized approximations to real number priorities, they are also called untidy priority queues or pseudo priority queues. They are closely related to the calendar queue, a structure that uses a similar array of buckets for exact prioritization by real numbers."
|
large_corpus_distillation
|
"Inversion list-Inversion list-In computer science, an inversion list is a data structure that describes a set of non-overlapping numeric ranges, stored in increasing order.\nThe set is stored in an array. Every other element is the first element of a range, and every other element is the first element after that range (a half-open range)."
|
large_corpus_distillation
|
"Substitution cipher-Types-Using this system, the keyword \"zebras\" gives us the following alphabets: A message flee at once. we are discovered! enciphers to SIAA ZQ LKBA. VA ZOA RFPBLUAOAR! Usually the ciphertext is written out in blocks of fixed length, omitting punctuation and spaces; this is done to disguise word boundaries from the plaintext and to help avoid transmission errors. These blocks are called \"groups\", and sometimes a \"group count\" (i.e. the number of groups) is given as an additional check. Five-letter groups are often used, dating from when messages used to be transmitted by telegraph: SIAAZ QLKBA VAZOA RFPBL UAOAR If the length of the message happens not to be divisible by five, it may be padded at the end with \"nulls\". These can be any characters that decrypt to obvious nonsense, so that the receiver can easily spot them and discard them."
|
large_corpus_distillation
|
conjecture is difficult only for odd values of n , and if negative values were allowed then the problem could be solved for every odd n by the following formula: "
|
large_corpus_distillation
|
"Cryptography-Modern cryptography-The X.509 standard defines the most commonly used format for public key certificates.Diffie and Hellman's publication sparked widespread academic efforts in finding a practical public-key encryption system. This race was finally won in 1978 by Ronald Rivest, Adi Shamir, and Len Adleman, whose solution has since become known as the RSA algorithm.The Diffie\u2013Hellman and RSA algorithms, in addition to being the first publicly known examples of high-quality public-key algorithms, have been among the most widely used. Other asymmetric-key algorithms include the Cramer\u2013Shoup cryptosystem, ElGamal encryption, and various elliptic curve techniques.A document published in 1997 by the Government Communications Headquarters (GCHQ), a British intelligence organization, revealed that cryptographers at GCHQ had anticipated several academic developments. Reportedly, around 1970, James H. Ellis had conceived the principles of asymmetric key cryptography. In 1973, Clifford Cocks
|
large_corpus_distillation
|
"Mobile payment-Carrier billing-Convenience \u2013 no pre-registration and no new mobile software is required.\nEasy \u2013 It is just another option during the checkout process.\nFast \u2013 most transactions are completed in less than 10 seconds."
|
large_corpus_distillation
|
"Tajima's D-Interpreting Tajima's D-A negative Tajima's D signifies an excess of low frequency polymorphisms relative to expectation, indicating population size expansion (e.g., after a bottleneck or a selective sweep). A positive Tajima's D signifies low levels of both low and high frequency polymorphisms, indicating a decrease in population size and/or balancing selection. However, calculating a conventional \"p-value\" associated with any Tajima's D value that is obtained from a sample is impossible. Briefly, this is because there is no way to describe the distribution of the statistic that is independent of the true, and unknown, theta parameter (no pivot quantity exists). To circumvent this issue, several options have been proposed."
|
large_corpus_distillation
|
"Variety (cybernetics)-Law of requisite variety-It is not possible for R to reduce the outcomes any further and still respond to all potential moves from D , but it is possible that another table of the same shape would not allow R to do so well. Requisite variety is necessary, but not sufficient to control the outcomes. If R and D are machines, they cannot possibly choose more moves than they have states. Thus, a perfect regulator must have at least as many distinguishable states as the phenomenon it is intended to regulate (the table must be square, or wider). Stated in bits, the law is VO\u2265VD\u2212VR . In Shannon's information theory, D , R , and E are information sources. The condition that if R never changes moves, the uncertainty in outcomes is no less than the uncertainty in D 's move is expressed as H(E|R)\u2265H(D|R) , and since R 's strategy is a deterministic function of D set H(R|D)=0 . With the rules of the game expressed this way, it can be shown that
|
large_corpus_distillation
|
"Lexical resource-Characteristics-Different standards for the machine-readable edition of lexical resources exist, e.g., Lexical Markup Framework (LMF) an ISO standard for encoding lexical resources, comprising an abstract data model and an XML serialization, and OntoLex-Lemon, an RDF vocabulary for publishing lexical resources as knowledge graphs on the web, e.g., as Linguistic Linked Open Data.Depending on the type of languages that are addressed, a lexical resource may be qualified as monolingual, bilingual or multilingual. For bilingual and multilingual lexical resources, the words may be connected or not connected from one language to another. When connected, the equivalence from a language to another is performed through a bilingual link (for bilingual lexical resources, e.g., using the relation vartrans:translatableAs in OntoLex-Lemon) or through multilingual notations (for multilingual lexical resources, e.g., by reference to the same ontolex:Concept in OntoLex-Lemon).It is possible also to build and
|
large_corpus_distillation
|
"Evolution-Data Optimized-Standard revisions-The EV-DO Rev. C standard was specified by 3GPP2 to improve the CDMA2000 mobile phone standard for next generation applications and requirements. It was proposed by Qualcomm as the natural evolution path for CDMA2000 and the specifications were published by 3GPP2 (C.S0084-*) and TIA (TIA-1121) in 2007 and 2008 respectively.The brand name UMB (Ultra Mobile Broadband) was introduced in 2006 as a synonym for this standard.UMB was intended to be a fourth-generation technology, which would make it compete with LTE and WiMAX. These technologies use a high bandwidth, low latency, underlying TCP/IP network with high level services such as voice built on top. Widespread deployment of 4G networks promises to make applications that were previously not feasible not only possible but ubiquitous. Examples of such applications include mobile high definition video streaming and mobile gaming."
|
large_corpus_distillation
|
"Hardware-in-the-loop simulation-Uses-Tight development schedules The tight development schedules associated with most new automotive, aerospace and defense programs do not allow embedded system testing to wait for a prototype to be available. In fact, most new development schedules assume that HIL simulation will be used in parallel with the development of the plant. For example, by the time a new automobile engine prototype is made available for control system testing, 95% of the engine controller testing will have been completed using HIL simulation."
|
large_corpus_distillation
|
"Thread (computing)-Single-threaded vs multithreaded programs-Other synchronization APIs include condition variables, critical sections, semaphores, and monitors."
|
large_corpus_distillation
|
"Clock drift-Timing attack-In 2006, a side channel attack was published that exploited clock skew based on CPU heating. The attacker causes heavy CPU load on a pseudonymous server (Tor hidden service), causing CPU heating. CPU heating is correlated with clock skew, which can be detected by observing timestamps (under the server's real identity)."
|
large_corpus_distillation
|
"The Hardest Logic Puzzle Ever-The solution-Random's behavior Boolos' third clarifying remark explains Random's behavior as follows: Whether Random speaks truly or not should be thought of as depending on the flip of a coin hidden in his brain: if the coin comes down heads, he speaks truly; if tails, falsely.This does not state if the coin flip is for each question, or each \"session\", that is the entire series of questions. If interpreted as being a single random selection which lasts for the duration of the session, Rabern and Rabern show that useful answers can be extracted even from Random; this is because the counterfactual had been designed such that regardless of whether the answerer (in this case Random) was as a truth-teller or a false-teller, the truthful answer to Q would be clear."
|
large_corpus_distillation
|
"Subject (grammar)-Difficult cases-There are problems.In sentence 1, the first criterion (agreement) and the second criterion (position occupied) suggest that there is the subject, whereas the third criterion (semantic role) suggests rather that problems is the subject. In sentence 2, in contrast, agreement and semantic role suggest that problems is the subject, whereas position occupied suggests that there is the subject. In such cases then, one can take the first criterion as the most telling; the subject should agree with the finite verb."
|
large_corpus_distillation
|
"Enumeration algorithm-Examples of enumeration problems-The vertex enumeration problem, where we are given a polytope described as a system of linear inequalities and we must enumerate the vertices of the polytope.\nEnumerating the minimal transversals of a hypergraph. This problem is related to monotone dualization and is connected to many applications in database theory and graph theory.\nEnumerating the answers to a database query, for instance a conjunctive query or a query expressed in monadic second-order. There have been characterizations in database theory of which conjunctive queries could be enumerated with linear preprocessing and constant delay.\nThe problem of enumerating maximal cliques in an input graph, e.g., with the Bron\u2013Kerbosch algorithm Listing all elements of structures such as matroids and greedoids Several problems on graphs, e.g., enumerating independent sets, paths, cuts, etc.\nEnumerating the satisfying assignments of representations of Boolean functions, e.g., a Boolean
|
large_corpus_distillation
|
"Consensus (computer science)-Equivalency of agreement problems-Termination: All processes must eventually decide on an output value Weak Interactive Consistency For n processes in a partially synchronous system (the system alternates between good and bad periods of synchrony), each process chooses a private value. The processes communicate with each other by rounds to determine a public value and generate a consensus vector with the following requirements: if a correct process sends v , then all correct processes receive either v or nothing (integrity property) all messages sent in a round by a correct process are received in the same round by all correct processes (consistency property).It can be shown that variations of these problems are equivalent in that the solution for a problem in one type of model may be the solution for another problem in another type of model. For example, a solution to the Weak Byzantine General problem in a synchronous authenticated message passing model leads to a solution
|
large_corpus_distillation
|
"Enron Corpus-Enron Corpus-The Enron Corpus is a database of over 600,000 emails generated by 158 employees of the Enron Corporation in the years leading up to the company's collapse in December 2001. The corpus was generated from Enron email servers by the Federal Energy Regulatory Commission (FERC) during its subsequent investigation. A copy of the email database was subsequently purchased for $10,000 by Andrew McCallum, a computer scientist at the University of Massachusetts Amherst. He released this copy to researchers, providing a trove of data that has been used for studies on social networking and computer-mediated communication."
|
large_corpus_distillation
|
22 is characteristic of the second form of RTS."
|
large_corpus_distillation
|
"Distributed morphology-Distributed morphology approach to core theoretical issues-Crosslinguistic variation Since the model of Distributed Morphology consists of three lists (Formative List, Exponent List, Encyclopedia), we expect crosslinguistic variation to be located in all three of them. The feature bundles and their structure might be different from language to language (Formative List), which could affect both syntactic and post-syntactic operations. Vocabulary Items (Exponent List) can also be different crosslinguistically. Finally, the interpretation of roots (Encyclopedia) is also expected to show variation."
|
large_corpus_distillation
|
"CUDA-Ontology-The following table offers a non-exact description for the ontology of CUDA framework."
|
large_corpus_distillation
|
"Intel Core (microarchitecture)-Chip errata-Floating point instruction non-coherencies.\nAllowed memory corruptions outside of the range of permitted writing for a process by running common instruction sequences.Intel errata Ax39, Ax43, Ax65, Ax79, Ax90, Ax99 are said to be particularly serious. 39, 43, 79, which can cause unpredictable behavior or system hang, have been fixed in recent steppings."
|
large_corpus_distillation
|
"Monoidal category-Monoidal category-A rather different application, of which monoidal categories can be considered an abstraction, is that of a system of data types closed under a type constructor that takes two types and builds an aggregate type; the types are the objects and \u2297 is the aggregate constructor. The associativity up to isomorphism is then a way of expressing that different ways of aggregating the same data\u2014such as ((a,b),c) and (a,(b,c)) \u2014store the same information even though the aggregate values need not be the same. The aggregate type may be analogous to the operation of addition (type sum) or of multiplication (type product). For type product, the identity object is the unit () , so there is only one inhabitant of the type, and that is why a product with it is always isomorphic to the other operand. For type sum, the identity object is the void type, which stores no information and it is impossible to address an inhabitant. The concept of monoidal category does not presume
|
large_corpus_distillation
|
"for n\u22651 and let Z i n=U n +U n\u22121 +...+Un\u2212i+1 for 1\u2264i\u2264n. Then for every \u03b1>0, and\nn\u22651, W n =max[0,Z n 1,Z n 2,...,Z n n ]. Also, Pr{W n \u2265\u03b1} is the probability that the random n walk based on {U i ;i\u22651}\ncrosses a threshold at \u03b1 on or before the nth trial. Finally, Pr{W \u2265\u03b1}=lim n\u2192\u221e Pr{W n \u2265\u03b1} is equal to the probability\nthat the random walk based on {U i ;i\u22651} ever crosses a threshold at \u03b1.\nNote that the theorem specifies the distribution function of W n for each n, but says nothing about the joint distribution of\nsuccessive queueing delays. These are not the same as the distribution of successive terms in a random walk because of the reversal\nof terms above.\nWe shall find a relatively simple upper bound and approximation to the probability that a random walk crosses a positive threshold\nin Section 7.4. From Theorem 7.2.1, this can be applied to the distribution of queueing delay for the G/G/1 queue (and thus
|
large_corpus_distillation
|
"Elastic scoring-Techniques-Besides providing alternative instrumentation in the form of sheet music parts, the elastic scoring concept allows three subsets of scoring music."
|
large_corpus_distillation
|
"Hedge (finance)-Natural hedges-Another example is a company that opens a subsidiary in another country and borrows in the foreign currency to finance its operations, even though the foreign interest rate may be more expensive than in its home country: by matching the debt payments to expected revenues in the foreign currency, the parent company has reduced its foreign currency exposure. Similarly, an oil producer may expect to receive its revenues in U.S. dollars, but faces costs in a different currency; it would be applying a natural hedge if it agreed to, for example, pay bonuses to employees in U.S. dollars."
|
large_corpus_distillation
|
"Decompiler-Design-Disassembly The next logical phase is the disassembly of machine code instructions into a machine independent intermediate representation (IR). For example, the Pentium machine instruction might be translated to the IR Idioms Idiomatic machine code sequences are sequences of code whose combined semantics are not immediately apparent from the instructions' individual semantics. Either as part of the disassembly phase, or as part of later analyses, these idiomatic sequences need to be translated into known equivalent IR. For example, the x86 assembly code: could be translated to eax := abs(eax); Some idiomatic sequences are machine independent; some involve only one instruction. For example, xor eax, eax clears the eax register (sets it to zero). This can be implemented with a machine independent simplification rule, such as a = 0."
|
large_corpus_distillation
|
"Large deviations of Gaussian random functions-Basic statement-Let M be the maximal value of a Gaussian random function X on the (two-dimensional) sphere. Assume that the expected value of X is 0 (at every point of the sphere), and the standard deviation of X is 1 (at every point of the sphere). Then, for large a>0 , P(M>a) is close to exp \u2061(\u2212a2/2)+2P(\u03be>a) where \u03be is distributed N(0,1) (the standard normal distribution), and C is a constant; it does not depend on a , but depends on the correlation function of X (see below). The relative error of the approximation decays exponentially for large a The constant C is easy to determine in the important special case described in terms of the directional derivative of X at a given point (of the sphere) in a given direction (tangential to the sphere). The derivative is random, with zero expectation and some standard deviation. The latter may depend on the point and the direction. However, if it does not depend, then it is equal to
|
large_corpus_distillation
|
"Distributed search engine-History-YaCy On December 15, 2003 Michael Christen announced development of a P2P-based search engine, eventually named YaCy, on the heise online forums.\nDews A theoretical design for a distributed search engine discussed in academic literature.\nSeeks Seeks was an open source websearch proxy and collaborative distributed tool for websearch. It ceased to have a usable release in 2016.\nInfraSearch In April 2000 several programmers (including Gene Kan, Steve Waterhouse) built a prototype P2P web search engine based on Gnutella called InfraSearch. The technology was later acquired by Sun Microsystems and incorporated into the JXTA project. It was meant to run inside the participating websites' databases creating a P2P network that could be accessed through the InfraSearch website.\nOpencola On May 31, 2000 Steelbridge Inc. announced development of OpenCOLA a collaborative distributive open source search engine. It runs on the user's computer and crawls the web pages and links the
|
large_corpus_distillation
|
"Irrational number-Irrational number-Irrational numbers can also be expressed as non-terminating continued fractions and many other ways.\nAs a consequence of Cantor's proof that the real numbers are uncountable and the rationals countable, it follows that almost all real numbers are irrational."
|
large_corpus_distillation
|
"SWIM Protocol-Properties-The protocol provides the following guarantees: Strong Completeness: Full completeness is guaranteed (e.g. the crash-failure of any node in the group is eventually detected by all live nodes).\nDetection Time: The expected value of detection time (from node failure to detection) is T\u2032\u02d911\u2212e\u2212qf , where T\u2032 is the length of the protocol period, and qf is the fraction of non-faulty nodes in the group."
|
large_corpus_distillation
|
"Diffeology-Formal definition-Morphisms A map between diffeological spaces is called smooth if and only if its composite with any plot of the first space is a plot of the second space. It is called a diffeomorphism if it is smooth, bijective, and its inverse is also smooth. By construction, given a diffeological space X , its plots defined on U are precisely all the smooth maps from U to X Diffeological spaces form a category where the morphisms are smooth maps. The category of diffeological spaces is closed under many categorical operations: for instance, it is Cartesian closed, complete and cocomplete, and more generally it is a quasitopos."
|
large_corpus_distillation
|
"ISO basic Latin alphabet-Usage-All of the lowercase letters are used in the International Phonetic Alphabet (IPA). In X-SAMPA and SAMPA these letters have the same sound value as in IPA.\nAlphabets containing the same set of letters The list below only includes alphabets that lack: letters whose diacritical marks make them distinct letters.\nmultigraphs that constitute distinct letters."
|
large_corpus_distillation
|
object. For example, the last statement, corresponding to object 10 , states that all the following must be satisfied: Either P1 must have value 2, or P3 must have value 0, or both."
|
large_corpus_distillation
|
"SCImago Journal Rank-Rationale-However, studies of methodological quality and reliability have found that \"reliability of published research works in several fields may be decreasing with increasing journal rank\", contrary to widespread expectations.The calculation of the SJR indicator is similar to the Eigenfactor score, with the former being based on the Scopus database and the latter on the Web of Science database, and there are other differences."
|
large_corpus_distillation
|
"Abstract economy-Abstract economy with utility functions-A utility function Vi:Yi\u2192R . This represents the preferences of the agent. Note that the utility of a consumer depends only on his own consumption, rather than on the entire allocation.Define the set of possible price-vectors as: := {p\u2208R+l|\u2211i=1lpi=1} Equilibrium A Walrasian equilibrium (aka competitive equilibrium) in an exchange economy is a vector of consumption-bundles and a price-vector, (y1,\u2026,yN\u22121,p) , such that: The total consumption is at most the total endowment: \u2211yi\u2264\u2211wi The total expense of each agent is at most his budget: p\u22c5yi\u2264p\u22c5wi For each agent i , the consumption yi maximizes the function Vi(\u22c5) subject to the constraint p\u22c5yi\u2264p\u22c5wi . I.e, if Vi(z)>Vi(yi) , then p\u22c5z>p\u22c5wi\u2265p\u22c5yi Reduction to abstract economy Arrow and Debreu presented the following reduction from exchange economy to abstract economy."
|
large_corpus_distillation
|
"Decision model-Evaluation-Evaluation is the second and most algorithmic stage in using formal decision methods. For a decision being made once, the objective of the evaluation stage is to produce a formal recommendation (and its associated sensitivities) from a formal model of the decision situation. For a repeatable decision evaluation occurs each time the decision is made by applying the decision model that has been developed."
|
large_corpus_distillation
|
of going to j; eventually this possibility will occur with no\nfurther returns to i.\n\uf1b3 Theorem 3.2.1\nFor finite-state Markov chains, either all states in a class are transient or all are recurrent.2\nProof\nAssume that state i is transient (i.e., for some j, i\u2192j but j\u219bi) and suppose that i and m are in the same class (i.e.,\ni\u2194m). Then m\u2192i and i\u2192j, so m\u2192j. Now if j\u2192m, then the walk from j to m could be extended to i; this is a\ncontradiction, and therefore there is no walk from j to m, and m is transient. Since we have just shown that all nodes in a\nclass are transient if any are, it follows that the states in a class are either all recurrent or all transient.\nFor the example of Figure 3.1(a), {2, 3} and {5} are recurrent classes and the other classes are transient. In terms of the\ngraph of a Markov chain, a class is transient if there are any directed arcs going from a node in the class to a node outside\nthe class. Every finite-state Markov chain must have at
|
large_corpus_distillation
|
"Noisy-channel coding theorem-Mathematical statement-Theorem (Shannon, 1948): 1. For every discrete memoryless channel, the channel capacity, defined in terms of the mutual information I(X;Y) as sup pXI(X;Y) has the following property. For any \u03f5>0 and R<C , for large enough N , there exists a code of length N and rate \u2265R and a decoding algorithm, such that the maximal probability of block error is \u2264\u03f5 .2. If a probability of bit error pb is acceptable, rates up to R(pb) are achievable, where R(pb)=C1\u2212H2(pb)."
|
large_corpus_distillation
|
"Cognitive complexity-History-First proposed by James Bieri in 1955 with Cognitive complexity-simplicity and predictive behavior which was published that year in The Journal of Abnormal and Social Psychology. In the article, he tests two hypotheses: There should be a positive relationship between degree of cognitive complexity and predictive accuracy.\nThere should be a negative relationship between cognitive complexity and assimilative projection."
|
large_corpus_distillation
|
"Part of speech-History-Article (describes, limits) a grammatical marker of definiteness (the) or indefiniteness (a, an). The article is not always listed among the parts of speech. It is considered by some grammarians to be a type of adjective or sometimes the term 'determiner' (a broader class) is used.English words are not generally marked as belonging to one part of speech or another; this contrasts with many other European languages, which use inflection more extensively, meaning that a given word form can often be identified as belonging to a particular part of speech and having certain additional grammatical properties. In English, most words are uninflected, while the inflected endings that exist are mostly ambiguous: -ed may mark a verbal past tense, a participle or a fully adjectival form; -s may mark a plural noun, a possessive noun, or a present-tense verb form; -ing may mark a participle, gerund, or pure adjective or noun. Although -ly is a frequent adverb marker, some adverbs (e.g. tomorrow,
|
large_corpus_distillation
|
"Elliptic (company)-Elliptic (company)-Elliptic Ltd. is a London-based blockchain analysis provider founded in 2013."
|
large_corpus_distillation
|
"Differential operator-Definition-The polynomial p obtained by replacing D by variables \u03be in P is called the total symbol of P; i.e., the total symbol of P above is: where \u03be\u03b1=\u03be1\u03b11\u22ef\u03ben\u03b1n."
|
large_corpus_distillation
|
"Probability integral transform-Examples-For a first, illustrative example, let X be a random variable with a standard normal distribution N(0,1) . Then its CDF is erf \u2061(x2)],x\u2208R, where erf \u2061(), is the error function. Then the new random variable Y, defined by := \u03a6(X), is uniformly distributed.\nAs second example, if X has an exponential distribution with unit mean, then its CDF is exp \u2061(\u2212x), and the immediate result of the probability integral transform is that exp \u2061(\u2212X) has a uniform distribution. Moreover, by symmetry of the uniform distribution, exp \u2061(\u2212X) also has a uniform distribution."
|
large_corpus_distillation
|
"Computer Othello-Solving Othello-Othello 4 \u00d7 4 Othello 4x4 has a very small game tree and has been solved in less than one second by many simple Othello programs that use the Minimax method, which generates all possible positions (nearly 10 million). The result is that white wins with a +8 margin (3-11).\nOthello 6 \u00d7 6 Othello 6x6 has been solved in less than 100 hours by many simple Othello programs that use the Minimax method, which generates all possible positions (nearly 3.6 trillion). The result is that white wins with a +4 margin (16-20).\nOthello 8 \u00d7 8 The Othello 8x8 game tree size is estimated at 1054 nodes, and the number of legal positions is estimated at less than 1028. The game remains unsolved. A solution could possibly be found using intensive computation with top programs on fast parallel hardware or through distributed computation."
|
large_corpus_distillation
|
"Document-term matrix-Applications-Improving search results Latent semantic analysis (LSA, performing singular-value decomposition on the document-term matrix) can improve search results by disambiguating polysemous words and searching for synonyms of the query. However, searching in the high-dimensional continuous space is much slower than searching the standard trie data structure of search engines.\nFinding topics Multivariate analysis of the document-term matrix can reveal topics/themes of the corpus. Specifically, latent semantic analysis and data clustering can be used, and, more recently, probabilistic latent semantic analysis with its generalization Latent Dirichlet allocation, and non-negative matrix factorization, have been found to perform well for this task."
|
large_corpus_distillation
|
"Glossary of Principia Mathematica-Glossary-diversity The inequality relation domain The domain of a relation R is the class of x such that xRy for some y.\nelementary proposition A proposition built from atomic propositions using \"or\" and \"not\", but with no bound variables Epimenides Epimenides was a legendary Cretan philosopher existent non-empty extensional function A function whose value does not change if one of its arguments is changed to something equivalent.\nfield The field of a relation R is the union of its domain and codomain first-order A first-order proposition is allowed to have quantification over individuals but not over things of higher type.\nfunction This often means a propositional function, in other words a function taking values \"true\" or \"false\". If it takes other values it is called a \"descriptive function\". PM allows two functions to be different even if they take the same values on all arguments.\ngeneral proposition A proposition containing quantifiers generalization
|
large_corpus_distillation
|
"IOS 10-App features-News The News app, taking cues from the Music layout, has been redesigned to incorporate bold headings and a newspaper-esque layout in the redesigned \"For You\" tab. News also features support for subscriptions and provides notifications for breaking news.\nNotes Notes now has a collaboration feature. This allows users to share a note and collaborate with other users, who can add and remove text from a note. Users tap a \"round yellow badge with a person and a plus sign\" and can then send invitations through text, email, or by link."
|
large_corpus_distillation
|
"Linker (computing)-Static linking-Static linking is the result of the linker copying all library routines used in the program into the executable image. This may require more disk space and memory than dynamic linking, but is more portable, since it does not require the presence of the library on the system where it runs. Static linking also prevents \"DLL hell\", since each program includes exactly the versions of library routines that it requires, with no conflict with other programs. A program using just a few routines from a library does not require the entire library to be installed."
|
large_corpus_distillation
|
"Pin (computer program)-Tools-There are many Pintools that are used for varying tasks.\nComponents of Intel Parallel Studio make heavy use of pintools for memory debugging, performance analysis, multithreading correctness analysis and parallelization preparation.\nIntel Software Development Emulator is a pintool that enables the development of applications using instruction set extensions that are not currently implemented in hardware.\nCMP$IM is a cache profiler built using pin.\nPinPlay enables the capture and deterministic replay of the running of multithreaded programs under pin. Capturing the running of a program helps developers overcome the non-determinism inherent in multithreading.\nPin itself comes with many example tools that make use of its abilities. These tools are licensed under a BSD-like license."
|
large_corpus_distillation
|
"Reserve currency-Major reserve currencies-Euro The euro is currently the second most commonly held reserve currency, representing about 20% of international foreign currency reserves. After World War II and the rebuilding of the German economy, the German Deutsche Mark gained the status of the second most important reserve currency after the US dollar. When the euro was introduced on 1 January 1999, replacing the Mark, French franc and ten other European currencies, it inherited the status of a major reserve currency from the Mark. Since then, its contribution to official reserves has risen continually as banks seek to diversify their reserves, and trade in the eurozone continues to expand.After the euro's share of global official foreign exchange reserves approached 25% as of year-end 2006 (vs 65% for the U.S. dollar; see table above), some experts have predicted that the euro could replace the dollar as the world's primary reserve currency. See Alan Greenspan, 2007; and Frankel, Chinn (2006) who explained
|
large_corpus_distillation
|
"Elliptic curve only hash-Properties-Incrementality: ECOH of a message can be updated quickly, given a small change in the message and an intermediate value in ECOH computation.\nParallelizability: This means the computation of the Pi\u2032s can be done on parallel systems.\nSpeed: The ECOH algorithm is about thousand times slower than SHA-1. However, given the developments in desktop hardware towards parallelization and carryless multiplication, ECOH may in a few years be as fast as SHA-1 for long messages. For short messages, ECOH is relatively slow, unless extensive tables are used."
|
large_corpus_distillation
|
"Frogbit (cipher)-Frogbit (cipher)-In cryptography, Frogbit is a stream cypher algorithm developed by Thierry Moreau and is patented. It includes a message authentication code feature. It has been submitted to the eSTREAM Project of the eCRYPT network. It has not been selected as a focus algorithm nor for Phase 2; it has been 'archived'."
|
large_corpus_distillation
|
"Random number generator attack-Prominent examples-Java nonce collision In August 2013, it was revealed that bugs in the Java class SecureRandom could generate collisions in the k nonce values used for ECDSA in implementations of Bitcoin on Android. When this occurred the private key could be recovered, in turn allowing stealing Bitcoins from the containing wallet."
|
large_corpus_distillation
|
step is to use a geometric argument to show that \u230aqp\u230b+\u230a2qp\u230b+\u22ef+\u230amqp\u230b+\u230apq\u230b+\u230a2pq\u230b+\u22ef+\u230anpq\u230b=mn.\nCombining these formulas gives quadratic reciprocity in the form (pq)(qp)=(\u22121)mn=(\u22121)p\u221212q\u221212.\nThere are formulas that use floor to express the quadratic character of small numbers mod odd primes p: (2p)=(\u22121)\u230ap+14\u230b, (3p)=(\u22121)\u230ap+16\u230b."
|
large_corpus_distillation
|
"Fr\u00e9chet inequalities-Proofs-To get the upper bound, recall that P(A & B) = P(A|B) P(B) = P(B|A) P(A). Because P(A|B) \u2264 1 and P(B|A) \u2264 1, we know P(A & B) \u2264 P(A) and P(A & B) \u2264 P(B). Therefore, P(A & B) \u2264 min(P(A), P(B)), which is the upper bound.\nThe best-possible nature of these bounds follows from observing that they are realized by some dependency between the events A and B. Comparable bounds on the disjunction are similarly derived."
|
large_corpus_distillation
|
"Dynamic substructuring-Dynamic substructuring-Large and/or complex systems can be optimized on substructure level.\nNumerical computation load can be reduced as solving several substructures is computationally less demanding than solving one large system."
|
large_corpus_distillation
|
"K\u0151nig's theorem (graph theory)-Statement of the theorem-In any bipartite graph, the number of edges in a maximum matching equals the number of vertices in a minimum vertex cover."
|
large_corpus_distillation
|
"Handicap (golf)-Features of handicapping systems-Playing or course handicap In most major handicapping systems, a golfer does not use their exact handicap (or handicap index) directly, but use it to produce their playing or course handicap. For some systems, this means simply rounding the exact handicap to the nearest whole number; however, systems that use slope ratings require a more complex calculation to produce a course handicap with some also factoring in the course rating: Course handicap handicap index slope rating 113 or Course handicap handicap index slope rating 113 course rating par ) The USGA and Golf Australia systems use the first calculation; the WHS, EGA, and Golf RSA systems use the second. Under CONGU's Unified Handicapping System the exact handicap is rounded to the nearest whole number to produce the playing handicap, and in the Argentinian system the exact handicap is used directly."
|
large_corpus_distillation
|
subspace. However, there exists no G -invariant complement to this subspace. The assumption that such a complement exists would entail that every matrix is diagonalizable over C.\nThis is known to be wrong and thus yields a contradiction.\nThe moral of the story is that if we consider infinite groups, it is possible that a representation - even one that is not irreducible - can not be decomposed into a direct sum of irreducible subrepresentations."
|
large_corpus_distillation
|
"YaDICs-Theoretical background-The Gauss-Newton method is a very efficient method that needs to solve a [M]{U}={F}. On 10003 voxels \u00b5-tomographic image the number of degrees of freedom can reach 1e6 (i.e: on a 12\u00d712\u00d712 mesh), dealing with such a problem is more a matter of numerical scientists and required specific development (using libraries like Petsc or MUMPS) so we don't use Gauss-Newton methods to solve such problems. One has developed a specific steepest gradient algorithm with a specific tuning of the \u03b1k scalar parameter at each iteration. The Gauss-Newton method can be used in small problems in 2D."
|
large_corpus_distillation
|
"Q11\n120 5\nA variable is normally distributed with a mean of and a standard deviation of . Four scores are randomly sampled. What is the\n127\nprobability that the mean of the four scores is above ? (relevant section)\nQ12\n0.30 84\nThe correlation between self esteem and extraversion is . A sample of is taken.\n0.10\na. What is the probability that the correlation will be less than ?\n0.25\nb. What is the probability that the correlation will be greater than ? (relevant section)\nQ13\nSchool A 3.0 School B 2.8\nThe mean GPA for students in is ; the mean GPA for students in is . The standard deviation in both\n0.25 9\nschools is . The GPAs of both schools are normally distributed. If students are randomly sampled from each school, what is\nthe probability that:\nSchool A School A 0.5\na. the sample mean for will exceed that of by or more? (relevant section)\nSchool B School A\nb. the sample mean for will be greater than the sample mean for ? (relevant section)\nQ14\n70% Candidate A 30\nIn a city, of the
|
large_corpus_distillation
|
"PLS (complexity)-Reductions-Definition Tight PLS-reduction A PLS-reduction (f,g) from a local search problem L1 to a local search problem L2 is a tight PLS-reduction if for any instance I1 of L1 , a subset R of solutions of instance I2=f(I1) of L2 can be chosen, so that the following properties are satisfied: R contains, among other solutions, all local optima of I2 For every solution p of I1 , a solution q\u2208R of I2=f(I1) can be constructed in polynomial time, so that g(I1,q)=p If the transition graph Tf(I1) of f(I1) contains a direct path from q to q0 , and q,q0\u2208R , but all internal path vertices are outside R , then for the corresponding solutions p=g(I1,q) and p0=g(I1,q0) holds either p=p0 or TI1 contains an edge from p to p0 "
|
large_corpus_distillation
|
"Expressive power (computer science)-Examples-In this area, the cost of expressive power is a central topic of study. It is known, for instance, that deciding whether two arbitrary regular expressions describe the same set of strings is hard, while doing the same for arbitrary context-free grammars is completely impossible. However, it can still be efficiently decided whether any given string is in the set."
|
large_corpus_distillation
|
encoded bits, according to the following table (distance slots 0\u22123 directly encode distances 0\u22123)."
|
large_corpus_distillation
|
"International Conference on Availability, Reliability and Security-2008: Polytechnic University of Catalonia (UPC) Barcelona, Spain-In 2008 the keynotes of the ARES conference were held by: Prof. Ravi Sandhu, Executive Director, Chief Scientist and Founder, Institute for Cyber Security (ICS) and Lutcher Brown Endowed Chair in Cyber-Security Prof. G\u00fcnther Pernul, Department of Information Systems, University of Regensburg Prof. Vijay Atluri, Management Science and Information Systems Department, Research Director of the Center for Information Management, Integration and Connectivity (CIMIC), Rutgers UniversityThe acceptance rate ARES 2008: 40 full papers of 190 submissions "
|
large_corpus_distillation
|
"40,000-Selected numbers in the range 40001\u201349999-42000 to 42999 42680 = octahedral number 42875 = 353 42925 = square pyramidal number 43000 to 43999 43261 = Markov number 43390 = number of primes 19 43560 = pentagonal pyramidal number 43691 = Wagstaff prime 43777 = smallest member of a prime sextuplet 44000 to 44999 44044 = palindrome of 79 after 6 iterations of the \"reverse and add\" iterative process 44100 = sum of the cubes of the first 20 positive integers. 44,100 Hz is a common sampling frequency in digital audio (and is the standard for compact discs)."
|
large_corpus_distillation
|
"Data integration-Theory-In LAV systems, queries undergo a more radical process of rewriting because no mediator exists to align the user's query with a simple expansion strategy. The integration system must execute a search over the space of possible queries in order to find the best rewrite. The resulting rewrite may not be an equivalent query but maximally contained, and the resulting tuples may be incomplete. As of 2011 the GQR algorithm is the leading query rewriting algorithm for LAV data integration systems."
|
large_corpus_distillation
|
"L-estimator-Efficiency-However, for a large data set (over 100 points) from a symmetric population, the mean can be estimated reasonably efficiently relative to the best estimate by L-estimators. Using a single point, this is done by taking the median of the sample, with no calculations required (other than sorting); this yields an efficiency of 64% or better (for all n). Using two points, a simple estimate is the midhinge (the 25% trimmed mid-range), but a more efficient estimate is the 29% trimmed mid-range, that is, averaging the two values 29% of the way in from the smallest and the largest values: the 29th and 71st percentiles; this has an efficiency of about 81%. For three points, the trimean (average of median and midhinge) can be used, though the average of the 20th, 50th, and 80th percentile yields 88% efficiency. Using further points yield higher efficiency, though it is notable that only 3 points are needed for very high efficiency."
|
large_corpus_distillation
|
"Curse of dimensionality-Domains-Anomaly detection In a 2012 survey, Zimek et al. identified the following problems when searching for anomalies in high-dimensional data: Concentration of scores and distances: derived values such as distances become numerically similar Irrelevant attributes: in high dimensional data, a significant number of attributes may be irrelevant Definition of reference sets: for local methods, reference sets are often nearest-neighbor based Incomparable scores for different dimensionalities: different subspaces produce incomparable scores Interpretability of scores: the scores often no longer convey a semantic meaning Exponential search space: the search space can no longer be systematically scanned Data snooping bias: given the large search space, for every desired significance a hypothesis can be found Hubness: certain objects occur more frequently in neighbor lists than others.Many of the analyzed specialized methods tackle one or another of these problems, but there remain many
|
large_corpus_distillation
|
"Firefly (cache coherence protocol)-Transitions-If a block is already cached in the Valid state, a processor write hit changes the state to Dirty state as no other cache has the copy of data. This write is not written through to memory.\nIf a block is cached in the Dirty state and a processor write hit occurs, then the state remains as Dirty state.\nIf the block is in Shared state and there's a processor write hit, and if there is already a copy in some caches (C), the block stays in Shared state. If there is no copy of the block in any cache (!C), the block is written in Valid state as it is the only \u2018valid\u2019 copy present in caches.\nIf there's a CPU read hit, the block stays in whatever state it is already in\u2014just like in the Dragon protocol.\nBus-Initiated Transitions If the block is in Shared State, and there's a BusRd or BusWr request, the block stays in Shared state.\nIf the block is in Dirty State, and another processor reads or writes it, request from another processor, it transitions
|
large_corpus_distillation
|
\u2264 1), with the modes located at the ends of the distribution. As Mosteller and Tukey remark ( p. 207) \"the average of the two extreme observations uses all the sample information. This illustrates how, for short-tailed distributions, the extreme observations should get more weight.\" By contrast, it follows that the median of \"U-shaped\" bimodal distributions with modes at the edge of the distribution (with Beta(\u03b1, \u03b2) such that \u03b1, \u03b2 \u2264 1) is not robust, as the sample median drops the extreme sample observations from consideration. A practical application of this occurs for example for random walks, since the probability for the time of the last visit to the origin in a random walk is distributed as the arcsine distribution Beta(1/2, 1/2): the mean of a number of realizations of a random walk is a much more robust estimator than the median (which is an inappropriate sample measure estimate in this case)."
|
large_corpus_distillation
|
"Modular arithmetic-Residue systems-{5, 15}, since a complete residue system modulo 4 must have exactly 4 incongruent residue classes.\nReduced residue systems Given the Euler's totient function \u03c6(n), any set of \u03c6(n) integers that are relatively prime to n and mutually incongruent under modulus n is called a reduced residue system modulo n. The set {5,15} from above, for example, is an instance of a reduced residue system modulo 4.\nCovering systems Covering systems represent yet another type of residue system that may contain residues with varying moduli."
|
large_corpus_distillation
|
continuous-wave lasers with extremely high spectral purity and pulsed lasers for analyses involving limited atoms. Continuous-wave lasers however are often preferred to pulsed lasers due to the latter's relatively low duty cycle since they can only produce photo ions during the brief later pulses, and the difficulty in reproducing results due to pulse-to-pulse jitters, laser beam drifting, and wavelength variations.Moderate laser powers, if high enough to affect the desired transition states, can be used since the non-resonant photoionization cross section is low which implies a negligible ionization efficiency of unwanted atoms. The influence of the laser matrix to be used for the sample can also be reduced by separating evaporation and ionization processes both in time and in space."
|
large_corpus_distillation
|
"PL/I-Special topics in PL/I-PL/I's default storage class for INTERNAL variables is AUTOMATIC, similar to that of other block-structured languages influenced by ALGOL, like the \"auto\" storage class in the C language, and default storage allocation in Pascal and \"local-storage\" in IBM COBOL. Storage for AUTOMATIC variables is allocated upon entry into the BEGIN-block, procedure, or ON-unit in which they are declared. The compiler and runtime system allocate memory for a stack frame to contain them and other housekeeping information. If a variable is declared with an INITIAL-attribute, code to set it to an initial value is executed at this time. Care is required to manage the use of initialization properly. Large amounts of code can be executed to initialize variables every time a scope is entered, especially if the variable is an array or structure. Storage for AUTOMATIC variables is freed at block exit: STATIC, CONTROLLED, or BASED variables are used to retain variables' contents between invocations of a
|
large_corpus_distillation
|
"Call stack-Use-For instruction set architectures in which the instruction used to call a subroutine puts the return address into a register, rather than pushing it onto the stack, the prologue will commonly save the return address by pushing the value onto the call stack, although if the called subroutine does not call any other routines it may leave the value in the register. Similarly, the current stack pointer and/or frame pointer values may be pushed."
|
large_corpus_distillation
|
"CPU cache-Associativity-Two-way skewed associative cache Other schemes have been suggested, such as the skewed cache, where the index for way 0 is direct, as above, but the index for way 1 is formed with a hash function. A good hash function has the property that addresses which conflict with the direct mapping tend not to conflict when mapped with the hash function, and so it is less likely that a program will suffer from an unexpectedly large number of conflict misses due to a pathological access pattern. The downside is extra latency from computing the hash function. Additionally, when it comes time to load a new line and evict an old line, it may be difficult to determine which existing line was least recently used, because the new line conflicts with data at different indexes in each way; LRU tracking for non-skewed caches is usually done on a per-set basis. Nevertheless, skewed-associative caches have major advantages over conventional set-associative ones."
|
large_corpus_distillation
|
"Compound Poisson distribution-Compound Poisson processes-For the discrete version of compound Poisson process, it can be used in survival analysis for the frailty models."
|
large_corpus_distillation
|
"Order of operations-Programming languages-Furthermore, because many operators are not associative, the order within any single level is usually defined by grouping left to right so that 16/4/4 is interpreted as (16/4)/4 = 1 rather than 16/(4/4) = 16; such operators are referred to as \"left associative\". Exceptions exist; for example, languages with operators corresponding to the cons operation on lists usually make them group right to left (\"right associative\"), e.g. in Haskell, 1:2:3:4:[] == 1:(2:(3:(4:[]))) == [1,2,3,4]."
|
large_corpus_distillation
|
"AVL tree-AVL tree-The AVL tree is named after its two Soviet inventors, Georgy Adelson-Velsky and Evgenii Landis, who published it in their 1962 paper \"An algorithm for the organization of information\". It is the oldest self-balancing binary search tree data structure to be invented.AVL trees are often compared with red\u2013black trees because both support the same set of operations and take log \u2061n) time for the basic operations. For lookup-intensive applications, AVL trees are faster than red\u2013black trees because they are more strictly balanced. Similar to red\u2013black trees, AVL trees are height-balanced. Both are, in general, neither weight-balanced nor \u03bc -balanced for any \u03bc\u226412 ; that is, sibling nodes can have hugely differing numbers of descendants."
|
large_corpus_distillation
|
"Factorization of polynomials over finite fields-Factorization of polynomials over finite fields-All factorization algorithms, including the case of multivariate polynomials over the rational numbers, reduce the problem to this case; see polynomial factorization. It is also used for various applications of finite fields, such as coding theory (cyclic redundancy codes and BCH codes), cryptography (public key cryptography by the means of elliptic curves), and computational number theory.\nAs the reduction of the factorization of multivariate polynomials to that of univariate polynomials does not have any specificity in the case of coefficients in a finite field, only polynomials with one variable are considered in this article."
|
large_corpus_distillation
|
"Vertex cover-Computational problem-The algorithm for solving vertex cover that achieves the best asymptotic dependence on the parameter runs in time 1.2738 k+(k\u22c5n)) . The klam value of this time bound (an estimate for the largest parameter value that could be solved in a reasonable amount of time) is approximately 190. That is, unless additional algorithmic improvements can be found, this algorithm is suitable only for instances whose vertex cover number is 190 or less. Under reasonable complexity-theoretic assumptions, namely the exponential time hypothesis, the running time cannot be improved to 2o(k), even when n is O(k) However, for planar graphs, and more generally, for graphs excluding some fixed graph as a minor, a vertex cover of size k can be found in time 2O(k)nO(1) , i.e., the problem is subexponential fixed-parameter tractable. This algorithm is again optimal, in the sense that, under the exponential time hypothesis, no algorithm can solve vertex cover on planar graphs in time
|
large_corpus_distillation
|
set; if the subset is empty this supremum is the minimum of the whole set.\nSubsets which are unbounded in the whole set.A subset is cofinal in the whole set if and only if it is unbounded in the whole set or it has a maximum which is also maximum of the whole set.\nA well-ordered set as topological space is a first-countable space if and only if it has order type less than or equal to \u03c91 (omega-one), that is, if and only if the set is countable or has the smallest uncountable order type."
|
large_corpus_distillation
|
"Student's t-distribution-How the t-distribution arises (characterization)-Sampling distribution of t-statistic The t-distribution arises as the sampling distribution of the t-statistic. Below the one-sample t-statistic is discussed, for the corresponding two-sample t-statistic see Student's t-test.\nUnbiased variance estimate Let x1,\u2026,xn\u223cN(\u03bc,\u03c32) be independent and identically distributed samples from a normal distribution with mean \u03bc and variance \u03c32 . The sample mean and unbiased sample variance are given by: x\u00af=x1+\u22ef+xnn,s2=1n\u22121\u2211i=1n(xi\u2212x\u00af)2.\nThe resulting (one sample) t-statistic is given by t=x\u00af\u2212\u03bcs2/n\u223ctn\u22121.\nand is distributed according to a Student's t-distribution with n\u22121 degrees of freedom."
|
large_corpus_distillation
|
"Return-oriented programming-Defenses-Against control flow attacks As small embedded systems are proliferating due to the expansion of the Internet Of Things, the need for protection of such embedded systems is also increasing. Using Instruction Based Memory Access Control (IB-MAC) implemented in hardware, it is possible to protect low-cost embedded systems against malicious control flow and stack overflow attacks. The protection can be provided by separating the data stack and the return stack. However, due to the lack of a memory management unit in some embedded systems, the hardware solution cannot be applied to all embedded systems."
|
large_corpus_distillation
|
"C dynamic memory allocation-Type safety-Advantages to casting Including the cast may allow a C program or function to compile as C++.\nThe cast allows for pre-1989 versions of malloc that originally returned a char *.\nCasting can help the developer identify inconsistencies in type sizing should the destination pointer type change, particularly if the pointer is declared far from the malloc() call (although modern compilers and static analysers can warn on such behaviour without requiring the cast).\nDisadvantages to casting Under the C standard, the cast is redundant."
|
large_corpus_distillation
|
"Set (abstract data type)-Multiset-Formally, it is possible for objects in computer science to be considered \"equal\" under some equivalence relation but still distinct under another relation. Some types of multiset implementations will store distinct equal objects as separate items in the data structure; while others will collapse it down to one version (the first one encountered) and keep a positive integer count of the multiplicity of the element."
|
large_corpus_distillation
|
"Common Criteria-Key concepts-Security Target (ST) \u2013 the document that identifies the security properties of the target of evaluation. The ST may claim conformance with one or more PPs. The TOE is evaluated against the SFRs (Security Functional Requirements. Again, see below) established in its ST, no more and no less. This allows vendors to tailor the evaluation to accurately match the intended capabilities of their product. This means that a network firewall does not have to meet the same functional requirements as a database management system, and that different firewalls may in fact be evaluated against completely different lists of requirements. The ST is usually published so that potential customers may determine the specific security features that have been certified by the evaluation."
|
large_corpus_distillation
|
"Ext4-Features-Unlimited number of subdirectories ext4 does not limit the number of subdirectories in a single directory, except by the inherent size limit of the directory itself. (In ext3 a directory can have at most 32,000 subdirectories.) To allow for larger directories and continued performance, ext4 in Linux 2.6.23 and later turns on HTree indices (a specialized version of a B-tree) by default, which allows directories up to approximately 10\u201312 million entries to be stored in the 2-level HTree index and 2 GB directory size limit for 4 KiB block size, depending on the filename length. In Linux 4.12 and later the largedir feature enabled a 3-level HTree and directory sizes over 2 GB, allowing approximately 6 billion entries in a single directory."
|
large_corpus_distillation
|
"Extreme value theory-Univariate theory-Let X1,\u2026,Xn be a sequence of independent and identically distributed random variables with cumulative distribution function F and let max (X1,\u2026,Xn) denote the maximum.\nIn theory, the exact distribution of the maximum can be derived: Pr Pr Pr Pr (Xn\u2264z)=(F(z))n."
|
large_corpus_distillation
|
"Rebound attack-Example attack on Whirlpool-In the match-in-the-middle step, we use the DDT table to find matching input/output differences (as found in step 1 and 2) to the SubBytes operation in round 3. Each row can be checked independently, and the expected number of solutions is 2 per S-box. In total, the expected number of values that follow the differential characteristic is 264.These steps can be repeated with 264 different starting values in step 1, resulting in a total of 2128 actual values that follow the differential characteristic in the inbound phase. Each set of 264 values can be found with a complexity of 28 round transformations due to the precomputation step."
|
large_corpus_distillation
|
"Probability integral transform-Applications-A second use for the transformation is in the theory related to copulas which are a means of both defining and working with distributions for statistically dependent multivariate data. Here the problem of defining or manipulating a joint probability distribution for a set of random variables is simplified or reduced in apparent complexity by applying the probability integral transform to each of the components and then working with a joint distribution for which the marginal variables have uniform distributions."
|
large_corpus_distillation
|
End of preview. Expand
in Data Studio
README.md exists but content is empty.
- Downloads last month
- 6