Search results for "Recursion"

showing 10 items of 61 documents

Visibly pushdown modular games,

2014

Games on recursive game graphs can be used to reason about the control flow of sequential programs with recursion. In games over recursive game graphs, the most natural notion of strategy is the modular strategy, i.e., a strategy that is local to a module and is oblivious to previous module invocations, and thus does not depend on the context of invocation. In this work, we study for the first time modular strategies with respect to winning conditions that can be expressed by a pushdown automaton. We show that such games are undecidable in general, and become decidable for visibly pushdown automata specifications. Our solution relies on a reduction to modular games with finite-state automat…

FOS: Computer and information sciencesComputer Science::Computer Science and Game TheoryComputer Science - Logic in Computer ScienceTheoryofComputation_COMPUTATIONBYABSTRACTDEVICESTheoretical computer scienceFormal Languages and Automata Theory (cs.FL)Computer scienceComputer Science - Formal Languages and Automata Theory0102 computer and information sciences02 engineering and technologyComputational Complexity (cs.CC)Pushdown01 natural scienceslcsh:QA75.5-76.95Theoretical Computer ScienceComputer Science - Computer Science and Game TheoryComputer Science::Logic in Computer Science0202 electrical engineering electronic engineering information engineeringTemporal logicRecursionbusiness.industrylcsh:MathematicsGames; Modular; Pushdown; Theoretical Computer Science; Information Systems; Computer Science Applications; Computational Theory and MathematicsPushdown automatonModular designDecision problemlcsh:QA1-939Logic in Computer Science (cs.LO)Computer Science ApplicationsUndecidable problemDecidabilityNondeterministic algorithmComputer Science - Computational ComplexityModularTheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGESComputational Theory and Mathematics010201 computation theory & mathematics020201 artificial intelligence & image processinglcsh:Electronic computers. Computer scienceGamesbusinessComputer Science::Formal Languages and Automata TheoryComputer Science and Game Theory (cs.GT)Information SystemsInformation and Computation
researchProduct

Time and space efficient quantum algorithms for detecting cycles and testing bipartiteness

2016

We study space and time efficient quantum algorithms for two graph problems -- deciding whether an $n$-vertex graph is a forest, and whether it is bipartite. Via a reduction to the s-t connectivity problem, we describe quantum algorithms for deciding both properties in $\tilde{O}(n^{3/2})$ time and using $O(\log n)$ classical and quantum bits of storage in the adjacency matrix model. We then present quantum algorithms for deciding the two properties in the adjacency array model, which run in time $\tilde{O}(n\sqrt{d_m})$ and also require $O(\log n)$ space, where $d_m$ is the maximum degree of any vertex in the input graph.

FOS: Computer and information sciencesVertex (graph theory)Quantum PhysicsNuclear and High Energy PhysicsReduction (recursion theory)Two-graphFOS: Physical sciencesGeneral Physics and AstronomyStatistical and Nonlinear PhysicsTheoretical Computer ScienceCombinatoricsComputational Theory and MathematicsComputer Science - Data Structures and AlgorithmsBipartite graphGraph (abstract data type)Adjacency listData Structures and Algorithms (cs.DS)Quantum algorithmAdjacency matrixQuantum Physics (quant-ph)Mathematical PhysicsMathematicsofComputing_DISCRETEMATHEMATICSMathematicsQuantum Information and Computation
researchProduct

Phase-bistable pattern formation in oscillatory systems via rocking: application to nonlinear optical systems

2014

We present a review, together with new results, of a universal forcing of oscillatory systems, termed ‘rocking’, which leads to the emergence of a phase bistability and to the kind of pattern formation associated with it, characterized by the presence of phase domains, phase spatial solitons and phase-bistable extended patterns. The effects of rocking are thus similar to those observed in the classic 2 : 1 resonance (the parametric resonance) of spatially extended systems of oscillators, which occurs under a spatially uniform, time-periodic forcing at twice the oscillations' frequency. The rocking, however, has a frequency close to that of the oscillations (it is a 1 : 1 resonant forcing) …

Forcing (recursion theory)BistabilityCondensed matter physicsbusiness.industryGeneral MathematicsGeneral EngineeringPhase (waves)General Physics and AstronomyResonancePattern formationVortexOpticsAmplitudeParametric oscillatorbusinessMathematicsPhilosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences
researchProduct

Noise Induced Phenomena in Lotka-Volterra Systems

2003

We study the time evolution of two ecosystems in the presence of external noise and climatic periodical forcing by a generalized Lotka-Volterra (LV) model. In the first ecosystem, composed by two competing species, we find noise induced phenomena such as: (i) quasi deterministic oscillations, (ii) stochastic resonance, (iii) noise delayed extinction and (iv) spatial patterns. In the second ecosystem, composed by three interacting species (one predator and two preys), using a discrete model of the LV equations we find that the time evolution of the spatial patterns is strongly dependent on the initial conditions of the three species.

Forcing (recursion theory)ExtinctionStatistical Mechanics (cond-mat.stat-mech)Stochastic resonanceGeneral MathematicsLotka–Volterra equationsPopulations and Evolution (q-bio.PE)Time evolutionFOS: Physical sciencesGeneral Physics and AstronomyStatistical mechanicsNoiseControl theoryFOS: Biological sciencesSpatial ecologyQuantitative Biology::Populations and EvolutionStatistical physicsQuantitative Biology - Populations and EvolutionCondensed Matter - Statistical MechanicsMathematics
researchProduct

