In the computational linguistics area, after Kay's adopting of feature structures and their unification to manipulate syntactic structures[KAY79], a lot of unification-based grammar formalisms have been issued such as FUG[KAY82] , LFG[BRE82] , GPSG[GAZ85] , PATRII[SHI86], HPSG[P0L87], etc.. Nowadays, an unification of feature structures is known as one of the most effective and powerful means t...

We present the unification of many previously disparate results in noisy quantum Shannon theory and the unification of all of noiseless quantum Shannon theory. More specifically we deal here with bipartite, unidirectional, and memoryless quantum Shannon theory. We find all the optimal protocols and quantify the relationship between the resources used, both for the one-shot and for the ensemble ...

Default unification has been used in several linguistic applications. Most of them have utilized defaults at a meta-level, as part of an extended description language. We propose that allowing default unification to be a fully integrated part of a typed feature structure system requires default unification to be a binary, order independent function, so that it acquires the perspicuity and decla...

The unification of gauge couplings suggests that there is an underlying (supersymmetric) unification of the strong, electromagnetic and weak interactions. The prediction of the unification scale may be the first quantitative indication that this unification may extend to unification with gravity. We make a precise determination of these predictions for a class of models which extend the multipl...