Search results for "Turing"

showing 10 items of 2644 documents

A Survey of Continuous-Time Computation Theory

1997

Motivated partly by the resurgence of neural computation research, and partly by advances in device technology, there has been a recent increase of interest in analog, continuous-time computation. However, while special-case algorithms and devices are being developed, relatively little work exists on the general theory of continuous- time models of computation. In this paper, we survey the existing models and results in this area, and point to some of the open research questions. Final Draft peerReviewed

Discrete mathematicsTheoretical computer scienceComputabilityComputationModel of computationneuraalilaskentaTuring machineTuring machinesymbols.namesakeModels of neural computationComputable functionOpen researchTheory of computationsymbolsHopfield networkcellular automatondifferential analyzerMathematics
researchProduct

Probabilities to Accept Languages by Quantum Finite Automata

1999

We construct a hierarchy of regular languages such that the current language in the hierarchy can be accepted by 1-way quantum finite automata with a probability smaller than the corresponding probability for the preceding language in the hierarchy. These probabilities converge to 1/2.

Discrete mathematicsTheoretical computer scienceNested wordFinite-state machineHierarchy (mathematics)Computer scienceComputer Science::Computation and Language (Computational Linguistics and Natural Language and Speech Processing)Turing machinesymbols.namesakeNonlinear Sciences::Exactly Solvable and Integrable SystemsRegular languageProbabilistic automatonAnalytical hierarchysymbolsComputer Science::Programming LanguagesQuantum finite automataQuantum algorithmNondeterministic finite automaton
researchProduct

Minimal nontrivial space complexity of probabilistic one- way turing machines

2005

Languages recognizable in o(log log n) space by probabilistic one — way Turing machines are proved to be regular. This solves an open problem in [4].

Discrete mathematicsTheoryofComputation_COMPUTATIONBYABSTRACTDEVICESSuper-recursive algorithmProbabilistic Turing machineLinear speedup theoremNSPACEDescription numberCombinatoricsTuring machinesymbols.namesakeTheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGESNon-deterministic Turing machinesymbolsTime hierarchy theoremComputer Science::Formal Languages and Automata TheoryMathematics
researchProduct

Uncountable classical and quantum complexity classes

2018

It is known that poly-time constant-space quantum Turing machines (QTMs) and logarithmic-space probabilistic Turing machines (PTMs) recognize uncountably many languages with bounded error (A.C. Cem Say and A. Yakaryılmaz, Magic coins are useful for small-space quantum machines. Quant. Inf. Comput. 17 (2017) 1027–1043). In this paper, we investigate more restricted cases for both models to recognize uncountably many languages with bounded error. We show that double logarithmic space is enough for PTMs on unary languages in sweeping reading mode or logarithmic space for one-way head. On unary languages, for quantum models, we obtain middle logarithmic space for counter machines. For binary la…

Discrete mathematicsUnary operationComputer scienceGeneral MathematicsLinear spaceMagic (programming)Binary number0102 computer and information sciences02 engineering and technology01 natural sciencesComputer Science ApplicationsTuring machinesymbols.namesake010201 computation theory & mathematics0202 electrical engineering electronic engineering information engineeringComplexity classsymbols020201 artificial intelligence & image processingUncountable setTime complexitySoftwareRAIRO - Theoretical Informatics and Applications
researchProduct

Timed Sets, Functional Complexity, and Computability

2012

AbstractThe construction of various categories of “timed sets” is described in which the timing of maps is considered modulo a “complexity order”. The properties of these categories are developed: under appropriate conditions they form discrete, distributive restriction categories with an iteration. They provide a categorical basis for modeling functional complexity classes and allow the development of computability within these settings. Indeed, by considering “program objects” and the functions they compute, one can obtain models of computability – i.e. Turing categories – in which the total maps belong to specific complexity classes. Two examples of this are introduced in some detail whi…

Discrete mathematicscomplexity measurescomputabilityTheoretical computer scienceGeneral Computer ScienceBasis (linear algebra)Restriction categoriesComputabilityModuloTuring categoriesfunctional complexityTheoretical Computer ScienceDistributive propertyMathematics::Category TheoryComplexity classCategorical variableTuringcomputerPMathematicscomputer.programming_languageComputer Science(all)Electronic Notes in Theoretical Computer Science
researchProduct

Validation of a New Method for the Diagnosis of Rotor bar Failures via Wavelet Transformation in Industrial Induction Machines

2006