Stability of stationary solutions of a one-dimensional parabolic equation with homogeneous Neumann boundary conditions

1991

for some x in [0, rr]. The guiding idea of this paper is to observe the changes in the stability behavior of the solutions if we perturb the autonomous problem intro- ducing a forcing term g. In [8] it was shown that iff and g are related by a boundedness condi- tion (see condition (* ) in Theorem 3.1) then there exists a stable solution of (1.1) “close” to each stable solution of (1.2). We want to call these stable solutions of (1.1)

Forcing (recursion theory)HomogeneousApplied MathematicsMathematical analysisNeumann boundary conditionStability (probability)AnalysisTerm (time)MathematicsJournal of Differential Equations
researchProduct

Why (not) assess? Views from the academic departments of Finnish universities

2010

In Europe, national quality assurance systems of higher education have begun to be established. In Finland, this development has had the consequence of forcing universities to take notice of assessment procedures. However, little is known about the procedures taking place in individual academic departments as a result of this pan‐European trend. This article describes how academics currently comprehend quality assessment, paying particular attention to self‐evaluations and quality assurance systems. Altogether, the paper casts light on how academics are responding to the increasing university assessment activities.

Forcing (recursion theory)NoticeHigher educationbusiness.industryQuality assessment4. EducationEducational quality05 social sciences050301 educationPublic relationsEducationContent analysisPolitical science0502 economics and businessSelf evaluationPedagogybusiness0503 educationQuality assurance050203 business & managementAssessment & Evaluation in Higher Education
researchProduct

Germany: Where Are We Going?

2012

Germany’s health policy, in the past, has tried to limit health expenditures by defining an overall health budget, by installing a DRG-system and by forcing patients to participate directly at health costs by demanding copayments. These measurements were somehow effective in keeping premiums stable but have led to resource allocation at the bedside and therefore on an implicit level. Yet, implicit-level decisions create ethical dilemmas for physicians as they not only have to deliver best medical care but shall also have cost in mind, are unjust because rationing criteria differ from one case to another, and create a general fear of legal uncertainty, in turn leading to defensive medicine w…

Forcing (recursion theory)Public economicsLegitimationmedia_common.quotation_subjectRationingResource allocationBusinessSolidarityDemocracyHealth policymedia_commonDefensive medicine
researchProduct

On the Kneser property for reaction–diffusion equations in some unbounded domains with an -valued non-autonomous forcing term

2012

Abstract In this paper, we prove the Kneser property for a reaction–diffusion equation on an unbounded domain satisfying the Poincare inequality with an external force taking values in the space H − 1 . Using this property of solutions we check also the connectedness of the associated global pullback attractor. We study also similar properties for systems of reaction–diffusion equations in which the domain is the whole R N . Finally, the results are applied to a generalized logistic equation.

Forcing (recursion theory)Social connectednessApplied MathematicsMathematical analysisPoincaré inequalityPullback attractorSpace (mathematics)Domain (mathematical analysis)symbols.namesakeReaction–diffusion systemsymbolsLogistic functionAnalysisMathematicsNonlinear Analysis: Theory, Methods & Applications
researchProduct

A comparison of efficient methods for the computation of Born gluon amplitudes

2006

We compare four different methods for the numerical computation of the pure gluonic amplitudes in the Born approximation. We are in particular interested in the efficiency of the various methods as the number n of the external particles increases. In addition we investigate the numerical accuracy in critical phase space regions. The methods considered are based on (i) Berends-Giele recurrence relations, (ii) scalar diagrams, (iii) MHV vertices and (iv) BCF recursion relations.

High Energy Physics - TheoryPhysicsNuclear and High Energy PhysicsRecurrence relationComputationScalar (mathematics)FOS: Physical sciencesRecursion (computer science)Space (mathematics)GluonHigh Energy Physics - PhenomenologyHigh Energy Physics - Phenomenology (hep-ph)AmplitudeHigh Energy Physics - Theory (hep-th)Born approximationMathematical physicsJournal of High Energy Physics
researchProduct

A novel integral representation for the Adler function

2005

New integral representations for the Adler D-function and the R-ratio of the electron-positron annihilation into hadrons are derived in the general framework of the analytic approach to QCD. These representations capture the nonperturbative information encoded in the dispersion relation for the D-function, the effects due to the interrelation between spacelike and timelike domains, and the effects due to the nonvanishing pion mass. The latter plays a crucial role in this analysis, forcing the Adler function to vanish in the infrared limit. Within the developed approach the D-function is calculated by employing its perturbative approximation as the only additional input. The obtained result …

High Energy Physics - TheoryQuantum chromodynamicsPhysicsNuclear and High Energy PhysicsParticle physicsAnnihilationForcing (recursion theory)High Energy Physics::PhenomenologyFOS: Physical sciencesFísicaFunction (mathematics)High Energy Physics - PhenomenologyRange (mathematics)High Energy Physics - Phenomenology (hep-ph)PionHigh Energy Physics - Theory (hep-th)Dispersion relationLimit (mathematics)Mathematical physicsJournal of Physics G: Nuclear and Particle Physics
researchProduct