87,200 research outputs found

    Testing Generalised Freeness of Words

    No full text
    Pseudo-repetitions are a natural generalisation of the classical notion of repetitions in sequences: they are the repeated concatenation of a word and its encoding under a certain morphism or antimorphism (anti-/morphism, for short). We approach the problem of deciding efficiently, for a word w and a literal anti-/morphism f, whether w contains an instance of a given pattern involving a variable x and its image under f, i.e., f(x). Our results generalise both the problem of finding fixed repetitive structures (e.g., squares, cubes) inside a word and the problem of finding palindromic structures inside a word. For instance, we can detect efficiently a factor of the form xx^Rxxx^R, or any other pattern of such type. We also address the problem of testing efficiently, in the same setting, whether the word w contains an arbitrary pseudo-repetition of a given exponent

    Nanozymes: Gold-nanoparticles-based Transphosphorylation Catalysts

    No full text
    Particularly effective: The self-assembly of triazacyclonane-functionalized thiols on the surface of nanosize gold particles provides a facile entry to functional gold nanoparticles that, upon complexation with ZnII, turn into powerful catalysts for the cleavage of phosphate esters (see scheme). Because of their RNase-like behavior they are dubbed nanozymes

    Complexity-preserving simulations among three variants of accepting networks of evolutionary processors

    No full text
    In this paper we consider three variants of accepting networks of evolutionary processors. It is known that two of them are equivalent to Turing machines. We propose here a direct simulation of one device by the other. Each computational step in one model is simulated in a constant number of computational steps in the other one while a translation via Turing machines squares the time complexity. We also discuss the possibility of constructing simulations that preserve not only complexity, but also the shape of the simulated network. © 2011 Springer Science+Business Media B.V.This work was supported by the Academy of Finland, projects 132727, 122426, and 108421. F. Manea acknowledges the support from the Alexander von Humboldt Foundation. J Sempere acknowledges the support from the Spanish Ministerio de Educacion y Ciencia project TIN2007-60769.Bottoni ., P.; Labella ., A.; Manea ., F.; Mitrana, V.; Petre ., I.; Sempere Luna, JM. (2011). Complexity-preserving simulations among three variants of accepting networks of evolutionary processors. Natural Computing. 10(1):429-445. https://doi.org/10.1007/s11047-010-9238-5S429445101Alhazov A, Bel Enguix G, Rogozhin Y (2009a) Obligatory hybridnetworks of evolutionary processors. In: International conference on agents and artificial intelligence (ICAART 2009), pp 613–618Alhazov A, Csuhaj-Varj E, Martn-Vide C, Rogozhin Y (2009b) On the size of computationally complete hybrid networks ofevolutionaryprocessors. Theor Comput Sci 410:3188–3197Bottoni P, Labella A, Manea F, Mitrana V, Sempere J (2009a) Filter position in networks of evolutionary processors does not matter: a direct proof. In: Proc. 15th international meeting on DNA computing and molecular programming. 8–11 June 2009, Fayetteville, ArkansasBottoni P, Labella A, Mitrana V, Sempere JM (2009b) Networks of evolutionary picture processors with filtered connections. In: Unconventional computation, 8th international conference (UC 2009), LNCS, vol 5715. Springer, Heidelberg, pp 70–84Castellanos J, Martín-Vide C, Mitrana V, Sempere J (2001) Solving NP-complete problems with networks of evolutionary processors. In: International work-conference on artificial and natural neural networks (IWANN 2001), Lecture notes in computer science, vol 2084, pp 621–628Csuhaj-Varjú E, Mitrana V (2000) Evolutionary systems: a language generating device inspired by evolving communities of cells. Acta Inform 36:913–926Csuhaj-Varjú E, Salomaa A (1997) Networks of parallel language processors. In: New trends in formal languages, Lecture notes in computer science, vol 1218, pp 299–318Dassow J, Truthe B (2007) On the power of networks of evolutionary processors. In: Machines, computations, and universality (MCU 2007), Lecture notes in computer science, vol 4667, pp 158–169Drăgoi C, Manea F (2008) On the descriptional complexity of accepting networks of evolutionary processors with filtered connections. Int J Found Comput Sci 19:1113–1132Drăgoi C, Manea F, Mitrana V (2007) Accepting networks of evolutionary processors with filtered connections. J Univers Comput Sci 13:1598–1614Errico L, Jesshope C (1994) Towards a new architecture for symbolic processing. In: Artificial intelligence and information-control systems of robots ’94, World Scientific, Singapore, pp 31–40Fahlman SE, Hinton GE, Seijnowski TJ (1983) Massively parallel architectures for AI: NETL, THISTLE and Boltzmann machines. In: Proc. of the national conference on artificial intelligence, pp 109–113Hillis W (1985) The connection machine. MIT Press, CambridgeManea F, Martin-Vide C, Mitrana V (2007) On the size complexity of universal accepting hybrid networks of evolutionary processors. Math Struct Comput Sci 17:753–771Margenstern M, Mitrana V, Perez-Jimenez M (2005) Accepting hybrid networks of evolutionary systems. In: DNA based computers 10, Lecture notes in computer science, vol, pp 235–246Martín-Vide C, Mitrana V (2005) Networks of evolutionary processors: results and perspectives. In: Molecular computational models: unconventional approaches. dea Group Publishing, Hershey, pp 78–114Păun G (2000) Computing with membranes. J Comput Syst Sci 61:108–143Păun G, Sântean L (1989) Parallel communicating grammar systems: the regular case. Ann Univ Bucharest Ser Matematica Inform 38:55–63Rozenberg G, Salomaa A (eds) (1997) Handbook of formal languages. Springer–Verlag, BerlinSankoff D et al. (1992) Gene order comparisons for phylogenetic inference: evolution of the mitochondrial genome. Proc Natl Acad Sci USA 89:6575–657

    Simultaneous/selective detection of dopamine and ascorbic acid at synthetic zeolite-modified/graphite-epoxy composite macro/quasi-microelectrodes

    No full text
    The present paper aims to miniaturize a graphite-epoxy and synthetic zeolite-modified graphite-epoxy composite macroelectrode as a quasi-microelectrode aiming in vitro and also, envisaging in vivo simultaneous electrochemical detection of dopamine (DA) and ascorbic acid (AA) neurotransmitters, or DA detection in the presence of AA. The electrochemical behavior and the response of the designed materials to the presence of dopamine and ascorbic acid without any protective membranes were studied by cyclic voltammetry and constant-potential amperometry techniques. The catalytic effect towards dopamine detection was proved for the synthetic zeolite-modified graphite-epoxy composite quasi-microelectrode, allowing increasing the sensitivity and selectivity for this analyte detection, besides a possible electrostatic attraction between dopamine cation and the negative surface of the synthetic zeolite and electrostatic repulsion with ascorbic acid anion. Also, the synthetic zeolite-modified graphite-epoxy composite quasi-microelectrode gave the best electroanalytical parameters for dopamine detection using constant-potential amperometry, the most useful technique for practical applications

    Computing with Foresight and Industry

    No full text
    This book constitutes the refereed proceedings of the 15th Conference on Computability in Europe, CiE 2019, held in Durham, UK, in July 2019. The 20 revised full papers presented were carefully reviewed and selected from 35 submissions. In addition, this volume includes 7 invited papers. The conference CiE 2018 had the following six special sessions: computational neuroscience, history and philosophy of computing, lowness notions in computability, probabilistic programming and higher-order computation, smoothed and probabilistic analysis of algorithms, and transnite computations

    Pan between Renaissance and Fin-de-Siècle: the lesson of Jacob Burckhardt

    No full text
    The essay moves from the work of Jacob Burckhardt and the strategy he devised for his study of 'The Civilization of the Renaissance in Italy.' It then traces various responses to Burckhardt's notion of "civilization" in British and European culture between the 1860s and the 1930s. Burckhardt's cultural history prompted the revival of Pan within the definition of modern identity and gender building. The cult of the pagan god Pan spread from the arts to the wide cultural scenario: from scholarly essays, travelogues, novels, gothic stories, it spread into children's literature, music, illustrations, periodicals, ballet and costume, and eventually the cinema. The conclusion of the essay points to the death of Pan, as described by D. H. Lawrence in the cultural context of the Fascist regime of the 1930s, bent on the ideological retrieval of Roman military history
    corecore