1. E+A Mystery E+A galaxies are galaxies with strong Balmer absorption lines and with no significant emission in [OII] or Hα lines. The existence of strong Balmer absorption lines shows that these galaxies have experienced a starburst within the last 1 Gyr. At the same time, these galaxies do not show any sign of ongoing star formation as indicated by the lack of [OII] or Hα emission lines. The...

a robust and reliable quantitative structure-property relationship (qspr) study was established to forecast the melting points (mps)  of a diverse and long set including 250 drug-like compounds. based on the calculated descriptors by dragon software package, to detect homogeneities and to split the whole dataset into training and test sets, a principal component analysis (pca) approach was used...

Based on a discussion of the theory experiment connection, it is proposed to tighten the connection by replacing the real and complex number basis of physical theories by sets R n , C n of length 2n finite binary string numbers. The form of the numbers in R n is based on the infinite hierarchy of 2n figure outputs from measurements of any physical quantity with an infinite range (distance, ener...

In this paper, the most appropriate buffer structure, page replacement policy and buffering scheme for closest pairs queries, where both spatial datasets are stored in R-trees, are investigated. Three buffer structures (i.e. single, hybrid and by levels) over two buffering schemes (i.e. local to each R-tree, and global to the query) using several page replacement algorithms (e.g. FIFO, LRU, 2Q,...

A 3-layer back propagation network is used to implement a pattern association task which learns mappings that are analogous to the present and past tense forms of English verbs, i.e., arbitrary, identity, vowel change, and suffixation mappings. The degree of correspondence between connectionist models of tasks of this type (Rumelhart & McClelland, 1986; 1987) and children’s acquisition of infle...

Motivation: Many biological data processing problems can be formalized as clustering problems to partition data points into sensible and biologically interpretable groups. Results: This article introduces densityCut, a novel density-based clustering algorithm, which is both timeand space-efficient and proceeds as follows: densityCut first roughly estimates the densities of data points from a K-...

We construct vector bundles Rrk μ on a smooth projective curve X having the property that for all sheaves E of slope μ and rank rk on X we have an equivalence: E is a semistable vector bundle ⇐⇒ Hom(Rrk μ , E) = 0. As a byproduct of our construction we obtain effective bounds on r such that the linear system |R ·Θ| has base points on UX(r, r(g − 1)).