2,899 research outputs found

    An Author Profiling Approach Based on Language-dependent Content and Stylometric Features

    No full text
    We describe the approach that we submitted to the 2015 PAN competition for the author profiling task. The task consists in predicting some attributes of an author analyzing a set of his/her Twitter tweets. We consider several sets of stylometric and content features, and different decision algorithms: we use a different combination of features and decision algorithm for each language-attribute pair, hence treating it as an individual problem

    An Author Verification Approach Based on Differential Features

    No full text
    We describe the approach that we submitted to the 2015 PAN competition for the author identification task. The task consists in determining if an unknown document was authored by the same author of a set of documents with the same author. We propose a machine learning approach based on a number of different features that characterize documents from widely different points of view. We construct non-overlapping groups of homogeneous features, use a random forest regressor for each features group, and combine the output of all regressors by their arithmetic mean. We train a different regressor for each language. Our approach achieved the first position in the final rank for the Spanish language

    New Insights on the (Non-)Hardness of Circuit Minimization and Related Problems

    No full text
    The Minimum Circuit Size Problem (MCSP) and a related problem (MKTP) that deals with time-bounded Kolmogorov complexity are prominent candidates for NP-intermediate status. We show that, under very modest cryptographic assumptions (such as the existence of one-way functions), the problem of approximating the minimum circuit size (or time-bounded Kolmogorov complexity) within a factor of n1−o(1) is indeed NP-intermediate. To the best of our knowledge, these problems are the first natural NP-intermediate problems under the existence of an arbitrary one-way function. We also prove that MKTP is hard for the complexity class DET under non-uniform NC0 reductions. This is surprising, since prior work on MCSP and MKTP had highlighted weaknesses of “local” reductions such as NC0-many-one reductions. We exploit this local reduction to obtain several new consequences: * MKTP is not in AC0[p]. * Circuit size lower bounds are equivalent to hardness of a relativized version MKTPA of MKTP under a class of uniform AC0 reductions, for a large class of sets A. * Hardness of MCSPA implies hardness of MKTPA for a wide class of sets A. This is the first result directly relating the complexity of MCSPA and MKTPA, for any A.Paper presented at the 42nd International Symposium on Mathematical Foundations of Computer Science, August 21-25, 2017, Aalborg, Denmark. This is the Author’s Original, a longer and more complete version of the paper published in: Larsen, K.G., Bodlaender, H.L., & Raskin, J.-F. (Eds.). (2017). Proceedings from 42nd International Symposium on Mathematical Foundations of Computer Science (MFCS 2017). Dagstuhl, Germany: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik. (Leibniz International Proceedings in Informatics (LIPIcs)). DOI: 10.4230/LIPIcs.MFCS.2017.54.Peer reviewed

    Better Complexity Bounds for Cost Register Automata

    No full text
    Cost register automata (CRAs) are one-way finite automata whose transitions have the side-effect that a register is set to the result of applying a state-dependent semiring operation to a pair of registers. Here it is shown that CRAs over the tropical semiring can simulate polynomial time computation, proving along the way that a naturally dened width-k circuit value problem over the tropical semiring is P-complete. Then the copyless variant of the CRA, requiring that semiring operations be applied to distinct registers, is shown no more powerful than NC1 when the semiring is the integers, or strings with operations max and concat. This relates questions left open in recent work on the complexity of CRA-computable functions to long-standing class separation conjectures in complexity theory, such as NC versus P and NC1 versus GapNC1.Paper presented at the 42nd International Symposium on Mathematical Foundations of Computer Science, August 21-25, 2017, Aalborg, Denmark. This is the Author’s Original, a longer and more complete version of the paper published in: Larsen, K.G., Bodlaender, H.L., & Raskin, J.-F. (Eds.). (2017). Proceedings from 42nd International Symposium on Mathematical Foundations of Computer Science (MFCS 2017). Dagstuhl, Germany: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik. (Leibniz International Proceedings in Informatics (LIPIcs)). DOI: 10.4230/LIPIcs.MFCS.2017.24.Peer reviewed

    Eric J. Hobsbawm, la Historia desde abajo y el análisis de los agentes históricos

    No full text
    Se trata de una reflexión que, explícitamente enraizada de forma crítica en la propia tradición historiográfica radical, aborda la evolución que experimentó Eric J. Hobsbawm en su manera de analizar los agentes históricos desde abajo. La interpretación del autor se contextualiza en el desarrollo de la Historia social y cultural entre las décadas de 1950 y 1990, principalmente en el ámbito de la denominada historia radical y desde abajo que, además de Hobsbawm, tuvo entre sus principales cultivadores a E. P. Thompson o G. Rudé.Es tracta d'una reflexió que, explícitament arrelada de forma crítica en la pròpia tradició historiogràfica radical, aborda l'evolució que va experimentar Eric J. Hobsbawm en la seva manera d'analitzar els agents històrics des de baix. La interpretació de l'autor es contextualitza en el desenvolupament de la Història social i cultural entre les dècades de 1950 i 1990, principalment en l'àmbit de la denominada història radical i des de baix que, a més de Hobsbawm, va tenir entre els seus principals conreadors a E. P. Thompson o G. Rudé.Critically based on the radical historiographic tradition, this paper proposes a reflection on the evolution that Eric J. Hobsbawm experienced when analysing the historical agents from below. The author contextualizes his interpretation in the development of the social and cultural History between the 1950s and the 1990s, specially in the field of the so called radical and from below history, a kind of history that, besides Hobsbawm, has in E.P Thompson or G. Rudé some of its main practitioners

    Eric J. Hobsbawm, la Historia desde abajo y el análisis de los agentes históricos

    No full text
    Se trata de una reflexión que, explícitamente enraizada de forma crítica en la propia tradición historiográfica radical, aborda la evolución que experimentó Eric J. Hobsbawm en su manera de analizar los agentes históricos desde abajo. La interpretación del autor se contextualiza en el desarrollo de la Historia social y cultural entre las décadas de 1950 y 1990, principalmente en el ámbito de la denominada historia radical y desde abajo que, además de Hobsbawm, tuvo entre sus principales cultivadores a E. P. Thompson o G. Rudé.Es tracta d'una reflexió que, explícitament arrelada de forma crítica en la pròpia tradició historiogràfica radical, aborda l'evolució que va experimentar Eric J. Hobsbawm en la seva manera d'analitzar els agents històrics des de baix. La interpretació de l'autor es contextualitza en el desenvolupament de la Història social i cultural entre les dècades de 1950 i 1990, principalment en l'àmbit de la denominada història radical i des de baix que, a més de Hobsbawm, va tenir entre els seus principals conreadors a E. P. Thompson o G. Rudé.Critically based on the radical historiographic tradition, this paper proposes a reflection on the evolution that Eric J. Hobsbawm experienced when analysing the historical agents from below. The author contextualizes his interpretation in the development of the social and cultural History between the 1950s and the 1990s, specially in the field of the so called radical and from below history, a kind of history that, besides Hobsbawm, has in E.P Thompson or G. Rudé some of its main practitioners

    Evaluating Research in Context: Pilot Study at Faculty of Architecture TU Delft

    No full text
    The vice chancellor of Delft University of Technology, Prof.dr.ir. J. Fokkema, introduced a pilot Evaluating Research in Context (ERiC) at the Faculty of Architecture. The Faculty of Architecture perceives a serious confl ict between the demands and criteria in evaluation procedures and the ambition to be relevant for the practice of architecture, planning and building. The goal of this ERiC pilot is to develop an evaluation method that judges research in the Faculty of Architecture on all its merits and takes into account the specifi c characteristics of architecture research. A second goal is the improvement of the evaluation of research contributions to society. This report presents the full results of this project and gives recommendations how to use these results in an evaluation according to the Standard Evaluation Protocol 2009-2015.Architectur

    Software engineering : modern approaches / Eric J. Braude, Michael E. Bernstein.

    No full text
    Includes bibliographical references and index.xvi, 782 pages

    Not Just Sheet Music: Describing Print and Manuscript Music in Archives and Special Collections

    No full text
    The professional literature on archives and music librarianship in theUnited States only tangentially addresses the management of music archival records.Archives and special collections libraries often find print and manuscript music amongsttheir holdings, even if they are not music-specific repositories. Because printed musicmaterial is a proxy for the work and not the work itself, adequate description of thesematerials may require more granularity than archivists customarily provide. Existingstandards for archival description require more work before they will describe musicas easily as they describe text. The article offers descriptive examples for typicalmanifestations of musical works.Peer reviewe

    Antibacterial Properties of Nanoparticles: A Comparative Review of Chemically Synthesized and Laser-Generated Particles

    No full text
    Nanomaterials have recently received an enormous amount of attention from the scientific community due to their outstanding activity relative to bulk materials. This increase in activity relative to bulk materials can be attributed to the high surface area to volume ratio associated with nanoparticles. Nanoparticles have found applications in almost every field of science. Currently there is significant interest in the development of nanoparticles as antibacterial agents. This work is paramount due to the increasing number of antibiotic-resistant strains of bacteria. Nanoparticles can be synthesized using various methods, each with their own advantages and disadvantages, and the method is often chosen based on the intended application. This review will cover the most prevalent method, chemical-based reduction of salts, and a fairly new laser-based method that holds tremendous promise in nanoparticle synthesis. We conclude with a comparison of the antimicrobial activities of materials made via each method.Peer reviewe
    corecore