Search results for "DEVICES"

showing 10 items of 615 documents

Rapid and eco-friendly synthesis of graphene oxide-silica nanohybrids

2014

The increasing interest in Graphene oxide (GO) is due to many issues: the presence of both sp2-conjugated atoms and oxygen-containing functional groups provides a strong hydrophilicity and the possibility to further functionalize it with other molecules (i.e. π-π interactions covalent attachment etc.) [1]. Furthermore since the GO is biocompatible and noncytotoxic many studies have been recently focused on the development of GO-based nanodevices for bioimaging DNA detection drug delivery. Due to their low cytotoxicity and large internal surface area silica nanoparticles have been taken into account as promising material for biolabeling and drug loading/delivery. Particular consideration has recently been demonstrated for GO-silica composites because of the potentialities for electrical applications their chemical inertia and stability toward ions exposure. The possibility to combine the extraordinary properties of GO and silica offers several advantages for the realization of nanoprobes for biological applications and of biosensor [12]. The strategy for the fabrication of GO-nanosilica nanohybrids can be schematized as follows: (i) synthesis of GO by oxidizing graphite powder with the method described by Marcano et al. [3] (ii) Preparation of oxygen-loaded silica nanoparticles by thermal treatments in controlled atmosphere in order to induce high NIR emission at 1272 nm from high purity silica nanoparticles. (iii) preparation of GrO-silica nanohybrid films via rapid solvent casting in water. The nanohybrids were tested by XPS FTIR Raman analysis UV photoluminescence analysis TGA Zeta potential measurements electrical tests AFM and SEM. Several nanohybrids were prepared by combining two different typologies of GO and two different samples of silica.
researchProduct

Descriptional and Computational Complexity of the Circuit Representation of Finite Automata

2018

In this paper we continue to investigate the complexity of the circuit representation of DFA—BC-complexity. We compare it with nondeterministic state complexity, obtain upper and lower bounds which differ only by a factor of 4 for a Binary input alphabet. Also we prove that many simple operations (determining if a state is reachable or if an automaton is minimal) are PSPACE-complete for DFA given in circuit representation.

TheoryofComputation_COMPUTATIONBYABSTRACTDEVICESFinite-state machineTheoretical computer scienceComputational complexity theoryComputer science020208 electrical & electronic engineering020206 networking & telecommunications02 engineering and technologyUpper and lower boundsAutomatonNondeterministic algorithmTheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGESSimple (abstract algebra)0202 electrical engineering electronic engineering information engineeringState (computer science)Representation (mathematics)Computer Science::Formal Languages and Automata Theory
researchProduct

An Approximate Determinization Algorithm for Weighted Finite-State Automata

2001

Nondeterministic weighted finite-state automata are a key abstraction in automatic speech recognition systems. The efficiency of automatic speech recognition depends directly on the sizes of these automata and the degree of nondeterminism present, so recent research has studied ways to determinize and minimize them, using analogues of classical automata determinization and minimization. Although, as we describe here, determinization can in the worst case cause poly-exponential blowup in the number of states of a weighted finite-state automaton, in practice it is remarkably successful. In extensive experiments in automatic speech recognition systems, deterministic weighted finite-state autom…

TheoryofComputation_COMPUTATIONBYABSTRACTDEVICESFinite-state machineTheoretical computer scienceGeneral Computer ScienceComputer scienceApplied MathematicsComputer Science ApplicationsAutomatonNondeterministic algorithmNondeterministic finite automaton with ε-movesComputer Science::SoundDeterministic automatonTheory of computationStandard testMinificationAlgorithmComputer Science::Formal Languages and Automata TheoryAlgorithmica
researchProduct

Supplementary tables from Antibiotics accelerate growth at the expense of immunity

2021

This file contains the enrichment, annotation, a list of pathogenic bacteria, the primer sequences, and life-history data

TheoryofComputation_COMPUTATIONBYABSTRACTDEVICESGeneralLiterature_REFERENCE(e.g.dictionariesencyclopediasglossaries)
researchProduct

Quantum versus Probabilistic One-Way Finite Automata with Counter

2001

The paper adds the one-counter one-way finite automaton [6] to the list of classical computing devices having quantum counterparts more powerful in some cases. Specifically, two languages are considered, the first is not recognizable by deterministic one-counter one-way finite automata, the second is not recognizable with bounded error by probabilistic one-counter one-way finite automata, but each recognizable with bounded error by a quantum one-counter one-way finite automaton. This result contrasts the case of one-way finite automata without counter, where it is known [5] that the quantum device is actually less powerful than its classical counterpart.

