Search results for "rete"

showing 10 items of 3470 documents

TIGHT BOUNDS FOR THE SPACE COMPLEXITY OF NONREGULAR LANGUAGE RECOGNITION BY REAL-TIME MACHINES

2013

We examine the minimum amount of memory for real-time, as opposed to one-way, computation accepting nonregular languages. We consider deterministic, nondeterministic and alternating machines working within strong, middle and weak space, and processing general or unary inputs. In most cases, we are able to show that the lower bounds for one-way machines remain tight in the real-time case. Memory lower bounds for nonregular acceptance on other devices are also addressed. It is shown that increasing the number of stacks of real-time pushdown automata can result in exponential improvement in the total amount of space usage for nonregular language recognition.

Discrete mathematicsNondeterministic algorithmTheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGESUnary operationComputationTheory of computationComputer Science (miscellaneous)Pushdown automatonSpace (mathematics)MathematicsLanguage recognitionExponential functionInternational Journal of Foundations of Computer Science
researchProduct

Finite Groups with Only One NonLinear Irreducible Representation

2012

Let 𝕂 be an algebraically closed field. We classify the finite groups having exactly one irreducible 𝕂-representation of degree bigger than one. The case where the characteristic of 𝕂 is zero, was done by G. Seitz in 1968.

Discrete mathematicsNonlinear systemAlgebra and Number TheoryDegree (graph theory)Irreducible representationZero (complex analysis)Algebraically closed fieldMathematicsCommunications in Algebra
researchProduct

The fixed point property for mappings admitting a center

2007

Abstract We introduce a class of nonlinear continuous mappings in Banach spaces which allow us to characterize the Banach spaces without noncompact flat parts in their spheres as those that have the fixed point property for this type of mapping. Later on, we give an application to the existence of zeroes for certain kinds of accretive operators.

Discrete mathematicsNonlinear systemClass (set theory)Applied MathematicsBanach spaceCenter (group theory)Fixed pointType (model theory)Fixed-point propertyAnalysisNonlinear operatorsMathematicsNonlinear Analysis: Theory, Methods & Applications
researchProduct

Weighted-Power p Nonlinear Subdivision Schemes

2012

In this paper we present and analyze a generalization of the Powerp subdivision schemes proposed in [3,12]. The Weighted-Powerp schemes are based on a harmonic weighted version of the Power<emp average considered in [12], and their development is motivated by the desire to generalize the nonlinear analysis in [3,5] to interpolatory subdivision schemes with higher than second order accuracy.

Discrete mathematicsNonlinear systemGeneralizationbusiness.industryConvergence (routing)MathematicsofComputing_NUMERICALANALYSISStability (learning theory)Order (group theory)Harmonic (mathematics)businessMathematicsPower (physics)Subdivision
researchProduct

A non-linear version of Hunt-Lion's theorem from the point of view of T-accretivity

1992

In the classical topological context, Dellacherie [10] has given a non-linear version of Hunt's theorem characterizing the proper kernels verifying the complete maximum principle as those closing a submarkovian resolvent. In this paper we study the relation between this non-linear version of Hunt's theorem and T-accretivity.

Discrete mathematicsNonlinear systemMaximum principleFunctional analysisCalculusQuantitative Biology::Populations and EvolutionContext (language use)Point (geometry)Astrophysics::Earth and Planetary AstrophysicsAnalysisPotential theoryResolventMathematicsPotential Analysis
researchProduct

Nonlinear systems solver in floating-point arithmetic using LP reduction

2009

This paper presents a new solver for systems of nonlinear equations. Such systems occur in Geometric Constraint Solving, e.g., when dimensioning parts in CAD-CAM, or when computing the topology of sets defined by nonlinear inequalities. The paper does not consider the problem of decomposing the system and assembling solutions of subsystems. It focuses on the numerical resolution of well-constrained systems. Instead of computing an exponential number of coefficients in the tensorial Bernstein basis, we resort to linear programming for computing range bounds of system equations or domain reductions of system variables. Linear programming is performed on a so called Bernstein polytope: though,…

Discrete mathematicsNonlinear systemPolynomialFloating pointSimplexLinear programmingApplied mathematicsSolverBernstein polynomialMathematicsInterval arithmetic2009 SIAM/ACM Joint Conference on Geometric and Physical Modeling
researchProduct

DIN-Norm für PASCAL

1983

Die DIN-Norm Pascal ist aus einer Ubersetzung der ISO 7185 Pascal-Norm entstanden, die zum 1. Dezember 1983 von ISO nach einer mehrjahrigen Entwurfsphase verabschiedet wurde.

Discrete mathematicsNorm (mathematics)Pascal (programming language)computerMathematicscomputer.programming_language
researchProduct

C-Supplemented subgroups of finite groups

2000

A subgroup H of a group G is said to be c-supplemented in G if there exists a subgroup K of G such that HKa G and H\ K is contained in CoreGOHU .W e follow Hall's ideas to characterize the structure of the finite groups in which every subgroup is c-supplemented. Properties of c-supplemented subgroups are also applied to determine the structure of some finite groups.

Discrete mathematicsNormal subgroupCombinatoricsComplement (group theory)Maximal subgroupSubgroupLocally finite groupGeneral MathematicsCharacteristic subgroupIndex of a subgroupFitting subgroupMathematicsGlasgow Mathematical Journal
researchProduct

Some Classes of Operators on Partial Inner Product Spaces

2012

Many families of function spaces, such as $L^{p}$ spaces, Besov spaces, amalgam spaces or modulation spaces, exhibit the common feature of being indexed by one parameter (or more) which measures the behavior (regularity, decay properties) of particular functions. All these families of spaces are, or contain, scales or lattices of Banach spaces and constitute special cases of the so-called \emph{partial inner product spaces (\pip s)} that play a central role in analysis, in mathematical physics and in signal processing (e.g. wavelet or Gabor analysis). The basic idea for this structure is that such families should be taken as a whole and operators, bases, frames on them should be defined glo…

Discrete mathematicsNuclear operatorTopological tensor productHilbert spaceoperatorsOperator theoryCompact operator on Hilbert spacesymbols.namesakeSettore MAT/05 - Analisi MatematicasymbolsInterpolation spacePip-spaceBirnbaum–Orlicz spaceLp spaceMathematics
researchProduct

Rademacher Theorem for Fréchet spaces

2010

Abstract Let X be a separable Frechet space. In this paper we define a class A of null sets in X that is properly contained in the class of Aronszajn null sets, and we prove that a Lipschitz map from an open subset of X into a Gelfand-Frechet space is Gateaux differentiable outside a set belonging to A. This is an extension to Frechet spaces of a result (see [PZ]) due to D. Preiss and L. Zajicek.

Discrete mathematicsNull (mathematics)Space (mathematics)Lipschitz continuitySeparable spaceCombinatoricsRademacher's theoremMathematics (miscellaneous)Fréchet spaceSettore MAT/05 - Analisi MatematicaDifferentiable functionMetric differentialMathematicsLipschitz maps Gateaux differentiability Rademacher theorem.
researchProduct