[EN] In this paper, the authors propose a method for the diagnosis of rotor bar failures in induction machines, based on the analysis of the stator current during the startup using the discrete wavelet transform (DWT). Unlike other approaches, the study of the high-order wavelet signals resulting from the decomposition is the core of the proposed method. After an introduction of the physical and mathematical bases of the method, a description of the proposed approach is given; for this purpose, a numerical model of induction machine is used in such a way that the effects of a bar breakage can clearly be shown, avoiding the influence of other phenomena not related with the fault. Afterward, …

Discrete wavelet transformEngineeringStatorCascade algorithmWavelet analysisFault (power engineering)Industrial and Manufacturing Engineeringlaw.inventionHarmonic analysisBroken rotor barssymbols.namesakeWaveletControl theorylawElectrical and Electronic EngineeringFault diagnosisbusiness.industryRotor (electric)Wavelet transformTime–frequency analysisFourier transformControl and Systems Engineeringsymbolsstartup transientINGENIERIA ELECTRICAbusinessInduction motor
researchProduct

The Use of the Wavelet Approximation Signal as a Tool for the Diagnosis of Rotor Bar Failures

2005

[EN] The aim of this paper is to present a new approach for rotor bar failure diagnosis in induction machines. The method focuses on the study of an approximation signal resulting from the wavelet decomposition of the startup stator current. The presence of the left sideband harmonic is used as evidence of the rotor failure in most diagnosis methods based on the analysis of the stator current. Thus, a detailed description of the evolution of the left sideband harmonic during the startup transient is given in this paper; for this purpose, a method for calculating the evolution of the left sideband during the startup is developed, and its results are physically explained. This paper also show…

Discrete wavelet transformEngineeringStatorWavelet analysisSignalIndustrial and Manufacturing Engineeringlaw.inventionHarmonic analysisBroken rotor barsWaveletStartup transientControl theorylawElectrical and Electronic EngineeringFault diagnosisApproximation theorySidebandbusiness.industryRotor (electric)Wavelet transformControl and Systems EngineeringHarmonicINGENIERIA ELECTRICATransient (oscillation)business
researchProduct

Fractional wavelet transform

1997

The wavelet transform, which has had a growing importance in signal and image processing, has been generalized by association with both the wavelet transform and the fractional Fourier transform. Possible implementations of the new transformation are in image compression, image transmission, transient signal processing, etc. Computer simulations demonstrate the abilities of the novel transform. Optical implementation of this transform is briefly discussed.

Discrete wavelet transformLifting schemeComputer scienceNon-uniform discrete Fourier transformMaterials Science (miscellaneous)Stationary wavelet transformComputingMethodologies_IMAGEPROCESSINGANDCOMPUTERVISIONTop-hat transformImage processingData_CODINGANDINFORMATIONTHEORYIndustrial and Manufacturing EngineeringDiscrete Fourier transformWavelet packet decompositionsymbols.namesakeDiscrete Fourier transform (general)Multidimensional signal processingOpticsWaveletHartley transformBusiness and International ManagementS transformConstant Q transformContinuous wavelet transformSignal processingbusiness.industrySecond-generation wavelet transformFourier opticsShort-time Fourier transformWavelet transformFractional wavelet transformFractional Fourier transformTime–frequency analysisFourier transformsymbolsHarmonic wavelet transformbusinessAlgorithmImage compression
researchProduct

Two-dimensional wavelet transform by wavelength multiplexing

1996

The wavelet transform is a useful tool for data compression, analysis of short transient pulses, optical correlators, etc. This transform was obtained optically by the use of the spatial or temporal multiplexing approaches. A two-dimensional wavelet transform is obtained with only one spatial channel. The information of the different scalings is carried in different wavelengths and summed incoherently at the output plane. Laboratory experimental results are demonstrated.

Discrete wavelet transformPhysicsbusiness.industryMaterials Science (miscellaneous)Wavelet transformIndustrial and Manufacturing EngineeringWavelet packet decompositionOpticsWaveletBusiness and International ManagementbusinessHarmonic wavelet transformFast wavelet transformContinuous wavelet transformConstant Q transformApplied Optics
researchProduct

Criteria for Selecting Restructuring Strategies for Distressed or Declining Enterprises

2005

This paper seeks to determine the criteria for choosing restructuring strategies for declining or distressed enterprises. First, the paper differentiates between different stages of decline and different levels of distress, of which bankruptcy is an application. Second, it reviews the different forms of restructuring appearing in the academic literature. Third, it formalizes a descriptive model of determining restructuring applicable to distressed and declining enterprises. Specifically, the selection of a restructuring strategy is influenced not only be general restructuring criteria (firm-specific factors, the environment and characteristics of different restructuring) but also by the dec…

DistressPublic economicsRestructuringBankruptcyBusiness administrationBusinessSelection (genetic algorithm)SSRN Electronic Journal
researchProduct