We propose an integrated approach to decision support and diagnostic problems based on topdown induction of decision trees (TDIDT) and case-based reasoning (CBR). This approach has been implemented within the INRECA1 Esprit project. While different ways of integration (Auriol, Manago et al., 1994) and evaluation (Althoff, Auriol et al., 1995; Althoff, 1995a; 1995b) have been carried out in the ...

We present two new k-dimensional data structures, called the PKD-tree and the PKD-tree, respectively. They are explored for indexing combined text and point data, and evaluated experimentally for orthogonal range search (for 2 ≤ k ≤ 100 and n up to 1,000,000) using synthetic data and real data. We compared the range search performance of the PKD-tree with the PKD-tree, the k-d tree, the Pyramid...

Avicennia marina (Avicenniaceae) is a species of mangrove tree used for treatment of small pox lesions in Persian folk medicine. The antiviral activity of methanol, ethanol, water, chloroform and n-hexane extracts was evaluated against HIV-1 and HSV. Methanol extract had the highest antiviral activity and the most polar fraction of this extract (fraction D) inhibited HSV with TI and SI values o...

Mason and Skinner recently constructed a chiral infinite tension limit of the Ramond-Neveu-Schwarz superstring which was shown to compute the Cachazo-He-Yuan formulae for tree-level d=10 Yang-Mills amplitudes and the NS-NS sector of tree-level d=10 supergravity amplitudes. In this letter, their chiral infinite tension limit is generalized to the pure spinor superstring which computes a d=10 sup...

Unlike distinct species, closely related species offer a great challenge for phylogeny reconstruction and species identification with DNA barcoding due to their often overlapping genetic variation. We tested a sibling species group of pine moth pests in China with a standard cytochrome c oxidase subunit I (COI) gene and two alternative internal transcribed spacer (ITS) genes (ITS1 and ITS2). Fi...

Given a set S of n ≥ d points in general position in Rd, a random hyperplane split is obtained by sampling d points uniformly at random without replacement from S and splitting based on their affine hull. A random hyperplane search tree is a binary space partition tree obtained by recursive application of random hyperplane splits. We investigate the structural distributions of such random trees...

The greedy tree $\mathcal{G}(D)$ and the $\mathcal{M}$-tree $\mathcal{M}(D)$ are known to be extremal among trees with degree sequence $D$ respect various graph invariants. This paper provides a general theorem that covers large family of invariants for which or is extremal. Many results, example on Wiener index, number subtrees, independent subsets matchings follow as corollaries, do some new ...

This paper proposes a dependency-driven scheme to dynamically determine the syntactic parse tree structure for tree kernel-based anaphoricity determination in coreference resolution. Given a full syntactic parse tree, it keeps the nodes and the paths related with current mention based on constituent dependencies from both syntactic and semantic perspectives, while removing the noisy information...

This thesis is devoted to the study of subshifts, or symbolic dynamical systems, defined on some finitely presented monoids like Zd or the infinite binary tree. The main result concerning multidimensional subshifts establishes that any effective subshift of dimension d can be obtained by factor map and projective subaction of a subshift of finite type of dimension d+ 1. This result has many app...