A b s t r a G In a previous paper, we derived the optimum selection combining (OSC) scheme for binary noncoherent FSK (NCFSK) signak on independent (but not necessarily identically distributed) Rayleigh fading chanuels with Lautenna diversity reception. In the OSC scheme, the diversity branch having the largest magnitude of the logarithm of the ratio of the a posteriori probabilities (log-APP r...

In this paper, we study the performance of the selection combining and switch and stay combining methods in secure cooperative device-to-device (D2D) communications underlying a cellular network where an untrusted amplify and forward relay helps D2D communications. In our model, we specifically consider the interference from the cellular system over the D2D pair and the interference from the D2...

In this paper a new mathematical procedure is presented for combining different pieces of evidence which are represented in the interval form to reflect our knowledge about the truth of a hypothesis. Evidences may be correlated to each other (dependent evidences) or conflicting in supports (conflicting evidences). First, assuming independent evidences, we propose a methodology to construct comb...

The period character’s meaning is highly ambiguous due to the frequency of abbreviations that require to be followed by a period. We have developed a hybrid method for period character disambiguation and the identification of abbreviations, combining rules that explore regularities in the right context of the period with lexicon-based, statistical methods which scrutinize the preceding token. T...

The classical DPO graph rewriting construction is re-expressed using the oppbration approach introduced originally for term graph rewriting. Using a skeleton category of graphs, a base of canonical graphs-in-context, with DPO rules as arrows, and with categories of redexes over each object in the base, yields a category of rewrites via the discrete Grothendieck construction. The various possibl...

The combination of rules and ontologies has a central role in the ongoing development of the Semantic Web. In previous work, autoepistemic logic (AEL) was advocated as a uniform host formalism to study different such combinations, enabling comparisons on a common basis. In this paper, we continue this line of research and investigate different embeddings of major proposals to combine rules and ...

—Amidst the conflicting experimental evidence of superiority of one over the other, we investigate the Sum and majority Vote combining rules in a two class case, under the assumption of experts being of equal strength and estimation errors conditionally independent and identically distributed. We show, analytically, that, for Gaussian estimation error distributions, Sum always outperforms Vote....

one of important issues in designing a supply chain is supplier selection. this issue is complicated, because each supplier should satisfy some criteria from buyer and choosing among them is actually a multi criteria decision making problem. so, there is a need for a structured and systematic approach to solve this problem. in this article, we address supplier selection in an advertising indust...

In this paper, experiments on various classifiers and combining these classifiers are done, reported and analyzed. Combining the classifiers means having the single classifiers support each other in making a decision, instead of having only a single classifier’s decision as the final decision. The base experiment involves, both, applying different single classifiers on a dataset and applying th...