Thresholds were measured for diotic tonal signals in the presence of interaurally delayed bands of Gaussian noise. When the signal frequency was 525 Hz., the spectrum of the noise was either below (highest frequency, 450 Hz) or above (lowest frequency, 600 Hz) the frequency of the signal. When the signal frequency was 450 Hz, the spectrum of the noise was always above the signal frequency (lowe...

The fundamental intramolecular frequency of a globular protein can be obtained from the measurements of acoustic velocities of bulk protein matter. This lowest frequency for common size molecules is shown to be above several hundred GHz. All modes below this frequency would then be intermolecular modes or bulk modes of the molecule and surrounding matter or tissue. The lowest frequency modes of...

Skeletal deformities seriously relegate the biological performance of fish. The frequency of occurrence of different types of meristic variations and skeletal deformities were shown in population of Mahseer fish, Tor putitora, in two main reservoirs; Korang stream, Islamabad and Dhobi Ghat stream, Hassan Abdal. Total of ninety-five fishes were caught randomly, forty-five from the unpolluted Kor...

Generalizations of a collection of concepts can be computed by the least common subsumer (lcs) which is a useful inference for building knowledge bases. For general FL0-TBoxes the lcs need not exist. In this thesis, we devise a condition to check whether a concept is the lcs of two concepts w.r.t. a general FL0-TBox. We also define the characterizations for the existence of the lcs. Last, we sh...

In the area of Description Logics the least common subsumer (lcs) and the most specific concept (msc) are inferences that generalize a set of concepts or an individual, respectively, into a single concept. If computed w.r.t. a general EL-TBox neither the lcs nor the msc need to exist. So far in this setting no exact conditions for the existence of lcsor msc-concepts are known. This report provi...

We study the problem of finding relevant relationships among user defined nodes of XML documents. We define a language that determines the nodes as results of XPath expressions. The expressions are structured in a conjunctive normal form and the relationships among nodes qualifying in different conjuncts are determined as tree twigs of the searched XML documents. The query execution is supporte...

Reconciliation between a set of gene trees and a species tree is the most commonly used approach to infer the duplication and loss events in the evolution of gene families, given a species tree. When a species tree is not known, a natural algorithmic problem is to infer a species tree such that the corresponding reconciliation minimizes the number of duplications and/or losses. In this paper, w...

Approximate Quickselect, a simple modification of the well known Quickselect algorithm for selection, can be used to efficiently find an element with rank k in a given range [i..j], out of n given elements. We study basic cost measures of Approximate Quickselect by computing exact and asymptotic results for the expected number of passes, comparisons and data moves during the execution of this a...

We present a novel self-stabilizing algorithm for minimum spanning tree (MST) construction. The space complexity of our solution is O(log n) bits and it converges in O(n) rounds. Thus, this algorithm improves the convergence time of all previously known selfstabilizing asynchronous MST algorithms by a multiplicative factor Θ(n), to the price of increasing the best known space complexity by a fa...

In two previous papers we have investigates the problem of computing the least common subsumer (lcs) and the most specific concept (msc) for the description logic EL in the presence of terminological cycles that are interpreted with descriptive semantics, which is the usual first-order semantics for description logics. In this setting, neither the lcs nor the msc needs to exist. We were able to...