Search results for " Regular"

showing 10 items of 197 documents

Can Interpretable Reinforcement Learning Manage Prosperity Your Way?

2022

Personalisation of products and services is fast becoming the driver of success in banking and commerce. Machine learning holds the promise of gaining a deeper understanding of and tailoring to customers’ needs and preferences. Whereas traditional solutions to financial decision problems frequently rely on model assumptions, reinforcement learning is able to exploit large amounts of data to improve customer modelling and decision-making in complex financial environments with fewer assumptions. Model explainability and interpretability present challenges from a regulatory perspective which demands transparency for acceptance; they also offer the opportunity for improved insight into and unde…

FOS: Computer and information sciencesComputer Science - Machine LearningArtificial Intelligence (cs.AI)Computer Science - Artificial IntelligenceGeneral Earth and Planetary SciencesAI in banking; personalized services; prosperity management; explainable AI; reinforcement learning; policy regularisationVDP::Teknologi: 500::Informasjons- og kommunikasjonsteknologi: 550General Environmental ScienceMachine Learning (cs.LG)AI; Volume 3; Issue 2; Pages: 526-537
researchProduct

Anti-powers in infinite words

2018

In combinatorics of words, a concatenation of $k$ consecutive equal blocks is called a power of order $k$. In this paper we take a different point of view and define an anti-power of order $k$ as a concatenation of $k$ consecutive pairwise distinct blocks of the same length. As a main result, we show that every infinite word contains powers of any order or anti-powers of any order. That is, the existence of powers or anti-powers is an unavoidable regularity. Indeed, we prove a stronger result, which relates the density of anti-powers to the existence of a factor that occurs with arbitrary exponent. As a consequence, we show that in every aperiodic uniformly recurrent word, anti-powers of ev…

FOS: Computer and information sciencesDiscrete Mathematics (cs.DM)Formal Languages and Automata Theory (cs.FL)ConcatenationComputer Science - Formal Languages and Automata Theory68R150102 computer and information sciences01 natural sciencesTheoretical Computer ScienceCombinatoricsUnavoidable regularityPosition (vector)Infinite wordAvoidability[MATH.MATH-CO]Mathematics [math]/Combinatorics [math.CO]FOS: MathematicsMathematics - CombinatoricsDiscrete Mathematics and CombinatoricsOrder (group theory)Point (geometry)0101 mathematicsDiscrete Mathematics and CombinatoricMathematicsDiscrete mathematics000 Computer science knowledge general worksAnti-power010101 applied mathematicsComputational Theory and Mathematics010201 computation theory & mathematicsAperiodic graphComputer ScienceExponentPairwise comparisonCombinatorics (math.CO)SoftwareWord (group theory)Computer Science - Discrete Mathematics
researchProduct

Splicing Systems from Past to Future: Old and New Challenges

2014

A splicing system is a formal model of a recombinant behaviour of sets of double stranded DNA molecules when acted on by restriction enzymes and ligase. In this survey we will concentrate on a specific behaviour of a type of splicing systems, introduced by P\u{a}un and subsequently developed by many researchers in both linear and circular case of splicing definition. In particular, we will present recent results on this topic and how they stimulate new challenging investigations.

FOS: Computer and information sciencesDiscrete Mathematics (cs.DM)[INFO.INFO-FL]Computer Science [cs]/Formal Languages and Automata Theory [cs.FL]Formal Languages and Automata Theory (cs.FL)Splicing Systems Formal Languages.ACM: F.: Theory of Computation/F.4: MATHEMATICAL LOGIC AND FORMAL LANGUAGES/F.4.3: Formal LanguagesACM: F.: Theory of Computation/F.4: MATHEMATICAL LOGIC AND FORMAL LANGUAGES/F.4.2: Grammars and Other Rewriting SystemsComputer Science - Formal Languages and Automata TheorySplicing Systems Formal languages Regular languages DNA computingComputingMilieux_MISCELLANEOUS[INFO.INFO-FL] Computer Science [cs]/Formal Languages and Automata Theory [cs.FL]Computer Science - Discrete Mathematics
researchProduct

Modeling the Dynamics of a Financial Index after a Crash

2004

Supply and demand are perhaps the most fundamental concepts in economics. In a financial market they reflects the orders of the agents to buy or sell a given asset. In turn the fluctuations of supply and demand influence the dynamics of the price of an asset, as, for example, a stock or a financial index. Therefore the dynamics of the price of an asset is affected by the actions and of the beliefs of the agents. It is known that the dynamics of the price of an asset is far from simple, Several stylized facts has been empirically discovered such as, for example, the fat tails in the return distribution and the clustered volatility. These stylized facts has been detected by considering long t…

FinanceStatistical regularityStylized factFinancial economicsbusiness.industryFinancial marketEconomicsImplied volatilityVolatility (finance)businessStock (geology)Statistical hypothesis testingSupply and demand
researchProduct

Cancellation, pumping and permutation in formal languages

1984

Formal grammarTheoretical computer scienceChomsky hierarchyFormal languageContext-free languageAbstract family of languagesPumping lemma for context-free languagesArithmeticCone (formal languages)Pumping lemma for regular languagesMathematics
researchProduct

The Existence of Solutions for Local Dirichlet (r(u),s(u))-Problems

2022

In this paper, we consider local Dirichlet problems driven by the (r(u),s(u))-Laplacian operator in the principal part. We prove the existence of nontrivial weak solutions in the case where the variable exponents r,s are real continuous functions and we have dependence on the solution u. The main contributions of this article are obtained in respect of: (i) Carathéodory nonlinearity satisfying standard regularity and polynomial growth assumptions, where in this case, we use geometrical and compactness conditions to establish the existence of the solution to a regularized problem via variational methods and the critical point theory; and (ii) Sobolev nonlinearity, somehow related to the spac…

