Given only the free-tree structure of a tree, root estimation problem asks if one can guess which free tree's nodes is original tree. We determine maximum-likelihood estimator for tree when underlying size-conditioned Galton–Watson and calculate its probability being correct.

In this screening method for urinary porphobilinogen (PBG), urine is added to Dowex 2 resin under alkaline conditions in a test tube and mixed. The supernate is removed and the adsorbed PBG is eluted with acid and reacted with Ehrlich's reagent. We compared results with those by the Watson-Schwartz screening method, using urine samples from normal people with and without added PBG. At a PBG con...

Watson is a gateway to the Semantic Web: it collects, analyzes and gives access to ontologies and semantic data available online. Its objective is to support the development of next generation Semantic Web applications that dynamically select, combine and exploit the knowledge published on the Semantic Web. We present the design of Watson, which have been guided by the requirements of these app...

John Watson was fascinated by the discoveries of psychoanalysis, but he rejected Freud's central concept of the unconscious as incompatible with behaviorism. After failing to explain psychoanalysis in terms of William James's concept of habit, Watson borrowed concepts from classical conditioning to explain Freud's discoveries. Watson's famous experiment with Little Albert is interpreted not onl...

Watson-Crick automata are finite state automata working on doublestranded tapes, introduced to investigate the potential of DNA molecules for computing. In this paper we introduce the concept of parallel communicating Watson-Crick automata systems. It consists of several Watson-Crick finite automata parsing independently the same input and exchanging information on request, by communicating sta...

In this paper, I outline a new algorithm for regular tree pattern matching. The Boyer-Moore family of string pattern matching algorithms are considered to be among the most e cient. The Boyer-Moore idea of a shift distance was generalized by Commentz-Walter for multiple keywords, and generalizations for regular expressions have also been found. The existence of a further generalization to tree ...