208 research outputs found
An Anomaly Detection Approach for Plankton Species Discovery
No full textPlankton is one of the most abundant and diverse class of microscopic organisms inhabiting the Earth. Their enormous intra- and inter-species genetic and phenotypic diversity, coupled with the limited amount of large survey data, makes it hard to obtain a complete representation of this important class of organisms. Hence, the classification accuracy of novel supervised machine learning algorithms is bound to be limited by the incompleteness of the training data. In this work we introduce an efficient pipeline centered around a novel anomaly detection algorithm to discover and classify new plankton species, in situ, with the aim of automatically populating a plankton database in an unsupervised fashion. Our pipeline utilizes the concept of anomaly detection to separate a novel species from the ones contained in an initial existing database. Our results show that the implemented algorithm outperforms four state-of-the-art methods for outlier detection on the plankton dataset used in our analysis. Finally, using a leave-one-out approach, we prove that our pipeline is able to identify unknown plankton species with high-accuracy
Equilibrium Computation (Dagstuhl Seminar 14342)
No full textThis report documents the program and outcomes of Dagstuhl Seminar 14342
"Equilibrium Computation". The seminar was at the leading edge of current
topics related to equilibrium computation for games and markets. We summarize
these topics, give the talk abstracts, and give brief summaries of the
problems that were discussed in the open problem sessions
10171 Abstracts Collection – Equilibrium Computation
No full textFrom April 25 to April 30, 2010, the Dagstuhl Seminar 10171 ``Equilibrium Computation'' was held in Schloss Dagstuhl~--~Leibniz Center for Informatics.
During the seminar, several participants presented their current
research, and ongoing work and open problems were discussed. Abstracts of
the presentations given during the seminar as well as abstracts of
seminar results and ideas are put together in this paper. The first section
describes the seminar topics and goals in general.
Links to extended abstracts or full papers are provided, if available
Author Tom Keneally back stage at the Nimrod Theatre, Sydney, 1980 /
No full textTitle from acquisitions documentation.; Part of the collection: Robert McFarlane collection of photographs.; Inscriptions: "Author Tom Keneally back stage Nimrod Theatre 1980 Robert McFarlane"--In pencil on reverse.; Also available online at: http://nla.gov.au/nla.pic-vn6615438
On the complexity of some geometric problems in unbounded dimension
No full textThis paper examines the complexity of several geometric problems due to un-bounded dimension. The problems considered are: (i) minimum cover of points by unit cubes, (ii) minimum cover of points by unit balls, and (iii) minimum number of lines to hit a set of balls. Each of these problems is proven not to have a poly-nomial approximation scheme unless P = NP. Specific lower bounds on the error ratios attainable in polynomial time are given, assuming P # NP. In particular, it is shown that covering by two cubes is in P while covering by three cubes is NP-complete. 1
A simplex algorithm whose average number of steps is bounded between two quadratic functions of the smaller dimension
No full textIt has been a challenge for mathematicians to confirm theoretically the extremely good performance of simplex-type algorithms for linear programming. In this paper the average number of steps performed by a simplex algorithm, the so-called self-dual method, is analyzed. The algorithm is not started at the traditional point (1,..., but points of the form (1, e, e2,...)T, with t sufficiently small, are used. The result is better, in two respects, than those of the previous analyses. First, it is shown that the expected number of steps is bounded between two quadratic functions cl(min(m, n))' and cz(min(m, n)) ' of the smaller dimension of the problem. This should be compared with the previous two major results in the field. Borgwardt proves an upper bound of 0(n4m1'(n-1') under a model that implies that the zero vector satisfies all the constraints, and also the algorithm under his consideration solves only problems from that particular subclass. Smale analyzes the self-dual algorithm starting at (1,..., He shows that for any fixed m there is a constant c(m) such the expected number of steps is less than ~(m)(lnn)"'("+~); Megiddo has shown that, under Smale's model, an upper bound C(m) exists. Thus, for the first time, a polynomial upper bound with no restrictions (except for nondegeneracy) on the problem is proved, and, for the first time, a nontrivial lower bound of precisely the same order of magnitude is established. Both Borgwardt and Smale require the input vectors to be drawn fro
Is binary encoding appropriate for the problem-language relationship?
No full textAbstractIt is proved that there exist encoding schemes which are arbitrarily as efficient as the binary encoding (in terms of compactness and arithmetic operations), with respect to which Khachiyan's algorithm for Linear Programming is exponential. This constitutes an objection to the standard translation of problems into languages via the binary encoding
Author Tom Keneally and actor Justine Saunders backstage during the rehearsals of Bullie's House, Nimrod Theatre, Sydney, 1980 /
No full textTitle from acquisitions documentation.; Part of the collection: Robert McFarlane collection of photographs.; Inscriptions: "Author Tom Keneally + Actor Justine Saunders backstage Nimrod Theatre 1980 during rehearsal's 'Bulli'es House' Robert McFarlane"--In pencil on reverse.; Also available online at: http://nla.gov.au/nla.pic-vn6615450
- …
