Search results for "General Mathematics"

showing 10 items of 3795 documents

Creation and cognition for humanoid live dancing

2016

Abstract Computational creativity in dancing is a recent and challenging research field in Artificial Intelligence and Robotics. We present a cognitive architecture embodied in a humanoid robot capable to create and perform dances driven by the perception of music. The humanoid robot is able to suitably move, to react to human mate dancers and to generate novel and appropriate sequences of movements. The approach is based on a cognitive architecture that integrates Hidden Markov Models and Genetic Algorithms. The system has been implemented on a NAO robot and tested in public setting-up live performances, obtaining positive feedbacks from the audience.

Computational creativityComputer scienceComputational creativityGeneral MathematicsCognitive robotics02 engineering and technologyCognitive architectures03 medical and health sciences0302 clinical medicine0202 electrical engineering electronic engineering information engineeringHidden Markov modelDancing robotSettore ING-INF/05 - Sistemi Di Elaborazione Delle Informazionibusiness.industryRoboticsCognitionCognitive architectureCognitive architectureComputer Science ApplicationsControl and Systems EngineeringEmbodied cognition020201 artificial intelligence & image processingArtificial intelligenceCognitive roboticsbusiness030217 neurology & neurosurgerySoftwareHumanoid robotCognitive roboticRobotics and Autonomous Systems
researchProduct

Game-Theoretic Learning and Allocations in Robust Dynamic Coalitional Games

2019

The problem of allocation in coalitional games with noisy observations and dynamic environments is considered. The evolution of the excess is modeled by a stochastic differential inclusion involvin...

Computer Science::Computer Science and Game Theory0209 industrial biotechnology020901 industrial engineering & automationControl and OptimizationDifferential inclusionGame theoreticApplied Mathematics010102 general mathematics02 engineering and technology0101 mathematics01 natural sciencesMathematical economicsMathematicsSIAM Journal on Control and Optimization
researchProduct

On the Quantum and Classical Complexity of Solving Subtraction Games

2019

We study algorithms for solving Subtraction games, which are sometimes referred as one-heap Nim games.

Computer Science::Computer Science and Game TheoryComputer science010102 general mathematicsComputingMilieux_PERSONALCOMPUTINGSubtraction01 natural sciences010305 fluids & plasmasAlgebra0103 physical sciencesComputer Science::Programming LanguagesQuantum algorithmHardware_ARITHMETICANDLOGICSTRUCTURES0101 mathematicsQuantumGame theoryQuantum computer
researchProduct

TUG-OF-WAR, MARKET MANIPULATION, AND OPTION PRICING

2014

We develop an option pricing model based on a tug-of-war game involving the the issuer and holder of the option. This two-player zero-sum stochastic differential game is formulated in a multi-dimensional financial market and the agents try, respectively, to manipulate/control the drift and the volatility of the asset processes in order to minimize and maximize the expected discounted pay-off defined at the terminal date $T$. We prove that the game has a value and that the value function is the unique viscosity solution to a terminal value problem for a partial differential equation involving the non-linear and completely degenerate parabolic infinity Laplace operator.

Computer Science::Computer Science and Game TheoryEconomics and EconometricsPartial differential equationComputer scienceApplied Mathematics010102 general mathematicsMathematicsofComputing_NUMERICALANALYSISBlack–Scholes model01 natural sciences010101 applied mathematicsTerminal valueValuation of optionsAccountingInfinity LaplacianBellman equationDifferential game0101 mathematicsViscosity solutionMathematical economicsSocial Sciences (miscellaneous)FinanceMathematical Finance
researchProduct

Local regularity for time-dependent tug-of-war games with varying probabilities

2016

We study local regularity properties of value functions of time-dependent tug-of-war games. For games with constant probabilities we get local Lipschitz continuity. For more general games with probabilities depending on space and time we obtain H\"older and Harnack estimates. The games have a connection to the normalized $p(x,t)$-parabolic equation $(n+p(x,t))u_t=\Delta u+(p(x,t)-2) \Delta_{\infty}^N u$.

