|
| |
| | Equivalence |
 | | Compatibility equivalence Compatibility equivalence refers to a state in which two technically dissimilar things may be... | | | Equivalence of matter and energy An equivalance between the mass and enery of matter is quantified by the relationship p... | | | Equivalence of categories In mathematics, an equivalence of categories is a relation between two categories that establi... |
|
http://www.brainyencyclopedia.com/topics/equivalence.html
|
|
| |
| | MSMaster.txt |
| | For example, the Whitehead theorem that a weak equivalence between cell complexes is a homotopy equivalence, or its analogue that a quasi-isomorph* *ism between projective complexes is a homotopy equivalence, is a formal consequence of this adjunction between homotopy categories. | | | The equivalence of Ho GKB and hGWB 112 9.2. | | | Compatibility relations The term "compatibility relation" has been used in algebraic geometry in the context of Grothendieck's six functor formalism that relates base change functo* *rs to tensor product and internal hom functors in sheaf theory. |
|
http://hopf.math.purdue.edu/May-Sigurdsson/MSMaster.txt
|
|
| |
| | Unicode Character Encoding of Archived Linguistic Data |
| | The relationship between a compatibility character and its near synonym is captured in Unicode in the same manner as canonical equivalence: a normative decomposition mapping is provided for compatibility characters. | | | Compatibility characters are those that would not have been encoded (except for compatibility) because they are in some sense variants of characters that have already been coded... | | | In general, we can recommend that compatibility characters not be used, except in the case of the specific superscript characters (many of which have yet to be added to the standard) that are used for phonetic and phonemic transcription or for other linguistic purposes, such as transliteration. |
|
http://www.ldc.upenn.edu/exploration/expl2000/papers/constable2/constable2.html
|
|
| |
| | Compatibility |
| | Compatibility equivalence Compatibility equivalence refers to a state in which two technically dissimilar things may be... | | | Compatibility decomposition In Unicode, the compatibility decomposition of a character is a string that holds the relati... | | | Compatibility layer In libraries for the emulated system, this will often be sufficient to run binaries for the host sys... |
|
http://www.brainyencyclopedia.com/topics/compatibility.html
|
|
| |
| | Character Equivalence |
| | Another example of compatibility equivalence is between circled and un-circled versions of characters. | | | The Unicode standard recognizes two types of character equivalence: canonical equivalence and compatibility equivalence. | | | Canonical equivalence is a fundamental equivalence between individual Unicode characters and sequences of Unicode characters. |
|
http://www.roguewave.com/support/docs/sourcepro/i18nug/5-2.html
|
|
| |
| | Compatibility equivalence - Wikipedia, the free encyclopedia |
| | In Unicode, for instance, the compatibility equivalence of two strings (sequences of letters, numbers, or other characters) means that they can be reduced to identical strings by recursive application of both canonical decomposition and compatibility decomposition routines. | | | Two Unicode strings that have the relation of compatibility equivalence may sometimes be considered identical, but generally they are not—the "micro sign" (µ) and "greek small letter mu" (μ) are similar, for example, but they are not considered strictly identical. | | | Compatibility equivalence refers to a state in which two technically dissimilar things may be considered functionally identical. |
|
http://en.wikipedia.org/wiki/Compatibility_equivalence
(120 words)
|
|
| |
| | Compatibility equivalence - Wikipedia, the free encyclopedia |
| | In Unicode, for instance, the compatibility equivalence of two strings (sequences of letters, numbers, or other characters) means that they can be reduced to identical strings by recursive application of both canonical decomposition and compatibility decomposition routines. | | | Compatibility equivalence refers to a state in which two technically dissimilar things may be considered functionally identical. | | | Two Unicode strings that have the relation of compatibility equivalence may sometimes be considered identical, but generally they are not—the "micro sign" (µ) and "greek small letter mu" (μ) are similar, for example, but they are not considered strictly identical. |
|
http://en.wikipedia.org/wiki/Compatibility_equivalence
(120 words)
|
|
| |
| | Orthogonal Persistence and Ada |
| | Existing persistent programming languages use structural type equivalence, so that type compatibility between different executions is a natural extension of compatibility within an execution. | | | Ada's type equivalence rule, and its semantics of type elaboration mean that persistent data cannot be accessed in a later run. | | | This is compatible with current Ada code, though it provides a "backdoor" that allows programs to circumvent the name equivalence rule. |
|
http://archive.dstc.edu.au/AU/staff/crawley/papers/PAda.html
(120 words)
|
|
| |
| | Hangul and IDN (was Re: [idn] reordering strawpoll) |
| | But is in turn equivalent to (G, G, A), but this equivalence is neither a canonical equivalence, as it should have been, nor a compatibility equivalence. | | | But for historical reasons, there is now neither a canonical, nor a compatibility equivalence there. | | | The precomposed Hangul syllable U+AE4C (GGA) is canonically equivalent with (GG, A), through algorithmic decomposition. |
|
http://www.imc.org/idn/mail-archive/msg04743.html
(120 words)
|
|
| |
| | Character Equivalence |
| | The Unicode standard recognizes two types of character equivalence: canonical equivalence and compatibility equivalence. | | | Canonical equivalence is a fundamental equivalence between individual Unicode characters and sequences of Unicode characters. | | | Another example of canonical equivalence is that between Korean hangul syllables and the jamo characters that compose them. |
|
http://www.roguewave.com/support/docs/sourcepro/i18nug/5-2.html
(223 words)
|
|
| |
| | SENG 609.03 Object Theory: Course Work |
| | The partial equivalence and compatibility relations are used in the discussion of typed versus untyped formalisms. | | | In this paper first the classification by evolutionary hierarchy in biology and then by equivalence relations in mathematics are analyzed and their relations are explored (Wegner, 1988, p:479). | | | Equivalence relations are the canonical classification mechanisms of mathematics. |
|
http://sern.ucalgary.ca/~moussavm/609.03/presentation6.html
(223 words)
|
|
| |
| | Unicode Character Encoding of Archived Linguistic Data |
| | The relationship between a compatibility character and its near synonym is captured in Unicode in the same manner as canonical equivalence: a normative decomposition mapping is provided for compatibility characters. | | | Compatibility characters are those that would not have been encoded (except for compatibility) because they are in some sense variants of characters that have already been coded... | | | This type of decomposition is known as a compatibility decomposition, as opposed to a canonical decomposition. |
|
http://ldc.upenn.edu/exploration/expl2000/papers/constable2/constable2.html
(223 words)
|
|
| |
| | Mailgate: comp.std.internat: Horizontal ellipsis as a compatibility character |
| | Since there is no formatting information associated with this, they are considered as canonical equivalents, see Without going into what _this_ means, it suffices to say that this is different from compatibility equivalence. | | | The conclusions to be drawn, such as whether compatibility characters are "deprecated" in some sense, and whether it would be better to use their compatibility equivalents (optionally with some stylistic suggestions) instead, are different matters, and at a different level of rigorousness. | | | The horizontal ellipsis character is compatibility equivalent to a sequence of three full stops. |
|
http://www.mailgate.org/comp/comp.std.internat/msg00812.html
(223 words)
|
|
| |
| | CICS 520 - Language Translation and Analysis |
| | Define some methods on class Type that check for equivalence and compatibility of two types. | | | Name equivalence is used for object of class type, structural equivalence is used for arrays (no you are not expected to do arrays, I just wanted to be complete), and the equivalence of the primitive types is the same under name and structural equivalence. | | | The one complication of the Java type checker - class types with inheritance and interfaces - we aren't implementing in miniJava. |
|
http://www.cs.ubc.ca/~norm/cics520/lab7.html
(223 words)
|
|
| |
| | November 24, 1999 Least Burdensom Task Force |
| | For many products non-clinical data (biocompatibility, electromagnetic compatibility, internal results from design verification and validation) are sufficient to satisfy substantial equivalence determination and support the clearance of the device. | | | For those very few 510(k) submissions that do need clinical data to demonstrate substantial equivalence, it is important to note that the type of data and the clinical endpoints must be commensurate with 510(k) substantial equivalence requirements. | | | Device evolution also means that very often the issues of safety and effectiveness or substantial equivalence are focused on incremental features rather than the device as a whole, thus limiting the need for clinical data when bench data is fully adequate to address the change. |
|
http://www.advamed.org/publicdocs/benson112499leastburdensomeltr.html
(223 words)
|
|
| |
| | 4.10 unicodedata -- Unicode Database |
| | The Unicode standard defines various normalization forms of a Unicode string, based on the definition of canonical equivalence and compatibility equivalence. | | | The normal form KC (NFKC) first applies the compatibility decomposition, followed by the canonical composition. | | | However, it is supported in Unicode for compatibility with existing character sets (e.g. |
|
http://www.python.org/doc/current/lib/module-unicodedata.html
(223 words)
|
|
| |
| | Don Box's Keynote at Web Services DevCon, Day 2 |
| | Two things may both implement the same interface, but that's all there is to it; raw naked type equivalence. | | | Don's talking about type compatibility in C: it has a type system; not like C++'s (up goes Emacs). | | | This leads into type compatibility in C++ (substitution, generics). |
|
http://www.jepstone.net/radio/stories/2002/10/11/donBoxsKeynoteAtWebService.html
(223 words)
|
|
| |
| | Events - Colloquium Series - Mathematics and Computer Science, Stetson University |
| | Compatibility of Equivalence Relations and Binary Operations on Algebraic Structures... | | | Compatibility of Equivalence Relations and Binary Operations on Algebraic Structures | | | In our presentation, we will explain our discoveries on equivalence relations and binary operations.Using a Mathematica package to help our research, we were able to study algebraic structures in great depth. |
|
http://www.stetson.edu/departments/mathcs/events/colloquium/1997/index.shtml
(223 words)
|
|
| |
| | 4.10 unicodedata -- Unicode Database |
| | The Unicode standard defines various normalization forms of a Unicode string, based on the definition of canonical equivalence and compatibility equivalence. | | | The normal form KC (NFKC) first applies the compatibility decomposition, followed by the canonical composition. | | | However, it is supported in Unicode for compatibility with existing character sets (e.g. |
|
http://www.python.org/doc/current/lib/module-unicodedata.html
(223 words)
|
|
| |
| | q33.txt |
| | - data types: typing, type systems, type equivalence, type compatibility, type checking, strong typing, static typing, name equivalence, structural equivalence, aliasing, type inference, specifying rules of inference, issues in memory layout. | | | - lambda expression: equivalence and reduction - type inference - express relations in logic - Write short code segments to illustrate a concept. |
|
http://www.eecis.udel.edu/~lliao/cis670/bboard/q33.txt
(223 words)
|
|
| |
| | TheGridBLOG |
| | We can compare two SOAP document for namespace equivalence, schema syntax equivalence, and check that the data contained in the response documents are identical or approximate. | | | Traditionally, when the output of two programs is a data structure in the same programming language, determining equivalence is relatively straightforward. | | | The acceptance test may determine functional equivalence or may determine correctness measured against an always-correct result, an oracle. |
|
http://www.gridblog.blogspot.com
(223 words)
|
|
| |
| | Re: [idn] SC/TC equivalence |
| | Soobok Lee wrote: > 1) compatibility decomposition > 2) canonical composition > > What is the difference between these equivalences and SC/TC equivalence? | | | Compatibility characters are characters that have compatibility decompositions. | | | Performing compatibility decomposition removes only formatting information (which shouldn't really be present in plain text in the first place). |
|
http://www.imc.org/idn/mail-archive/msg03781.html
(223 words)
|
|
| |
| | 4.10 unicodedata -- Unicode Database |
| | The Unicode standard defines various normalization forms of a Unicode string, based on the definition of canonical equivalence and compatibility equivalence. | | | The normal form KC (NFKC) first applies the compatibility decomposition, followed by the canonical composition. | | | For each character, there are two normal forms: normal form C and normal form D. Normal form D (NFD) is also known as canonical decomposition, and translates each character into its decomposed form. |
|
http://www.python.org/doc/current/lib/module-unicodedata.html
(411 words)
|
|
| |
| | 4.10 unicodedata -- Unicode Database |
| | The Unicode standard defines various normalization forms of a Unicode string, based on the definition of canonical equivalence and compatibility equivalence. | | | The normal form KC (NFKC) first applies the compatibility decomposition, followed by the canonical composition. | | | For each character, there are two normal forms: normal form C and normal form D. Normal form D (NFD) is also known as canonical decomposition, and translates each character into its decomposed form. |
|
http://www.python.org/doc/2.3.5/lib/module-unicodedata.html
(402 words)
|
|
| |
| | Martin Büchi and Wolfgang Weck: Compound Types for Java |
| | Type compatibility can be defined based on name equivalence, that is, explicit declarations, or on structural matching. | | | For types expressing individual contracts, name equivalence should be used so that references are made to external semantics specifications. | | | For types that are composed of several such contracts, the structure of this composition should decide about compatibility. |
|
http://www.abo.fi/~mbuechi/publications/OOPSLA98.html
(402 words)
|
|
| |
| | Canonical equivalence - Wikipedia, the free encyclopedia |
| | (Compare compatibility equivalence.) Canonically equivalent strings always have the same meaning and behaviour; they should also look the same and be indistinguishable to the user. | | | In Unicode, the canonical equivalence of two strings means that they can be reduced to identical strings by recursive application of canonical decomposition routines. | | | Canonical equivalence refers to the state in which two things are in every significant respect identical. |
|
http://en.wikipedia.org/wiki/Canonical_equivalence
(91 words)
|
|
| |
| | Re: U+0140 |
| | And canonical equivalence was the mechanism for saying that two variants of character really should never have been encoded (but we had to for compatibility reasons). | | | > From Unicode's perspective, the consistent difference in treatment of 00B7 > and 0387 is embarrassing, given the fact of their canonical equivalence. | | | > > From Unicode's perspective, the consistent difference in treatment of 00B7 > and 0387 is embarrassing, given the fact of their canonical equivalence. |
|
http://www.mail-archive.com/unicode@unicode.org/msg23119.html
(405 words)
|
|
| |
| | Canonical equivalence - Wikipedia, the free encyclopedia |
| | (Compare compatibility equivalence.) Canonically equivalent strings always have the same meaning and behaviour; they should also look the same and be indistinguishable to the user. | | | In Unicode, the canonical equivalence of two strings means that they can be reduced to identical strings by recursive application of canonical decomposition routines. | | | Canonical equivalence refers to the state in which two things are in every significant respect identical. |
|
http://en.wikipedia.org/wiki/Canonical_equivalence
(91 words)
|
|
| |
| | Anagnostaras, `State liability v Retroactive application of belated implementing measures: Seeking the optimum means in terms of effectiveness of EC law', [2000] 1 Web JCLI |
| | Any doubts around the position that the ECJ might adopt with regard to the compatibility with EC law of this Legislative Decree were considerably relaxed after the Court had the opportunity to deal with the matter in certain cases decided by it in July 1997 (Bonifaci and Berto, Palmisani, Maso and Gazzetta. | | | (12) The equivalence or non discrimination principle was originally introduced in Case 33/76, Rewe-Zentralfinanz eG and Rewe-Zentral AG v Landwirtschaftskammer für das Saarland (Rewe I), [1976] ECR 1989. | | | It is, indeed, a long time since the ECJ was setting as the only limits of this "autonomy" the respect of the principles of equivalence and practical possibility (Case 33/76, Rewe-Zentralfinanz eG and Rewe-Zentral AG v Landwirtschaftskammer für das Saarland (Rewe I), [1976] ECR 1989, p. |
|
http://webjcli.ncl.ac.uk/2000/issue1/anagnostaras1.html
(91 words)
|
|
|
