Search results for "Theoretical Computer Science"

showing 10 items of 1151 documents

A taxonomy for wavelet neural networks applied to nonlinear modelling

2008

This article presents a novel classification of wavelet neural networks based on the orthogonality/non-orthogonality of neurons and the type of nonlinearity employed. On the basis of this classification different network types are studied and their characteristics illustrated by means of simple one-dimensional nonlinear examples. For multidimensional problems, which are affected by the curse of dimensionality, the idea of spherical wavelet functions is considered. The behaviour of these networks is also studied for modelling of a low-dimension map.

Nonlinear systemWaveletOrthogonalityArtificial neural networkBasis (linear algebra)Control and Systems EngineeringTaxonomy (general)Nonlinear modellingAlgorithmComputer Science ApplicationsTheoretical Computer ScienceMathematicsCurse of dimensionalityInternational Journal of Systems Science
researchProduct

On Fibrations Between Internal Groupoids and Their Normalizations

2018

We characterize fibrations and $$*$$ -fibrations in the 2-category of internal groupoids in terms of the comparison functor from certain pullbacks to the corresponding strong homotopy pullbacks. As an application, we deduce the internal version of the Brown exact sequence for $$*$$ -fibrations from the internal version of the Gabriel–Zisman exact sequence. We also analyse fibrations and $$*$$ -fibrations in the category of arrows and study when the normalization functor preserves and reflects them. This analysis allows us to give a characterization of protomodular categories using strong homotopy kernels and a generalization of the Snake Lemma.

Normalization (statistics)Pure mathematicsInternal groupoid Fibration Strong h-pullback Protomodular categoryGeneral Computer ScienceFibrationSnake lemmaStrong h-pullbackMathematics::Algebraic Topology01 natural sciencesTheoretical Computer ScienceMathematics::Algebraic GeometryMathematics::K-Theory and HomologyMathematics::Category Theory0103 physical sciences0101 mathematicsMathematics::Symplectic GeometryMathematicsExact sequenceInternal groupoidAlgebra and Number TheoryFunctorHomotopy010102 general mathematicsFibrationInternal versionSettore MAT/02 - AlgebraProtomodular categoryTheory of computation010307 mathematical physicsApplied Categorical Structures
researchProduct

Quantum algorithms for search with wildcards and combinatorial group testing

2012

We consider two combinatorial problems. The first we call "search with wildcards": given an unknown n-bit string x, and the ability to check whether any subset of the bits of x is equal to a provided query string, the goal is to output x. We give a nearly optimal O(sqrt(n) log n) quantum query algorithm for search with wildcards, beating the classical lower bound of Omega(n) queries. Rather than using amplitude amplification or a quantum walk, our algorithm is ultimately based on the solution to a state discrimination problem. The second problem we consider is combinatorial group testing, which is the task of identifying a subset of at most k special items out of a set of n items, given the…

Nuclear and High Energy PhysicsFOS: Physical sciencesGeneral Physics and Astronomy0102 computer and information sciences01 natural sciencesUpper and lower boundsTheoretical Computer ScienceCombinatoricsSet (abstract data type)Amplitude amplification0103 physical sciencesQuantum walk010306 general physicsMathematical PhysicsMathematicsQuantum PhysicsQuery stringComputer Science::Information RetrievalString (computer science)Statistical and Nonlinear PhysicsWildcard charactercomputer.file_formatComputational Theory and Mathematics010201 computation theory & mathematicsQuantum algorithmQuantum Physics (quant-ph)computerQuantum Information and Computation
researchProduct

Limits on entropic uncertainty relations

2010

We consider entropic uncertainty relations for outcomes of the measurements of a quantum state in 3 or more mutually unbiased bases (MUBs), chosen from the standard construction of MUBs in prime dimension. We show that, for any choice of 3 MUBs and at least one choice of a larger number of MUBs, the best possible entropic uncertainty relation can be only marginally better than the one that trivially follows from the relation by Maassen and Uffink for 2 bases.

Nuclear and High Energy PhysicsGeneral Physics and AstronomyStatistical and Nonlinear PhysicsState (functional analysis)Prime (order theory)Theoretical Computer ScienceCombinatoricsComputational Theory and MathematicsDimension (vector space)Entropic uncertaintyNuclear ExperimentMathematical PhysicsMutually unbiased basesMathematicsQuantum Information and Computation
researchProduct

Correcting for Potential Barriers in Quantum Walk Search

2015

A randomly walking quantum particle searches in Grover's $\Theta(\sqrt{N})$ iterations for a marked vertex on the complete graph of $N$ vertices by repeatedly querying an oracle that flips the amplitude at the marked vertex, scattering by a "coin" flip, and hopping. Physically, however, potential energy barriers can hinder the hop and cause the search to fail, even when the amplitude of not hopping decreases with $N$. We correct for these errors by interpreting the quantum walk search as an amplitude amplification algorithm and modifying the phases applied by the coin flip and oracle such that the amplification recovers the $\Theta(\sqrt{N})$ runtime.