TheoryofComputation_COMPUTATIONBYABSTRACTDEVICESNested wordComputer scienceTimed automatonBüchi automatonω-automatonNondeterministic finite automaton with ε-movesTuring machinesymbols.namesakeDFA minimizationDeterministic automatonContinuous spatial automatonQuantum finite automataDeterministic system (philosophy)Two-way deterministic finite automatonNondeterministic finite automatonDiscrete mathematicsFinite-state machineQuantum dot cellular automatonNonlinear Sciences::Cellular Automata and Lattice GasesMobile automatonTheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGESDeterministic finite automatonProbabilistic automatonsymbolsAutomata theoryComputer Science::Formal Languages and Automata TheoryQuantum cellular automaton
researchProduct

Multiple Usage of Random Bits in Finite Automata

2012

Finite automata with random bits written on a separate 2-way readable tape can recognize languages not recognizable by probabilistic finite automata. This shows that repeated reading of random bits by finite automata can have big advantages over one-time reading of random bits.

TheoryofComputation_COMPUTATIONBYABSTRACTDEVICESNested wordFinite-state machineTheoretical computer scienceKolmogorov complexityComputer scienceω-automatonNonlinear Sciences::Cellular Automata and Lattice GasesBit fieldTuring machinesymbols.namesakeTheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGESsymbolsQuantum finite automataAutomata theoryArithmeticComputer Science::DatabasesComputer Science::Formal Languages and Automata Theory
researchProduct

Tally languages accepted by Monte Carlo pushdown automata

1997

Rather often difficult (and sometimes even undecidable) problems become easily decidable for tally languages, i.e. for languages in a single-letter alphabet. For instance, the class of languages recognizable by 1-way nondeterministic pushdown automata equals the class of the context-free languages, but the class of the tally languages recognizable by 1-way nondeterministic pushdown automata, contains only regular languages [LP81]. We prove that languages over one-letter alphabet accepted by randomized one-way 1-tape Monte Carlo pushdown automata are regular. However Monte Carlo pushdown automata can be much more concise than deterministic 1-way finite state automata.

TheoryofComputation_COMPUTATIONBYABSTRACTDEVICESNested wordTheoretical computer scienceComputational complexity theoryComputer scienceDeterministic pushdown automatonTuring machinesymbols.namesakeRegular languageComputer Science::Logic in Computer ScienceQuantum finite automataNondeterministic finite automatonDiscrete mathematicsFinite-state machineDeterministic context-free languageComputabilityDeterministic context-free grammarContext-free languagePushdown automatonAbstract family of languagesComputer Science::Computation and Language (Computational Linguistics and Natural Language and Speech Processing)Cone (formal languages)Embedded pushdown automatonUndecidable problemNondeterministic algorithmTheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGESDeterministic finite automatonsymbolsComputer Science::Programming LanguagesAlphabetComputer Science::Formal Languages and Automata Theory
researchProduct

Local automata and completion

1993

The problem of completing a finite automata preserving its properties is here investigated in the case of deterministic local automata. We show a decision procedure and give an algorithm which complete a deterministic local automaton (if the completion exists) with another one, having the same number of states.

TheoryofComputation_COMPUTATIONBYABSTRACTDEVICESNested wordTheoretical computer scienceComputer scienceTimed automatonω-automatonNonlinear Sciences::Cellular Automata and Lattice GasesTheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGESDeterministic finite automatonDFA minimizationAutomata theoryQuantum finite automataNondeterministic finite automatonComputer Science::Formal Languages and Automata Theory
researchProduct

The computational power of continuous time neural networks

1997

We investigate the computational power of continuous-time neural networks with Hopfield-type units. We prove that polynomial-size networks with saturated-linear response functions are at least as powerful as polynomially space-bounded Turing machines.

TheoryofComputation_COMPUTATIONBYABSTRACTDEVICESQuantitative Biology::Neurons and CognitionComputational complexity theoryArtificial neural networkComputer sciencebusiness.industryComputer Science::Neural and Evolutionary ComputationNSPACEComputational resourcePower (physics)Turing machinesymbols.namesakeCellular neural networksymbolsArtificial intelligenceTypes of artificial neural networksbusiness
researchProduct

Some Afterthoughts on Hopfield Networks

1999

In the present paper we investigate four relatively independent issues, which complete our knowledge regarding the computational aspects of popular Hopfield nets. In Section 2 of the paper, the computational equivalence of convergent asymmetric and Hopfield nets is shown with respect to network size. In Section 3, the convergence time of Hopfield nets is analyzed in terms of bit representations. In Section 4, a polynomial time approximate algorithm for the minimum energy problem is shown. In Section 5, the Turing universality of analog Hopfield nets is studied. peerReviewed

TheoryofComputation_COMPUTATIONBYABSTRACTDEVICESQuantitative Biology::Neurons and CognitionComputer scienceParallel algorithmHopfield netsApproximation algorithmSection (fiber bundle)Hopfield networknetworksHopfieldAlgorithmTime complexityEquivalence (measure theory)Energy (signal processing)
researchProduct