734 research outputs found

    Fast, linked, and open – the future of taxonomic publishing for plants: launching the journal PhytoKeys

    No full text
    The paper describes the focus, scope and the rationale of PhytoKeys, a newly established, peer-reviewed, open-access journal in plant systematics. PhytoKeys is launched to respond to four main challenges of our time: (1) Appearance of electronic publications as amendments or even alternatives to paper publications; (2) Open Access (OA) as a new publishing model; (3) Linkage of electronic registers, indices and aggregators that summarize information on biological species through taxonomic names or their persistent identifiers (Globally Unique Identifiers or GUIDs; currently Life Science Identifiers or LSIDs); (4) Web 2.0 technologies that permit the semantic markup of, and semantic enhancements to, published biological texts. The journal will pursue cutting-edge technologies in publication and dissemination of biodiversity information while strictly following the requirements of the current International Code of Botanical Nomenclature (ICBN)

    Code for Rare Ribosomal RNA Sequences from Archaea Stabilize the Bacterial Ribosome

    No full text
    This repository holds sequences, data, and scripts used in sequence and phylogenetic analysis for the publication: "Rare Ribosomal RNA Sequences from Archaea Stabilize the Bacterial Ribosome" Amos J. Nissley, Petar I. Penev, Zoe L. Watson, Jill F. Banfield, and Jamie H. D. Cate The script manipulateSILVAtrees.py is used to generate annotation files for iTOL, used in creating figure 1, based on SILVA taxonomy

    History of new Bulgarian literature

    No full text
    Title: История на новата българска литература (History of new Bulgarian literature) Originally published: Sofia, Държавна печатница, 4 vols. (1930–1936), ed. by Boris Iotsov Language: Bulgarian The excerpts used are from the second edition: История на новата българска литература (Sofia: Български писател, 1976), vol. I, pp. 468–470, 477, 500–501. About the author Boyan Penev [1882, Shumen (east Bulgaria) – 1927, Sofia]: literary critic and historian. He completed his secondary education in Ro..

    Free Search Towards Multidimensional Optimisation Problems

    No full text
    The article presents experimental results achieved from a novel heuristic algorithm for real-value search and optimisation called Free Search (FS). The aim is to clarify the abilities of this method to return optimal solutions from multidimensional search spaces currently resistant to other search techniques

    Algorithms Applied to Global Optimisation – Visual Evaluation

    No full text
    Evaluation and assessment of various search and optimisation algorithms is subject of large research efforts. Particular interest of this study is global optimisation and presented approach is based on observation and visual evaluation of Real-Coded Genetic Algorithm, Particle Swarm Optimisation, Differential Evolution and Free Search, which are briefly described and used for experiments. 3D graphical views, generated by visualisation tool VOTASA, illustrate essential aspects of global search process such as divergence, convergence, dependence on initialisation and utilisation of accidental events. Discussion on potential benefits of visual analysis, supported with numerical results, which could be used for comparative assessment of other methods and directions for further research conclude presented study

    Free Search and Particle Swarm Optimisation applied to Non-constrained Test

    No full text
    This article presents an evaluation of Particle Swarm Optimisation (PSO) with variable inertia weight and Free Search (FS) with variable neighbour space applied to nonconstrained numerical test. The objectives are to assess how high convergence speed reflects on adaptation to various test problems and to identify possible balance between convergence speed and adaptation, which allows the algorithms to complete successfully the process of search on heterogeneous tasks with limited computational resources within a reasonable finite time and with acceptable for engineering purposes precision. Modification strategies of both algorithms are compared in terms of their ability for search space exploration. Five numerical tests are explored. Achieved experimental results are presented and analysed

    PESI - a taxonomic backbone for Europe

    No full text
    This is an open access article distributed under the terms of the Creative Commons Attribution License (CC BY 4.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited. The attached file is the published version of the article.NHM Repositor
    corecore