ALBERT

All Library Books, journals and Electronic Records Telegrafenberg

feed icon rss

Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
  • 1
    Series available for loan
    Series available for loan
    Berlin : Selbstverl. Fachbereich Geowissenschaften
    Associated volumes
    Call number: S 90.0062(28)
    In: Berliner geowissenschaftliche Abhandlungen
    Type of Medium: Series available for loan
    Pages: V, 108 S.
    ISBN: 3895820563
    Series Statement: Berliner Geowissenschaftliche Abhandlungen : Reihe B, Geophysik 28
    Classification:
    Gravimetry
    Language: German
    Location: Lower compact magazine
    Branch Library: GFZ Library
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 2
    Publication Date: 2015-05-01
    Description: Background: This article provides an overview of the first BioASQ challenge, a competition on large-scale biomedical semantic indexing and question answering (QA), which took place between March and September 2013. BioASQ assesses the ability of systems to semantically index very large numbers of biomedical scientific articles, and to return concise and user-understandable answers to given natural language questions by combining information from biomedical articles and ontologies. Results: The 2013 BioASQ competition comprised two tasks, Task 1a and Task 1b. In Task 1a participants were asked to automatically annotate new PubMed documents with MeSH headings. Twelve teams participated in Task 1a, with a total of 46 system runs submitted, and one of the teams performing consistently better than the MTI indexer used by NLM to suggest MeSH headings to curators. Task 1b used benchmark datasets containing 29 development and 282 test English questions, along with gold standard (reference) answers, prepared by a team of biomedical experts from around Europe and participants had to automatically produce answers. Three teams participated in Task 1b, with 11 system runs. The BioASQ infrastructure, including benchmark datasets, evaluation mechanisms, and the results of the participants and baseline methods, is publicly available. Conclusions: A publicly available evaluation infrastructure for biomedical semantic indexing and QA has been developed, which includes benchmark datasets, and can be used to evaluate systems that: assign MeSH headings to published articles or to English questions; retrieve relevant RDF triples from ontologies, relevant articles and snippets from PubMed Central; produce “exact” and paragraph-sized “ideal” answers (summaries). The results of the systems that participated in the 2013 BioASQ competition are promising. In Task 1a one of the systems performed consistently better from the NLM’s MTI indexer. In Task 1b the systems received high scores in the manual evaluation of the “ideal” answers; hence, they produced high quality summaries as answers. Overall, BioASQ helped obtain a unified view of how techniques from text classification, semantic indexing, document and passage retrieval, question answering, and text summarization can be combined to allow biomedical experts to obtain concise, user-understandable answers to questions reflecting their real information needs.
    Electronic ISSN: 1471-2105
    Topics: Biology , Computer Science
    Published by BioMed Central
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 3
  • 4
    Publication Date: 2009-04-22
    Electronic ISSN: 1756-0357
    Topics: Biology , Chemistry and Pharmacology , Geosciences , Medicine , Natural Sciences in General , Physics
    Published by Springer Nature
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 5
    facet.materialart.
    Unknown
    Selbstverlag Fachbereich Geowissenschaften, FU Berlin
    In:  Herausgeberexemplar
    Publication Date: 2024-05-02
    Description: Es wurden verschiedene nichtlineare Optimierungsverfahren auf die Geometrieparameter von Dichtemodellen angewendet. Dabei waren diese mit Randbedingungen versehen. Ein Vergleich zeigte die Vor- und Nachteile der einzelnen Algorithmen. Anhand von zwei synthetischen Testfunktionen wurde das Verfahren Downhill-Simplex mit der (1,10)-CMA-ES verglichen. Das Simplexverfahren zeigte bei weniger als zehn Parametern ein besseres Konvergenz verhalten als die Evolutionsstrategie. Bei höheren Dimensionen konvergierte die Evolutionsstrategie deutlich besser, während Simplex bei mehr als 40 Parametern nicht mehr konvergierte. Die Evolutionsstrategie zeigt unabhängig von der Anzahl der Parameter logarithmische Konvergenzgeschwindigkeit. Die Evolutionsstrategie, genetische Algorithmen. Simulated-Annealing. Threshold-Accepting und der Deluge- Algorithm wurden danach anhand eines zweidimensionalen Salzstockmodells untersucht. Dabei wurden die Geometrieparameter optimiert und die Dichten des Modells konstant gehalten. Die 52 zu optimierenden Parameter wurden mit Randbedingungen versehen. Die (1,10)-CMA-ES benötigte im Durchschnitt die wenigsten Funktionsaufrufe und erreichte die besten Qualitäten. Ausgehend von verschiedenen Startmodellen konnten ähnliche Lösungen, welche alle sehr gute Qualitätswerte hatten, gefunden werden. Rekombination verbesserte die Konvergenzeigenschaften immer. Evolutionsstrategie war stabil gegenüber numerischen Variationen. Genetische Algorithmen konvergierten zu Beginn des Optimierungsprozesses schneller als alle anderen Verfahren, erreichten aber nie die von der Evolutionsstrategie gefundenen besten durchschnittlichen Qualitätswerte. Downhill-Simplex. Simulated-Annealing. Threshold-Accepting und der Deluge-Algorithm zeigten insgesamt schlechteres Konvergenzverhalten als die Evolutionsstrategie und die genetischen Algorithmen. Eine Anwendung der Evolutionsstrategie auf ein Salzstockmodell zeigte die Probleme der Optimierung in drei Dimensionen. Dennoch konnte das Modell in Hinblick auf die gravimetrische Anpassung deutlich verbessert werden.
    Description: Various non-linear optimization techniques were applied to constrained geometry parameters of density models. A comparison showed advantages and disadvantages of each method. By means of synthetical test-functions the downhill-simplex-method has been compared to the (1,10)-CMA-ES. For numbers of parameters smaller ten. better convergence behaviour was achieved with the simplex-method. However, at higher dimensions evolution-strategy converges better than the simplex- met hod. Simplex does not converge for dimensions greater than 40. Independent of the number of parameters, the evolution-strategy showed a logarithmic convergence speed. The evolution-strategy, genetic algorithms, simulated annealing, threshold accepting and the deluge algorithm were investigated using a two-dimensional salt dome model. Here only the geometry of the model was optimized, the densities were held constant. The 52 parameters were constrained. In average the (1,10)-CMA-ES required the less function evaluations and gained the best qualities. Independent of the start configuration evolution-strategy found similar solutions, whose qualities were fairly good. Recombination always improved the results in terms of convergence behaviour. The evolution-strategy was stable against numerical variations. At the beginning of the optimization process genetic algorithms converge faster than all other methods, but they never reach the average quality values which were gained by evolution-strategy. In summary the simplex-method, genetic algorithms, simulated annealing, threshold accepting and the deluge algorithm showed worse convergence behaviour than evolution-strategy and genetic algorithms. An application of evolution-strategy to a three dimensional salt dome model showed the problems encountered in three dimensions. Despite this, in terms of gravity fit. the model could be improved noticeable.
    Description: thesis
    Description: DFG, SUB Göttingen
    Keywords: ddc:550 ; Evolutionärer Algorithmus ; Geophysik
    Language: German
    Type: doc-type:book
    Format: 126
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...