A definite relative phase and amplitude exists between the doubly-Cabibbosuppressed amplitude for D → KM and the Cabibbo-favored amplitude forD → K0M0, whereM = (π, η, η): A(D → KM) = − tan θCA(D → K 0 M). Here θC is the Cabibbo angle. This relation, although previously recognized (for M = π) as a consequence of the U-spin subgroup of SU(3), is argued to be less sensitive to corrections involvi...

A definite relative phase and amplitude exists between the doubly-Cabibbosuppressed amplitude for D → KM and the Cabibbo-favored amplitude forD → K0M0, whereM = (π, η, η): A(D → KM) = − tan θCA(D → K 0 M). Here θC is the Cabibbo angle. This relation, although previously recognized (for M = π) as a consequence of the U-spin subgroup of SU(3), is argued to be less sensitive to corrections involvi...

A model is a formal description of a complex application artifact, such as a database schema, an application interface, a UML model, an ontology, or a message format. The problem of merging such models lies at the core of many meta data applications, such as view integration, mediated schema creation for data integration, and ontology merging. This paper examines the problem of merging two mode...

Machine) are quite efficient and give the possibility of good integration in general purpose environments. Presently, we are planning to increase the number of existing primitives with other generic and domain-specific representations. In this future work we will use also other languages (e.g., Java) and, even, other tools (commercial or distribution-free) will be integrated in the library of K...

Ontology merging is an activity of merging two or more source ontology’s to get single coherent ontology for extended knowledge. Literature suggests that in past, several ontology merging algorithms have been proposed by researchers for semantic information retrieval. The key idea associated with all those algorithms was how to merge ontology’s semantically which gives the best possible results...

Schema matching is widely used in many applications, such as data integration, ontology merging, data warehouse and dataspaces. In this paper, we propose a novel matching technique that is based on the order of attributes appearing in the schema structure of query results. The appearance order embodies the extent of the importance of an attribute for the user examining the query results. The co...

A person adds new knowledge to his/her mind, taking into account new information, additional details, better precision, synonyms, homonyms, redundancies, apparent contradictions, and inconsistencies between what he/she knows and new knowledge that he/she acquires. This way, he/she incrementally acquires information keeping it at all times consistent. This information can be represented by Ontol...

A missing piece in quantum information theory, with very few exceptions, has been to provide the random coding exponents for quantum information-processing protocols. We remedy the situation by providing these exponents for a variety of protocols including those at the top of the family tree of protocols. Our line of attack is to provide an exponential bound on the decoupling error for a restri...