Nuclear and High Energy PhysicsQuantum PhysicsTheoryofComputation_COMPUTATIONBYABSTRACTDEVICESComplete graphGeneral Physics and AstronomyFOS: Physical sciencesTheoryofComputation_GENERALStatistical and Nonlinear PhysicsOracleTheoretical Computer ScienceVertex (geometry)CombinatoricsAmplitudeComputational Theory and MathematicsAmplitude amplificationTheoryofComputation_ANALYSISOFALGORITHMSANDPROBLEMCOMPLEXITYGrover's algorithmQuantum algorithmQuantum walkQuantum Physics (quant-ph)Mathematical PhysicsMathematicsMathematicsofComputing_DISCRETEMATHEMATICS
researchProduct

Mathematical and numerical analysis of initial boundary valueproblem for a linear nonlocal equation

2019

We propose and study a numerical scheme for bounded distributional solutions of the initial boundary value problem for the anomalous diffusion equation ∂t u +Lμu = 0 in a bounded domain supplemented with inhomogeneous boundary conditions. Here Lμ is a class of nonlocal operators including fractional Laplacian. ⃝c 2019 InternationalAssociation forMathematics andComputers in Simulation (IMACS). Published by ElsevierB.V.All rights reserved.

Numerical AnalysisGeneral Computer ScienceAnomalous diffusionApplied MathematicsNumerical analysisMathematical analysisDomain (mathematical analysis)Theoretical Computer ScienceModeling and SimulationScheme (mathematics)Bounded functionFractional Laplacian; Numerical method; Anomalous diffusion equation; Boundary value problemBoundary value problemFractional LaplacianMathematicsMathematics and Computers in Simulation
researchProduct

A normalized iterative Smoothed Particle Hydrodynamics method

2020

Abstract In this paper we investigate on a normalized iterative approach to improve the Smoothed Particle Hydrodynamics (SPH) estimate of a function. The method iterates on the residuals of an initial SPH approximation to obtain a more accurate solution. The iterative strategy preserves the matrix-free nature of the method, does not require changes on the kernel function and it is not affected by disordered data distribution. The iterative refinement is further improved by ensuring linear approximation order to the starting iterative values. We analyze the accuracy and the convergence of the method with the standard and normalized formulation giving evidence of the enhancements obtained wit…

Numerical AnalysisGeneral Computer ScienceApplied Mathematics010103 numerical & computational mathematics02 engineering and technologyFunction (mathematics)01 natural sciencesDomain (mathematical analysis)Theoretical Computer ScienceSmoothed-particle hydrodynamicsSettore MAT/08 - Analisi NumericaDistribution (mathematics)Iterated residuals Normalized Smoothed Particle Hydrodynamics Accuracy ConvergenceIterated functionIterative refinementModeling and SimulationConvergence (routing)0202 electrical engineering electronic engineering information engineeringApplied mathematics020201 artificial intelligence & image processingLinear approximation0101 mathematicsMathematics
researchProduct

Hybrid model of an inventer-induction motor system

1969

A model of the three-phase bridge inverter with a wide range of validity is proposed. This model can be used for the simulation of the inverter induction motor system on a hybrid computer or an analogue computer. In the latter case it is necessary to achieve a logical device which realizes the inverter model. After a block diagram for the simulation of the inverter induction motor system is illustrated as well as the circuital diagram of the device which simulates the inverter. Finally the authors describe the tests carried out in order to verify the validity of the inverter model and the correct operating of the device which simulates the inverter.

Numerical AnalysisGeneral Computer ScienceComputer scienceApplied MathematicsAnalog computerDiagramBlock diagramBridge (nautical)Theoretical Computer Sciencelaw.inventionControl theorylawModeling and SimulationHybrid computerInverterHybrid modelInduction motorMathematics and Computers in Simulation
researchProduct

Electrophoretic properties of charged colloidal suspensions: Application of a hybrid MD/LB method

2006

Abstract Electrophoretic properties of charged colloidal suspensions are investigated using a hybrid simulation method. In this method, the colloidal particles are propagated via Newton’s equations of motion using molecular dynamics (MD), while they are coupled to a structureless solvent that is modelled by the Lattice-Boltzmann (LB) method.

Numerical AnalysisMaterials scienceGeneral Computer ScienceApplied Mathematicsdigestive oral and skin physiologyEquations of motionTheoretical Computer ScienceCondensed Matter::Soft Condensed MatterSolventElectrophoresisMolecular dynamicsColloidClassical mechanicsChemical physicsColloidal particleModeling and SimulationMathematics and Computers in Simulation
researchProduct

Hermite interpolation: The barycentric approach

1991

The barycentric formulas for polynomial and rational Hermite interpolation are derived; an efficient algorithm for the computation of these interpolants is developed. Some new interpolation principles based on rational interpolation are discussed.

Numerical AnalysisMathematical analysisComputingMethodologies_IMAGEPROCESSINGANDCOMPUTERVISIONMathematicsofComputing_NUMERICALANALYSISTrilinear interpolationStairstep interpolationBirkhoff interpolationComputer Science ApplicationsTheoretical Computer SciencePolynomial interpolationComputational MathematicsComputational Theory and MathematicsNearest-neighbor interpolationHermite interpolationComputingMethodologies_SYMBOLICANDALGEBRAICMANIPULATIONApplied mathematicsSpline interpolationSoftwareComputingMethodologies_COMPUTERGRAPHICSMathematicsInterpolationComputing
researchProduct