General Mathematicsregularized problem(<i>r</i>(<i>u</i>)<i>s</i>(u))-Laplacian operatorPalais-Smale conditionweak solutionComputer Science::Digital Libraries(<i>r</i>(<i>u</i>)<i>s</i>(u))-Laplacian operator; Palais-Smale condition; monotone operator; regularized problem; weak solutionSettore MAT/05 - Analisi Matematicamonotone operatorComputer Science (miscellaneous)QA1-939Computer Science::Programming Languages(r(u) s(u))-Laplacian operatorEngineering (miscellaneous)MathematicsMathematics
researchProduct

Growing stock volume from multi-temporal landsat imagery through google earth engine

2019

Growing stock volume (GSV) is one of the most important variables for.forest management and is traditionally- estimated from ground measurements. These measurements are expensive and therefore sparse and hard to maintain in time on a regular basis. Remote sensing data combined with national forest inventories constitute a helpful tool to estimate and map forest attributes. However, most studies on GSV estimation from remote sensing data focus on small forest areas with a single or only a few species. The current study aims to map GSV in peninsular Spain, a rather large and very heterogeneous area. Around 50 000 wooded land plots from the Third Spanish National Forest Inventory (NFI3) were u…

Global and Planetary ChangeMean squared errorGrowing stock volumeForest managementManagement Monitoring Policy and LawReflectivityRandom forestSpainMulticollinearityEnvironmental scienceShort wave infraredComputers in Earth SciencesGuided regularized random forestsGoogle Earth EngineLandsatImage resolutionStock (geology)Earth-Surface ProcessesRemote sensingInternational Journal of Applied Earth Observation and Geoinformation
researchProduct

Conformality and $Q$-harmonicity in sub-Riemannian manifolds

2016

We prove the equivalence of several natural notions of conformal maps between sub-Riemannian manifolds. Our main contribution is in the setting of those manifolds that support a suitable regularity theory for subelliptic $p$-Laplacian operators. For such manifolds we prove a Liouville-type theorem, i.e., 1-quasiconformal maps are smooth. In particular, we prove that contact manifolds support the suitable regularity. The main new technical tools are a sub-Riemannian version of p-harmonic coordinates and a technique of propagation of regularity from horizontal layers.

Harmonic coordinatesMathematics - Differential GeometryPure mathematicsWork (thermodynamics)morphism propertyGeneral Mathematicsconformal transformationBoundary (topology)Conformal map01 natural sciencesdifferentiaaligeometriaMathematics - Analysis of PDEsMathematics - Metric GeometryLiouville TheoremRegularity for p-harmonic functionSubelliptic PDE0103 physical sciencesFOS: MathematicsMathematics (all)0101 mathematicspopp measureMathematicsosittaisdifferentiaaliyhtälötsubelliptic PDESmoothnessQuasi-conformal mapApplied MathematicsHarmonic coordinates; Liouville Theorem; Quasi-conformal maps; Regularity for p-harmonic functions; Sub-Riemannian geometry; Subelliptic PDE; Mathematics (all); Applied Mathematicsta111Harmonic coordinate010102 general mathematics53C17 35H20 58C25Metric Geometry (math.MG)16. Peace & justiceregularity for p-harmonic functionsSub-Riemannian geometrysub-Riemannian geometryDifferential Geometry (math.DG)quasi-conformal mapsRegularity for p-harmonic functionsharmonic coordinates010307 mathematical physicsMathematics::Differential GeometrymonistotLiouville theoremAnalysis of PDEs (math.AP)
researchProduct

To d , or not to d : recent developments and comparisons of regularization schemes

2017

We give an introduction to several regularization schemes that deal with ultraviolet and infrared singularities appearing in higher-order computations in quantum field theories. Comparing the computation of simple quantities in the various schemes, we point out similarities and differences between them.

High Energy Physics - PhenomenologyHigh Energy Physics - Phenomenology (hep-ph)Physics and Astronomy (miscellaneous)FOS: Physical sciencesRenormalization regularization scattering amplitudesEngineering (miscellaneous); Physics and Astronomy (miscellaneous)Perturbative quantum filed theory high energy physicsEngineering (miscellaneous)
researchProduct

Double collinear splitting amplitudes at next-to-leading order

2013

We compute the next-to-leading order (NLO) QCD corrections to the $1 \to 2$ splitting amplitudes in different dimensional regularization (DREG) schemes. Besides recovering previously known results, we explore new DREG schemes and analyze their consistency by comparing the divergent structure with the expected behavior predicted by Catani's formula. Through the introduction of scalar-gluons, we show the relation among splittings matrices computed using different schemes. Also, we extended this analysis to cover the double collinear limit of scattering amplitudes in the context of QCD+QED.

High Energy Physics - TheoryNLO COMPUTATIONSNuclear and High Energy PhysicsParticle physicsHADRONIC COLLIDERSCiencias FísicasFOS: Physical sciencesContext (language use)01 natural sciences//purl.org/becyt/ford/1 [https]Dimensional regularizationHigh Energy Physics - Phenomenology (hep-ph)Consistency (statistics)0103 physical sciencesLimit (mathematics)010306 general physicsMathematical physicsQuantum chromodynamicsPhysics010308 nuclear & particles physicsHigh Energy Physics::PhenomenologyFísica//purl.org/becyt/ford/1.3 [https]Scattering amplitudeAstronomíaHigh Energy Physics - PhenomenologyAmplitudeHigh Energy Physics - Theory (hep-th)Cover (topology)CIENCIAS NATURALES Y EXACTASJournal of High Energy Physics
researchProduct