Computer Science::Computer Science and Game TheoryPure mathematicsparabolic p(xTug of warMathematics::Analysis of PDEsHölder condition01 natural sciencesMathematics - Analysis of PDEsFOS: Mathematicsstochastic gamestug-of-war0101 mathematicsConnection (algebraic framework)Harnack's inequalityMathematicsHarnack inequalitySpacetimeHölder continuityApplied Mathematicsta111010102 general mathematicsLipschitz continuity010101 applied mathematicst)-LaplacianConstant (mathematics)AnalysisAnalysis of PDEs (math.AP)Journal of Differential Equations
researchProduct

Modular Strategies for Recursive Game Graphs

2006

AbstractMany problems in formal verification and program analysis can be formalized as computing winning strategies for two-player games on graphs. In this paper, we focus on solving games in recursive game graphs which can model the control flow in sequential programs with recursive procedure calls. While such games can be viewed as the pushdown games studied in the literature, the natural notion of winning in our framework requires the strategies to be modular with only local memory; that is, resolution of choices within a module does not depend on the context in which the module is invoked, but only on the history within the current invocation of the module. While reachability in (global…

Computer Science::Computer Science and Game TheoryTheoretical computer scienceGeneral Computer ScienceCombinatorial game theoryContext (language use)02 engineering and technology0102 computer and information sciences01 natural sciencesTheoretical Computer ScienceProgram analysisReachability0202 electrical engineering electronic engineering information engineering0101 mathematicsMathematicsbusiness.industry010102 general mathematics020207 software engineeringPushdown systemsResolution (logic)Modular designCall graphUndecidable problemModel-checkingGames in verification010201 computation theory & mathematicsbusinessComputer Science(all)
researchProduct

Rational irreducible characters and rational conjugacy classes in finite groups

2007

We prove that a finite group G G has two rational-valued irreducible characters if and only if it has two rational conjugacy classes, and determine the structure of any such group. Along the way we also prove a conjecture of Gow stating that any finite group of even order has a non-trivial rational-valued irreducible character of odd degree.

Computer Science::Machine LearningFinite groupApplied MathematicsGeneral MathematicsIrreducible elementComputer Science::Digital LibrariesIrreducible fractionCombinatoricsStatistics::Machine LearningConjugacy classCharacter (mathematics)Character tableComputer Science::Mathematical SoftwareOrder (group theory)Character groupMathematicsTransactions of the American Mathematical Society
researchProduct

Homology of pseudodifferential operators on manifolds with fibered cusps

2003

The Hochschild homology of the algebra of pseudodifferential operators on a manifold with fibered cusps, introduced by Mazzeo and Melrose, is studied and computed using the approach of Brylinski and Getzler. One of the main technical tools is a new convergence criterion for tri-filtered half-plane spectral sequences. Using trace-like functionals that generate the 0 0 -dimensional Hochschild cohomology groups, the index of a fully elliptic fibered cusp operator is expressed as the sum of a local contribution of Atiyah-Singer type and a global term on the boundary. We announce a result relating this boundary term to the adiabatic limit of the eta invariant in a particular case.

Computer Science::Machine LearningHochschild homologyApplied MathematicsGeneral MathematicsFibered knotHomology (mathematics)Computer Science::Digital LibrariesCohomologyManifoldAlgebraStatistics::Machine LearningElliptic operatorEta invariantMathematics::K-Theory and HomologySpectral sequenceComputer Science::Mathematical SoftwareMathematicsTransactions of the American Mathematical Society
researchProduct

Understanding star-fundamental algebras

2021

Star-fundamental algebras are special finite dimensional algebras with involution ∗ * over an algebraically closed field of characteristic zero defined in terms of multialternating ∗ * -polynomials. We prove that the upper-block matrix algebras with involution introduced in Di Vincenzo and La Scala [J. Algebra 317 (2007), pp. 642–657] are star-fundamental. Moreover, any finite dimensional algebra with involution contains a subalgebra mapping homomorphically onto one of such algebras. We also give a characterization of star-fundamental algebras through the representation theory of the symmetric group.

Computer Science::Machine LearningInvolutionPure mathematicsStar-fundamentalApplied MathematicsGeneral MathematicsStar (graph theory)Polynomial identityComputer Science::Digital LibrariesSettore MAT/02 - AlgebraStatistics::Machine LearningIDEAIS (ÁLGEBRA)Computer Science::Mathematical SoftwareComputer Science::Programming LanguagesInvolution (philosophy)Mathematics
researchProduct

Complex group algebras of finite groups: Brauer’s Problem 1

2005

Brauer’s Problem 1 asks the following: what are the possible complex group algebras of finite groups? It seems that with the present knowledge of representation theory it is not possible to settle this question. The goal of this paper is to announce a partial solution to this problem. We conjecture that if the complex group algebra of a finite group does not have more than a fixed number m m of isomorphic summands, then its dimension is bounded in terms of m m . We prove that this is true for every finite group if it is true for the symmetric groups.

Computer Science::Machine LearningModular representation theoryPure mathematicsFinite groupBrauer's theorem on induced charactersGroup (mathematics)General MathematicsMathematicsofComputing_GENERALComputer Science::Digital LibrariesRepresentation theoryCombinatoricsStatistics::Machine LearningGroup of Lie typeSymmetric groupComputer Science::Mathematical SoftwareComputer Science::Programming LanguagesBrauer groupMathematicsElectronic Research Announcements of the American Mathematical Society
researchProduct