Search results for "Computer programming"

showing 10 items of 741 documents

Stability Analysis of Large Scale Networks of Autonomous Work Systems with Delays

2011

This paper considers the problem of stability analysis for a class of production networks of autonomous work systems with delays in the capacity changes. The system under consideration does not share information between work systems and the work systems adjust capacity with the objective of maintaining a desired amount of local work in progress (WIP). Attention is focused to derive explicit sufficient delay-dependent stability conditions for the network using properties of matrix norm. Finally, numerical results are provided to demonstrate the proposed approach.

Mathematical optimizationStability conditionsClass (computer programming)Computer scienceScale (chemistry)Matrix normStability (learning theory)Production (economics)Work in processWork systems
researchProduct

The Power of the “Pursuit” Learning Paradigm in the Partitioning of Data

2019

Traditional Learning Automata (LA) work with the understanding that the actions are chosen purely based on the “state” in which the machine is. This modus operandus completely ignores any estimation of the Random Environment’s (RE’s) (specified as \(\mathbb {E}\)) reward/penalty probabilities. To take these into consideration, Estimator/Pursuit LA utilize “cheap” estimates of the Environment’s reward probabilities to make them converge by an order of magnitude faster. This concept is quite simply the following: Inexpensive estimates of the reward probabilities can be used to rank the actions. Thereafter, when the action probability vector has to be updated, it is done not on the basis of th…

Mathematical optimizationTheoretical computer scienceLearning automataBasis (linear algebra)Computer scienceRank (computer programming)Object PartitioningPartitioning-based learningEstimatorLearning Automata02 engineering and technologyProbability vectorField (computer science)AutomatonRanking0202 electrical engineering electronic engineering information engineering020201 artificial intelligence & image processing[INFO]Computer Science [cs]Object Migration Automaton
researchProduct

An index formula on manifolds with fibered cusp ends

2002

We consider a compact manifold whose boundary is a locally trivial fiber bundle and an associated pseudodifferential algebra that models fibered cusps at infinity. Using trace-like functionals that generate the 0-dimensional Hochschild cohomology groups, we express the index of a fully elliptic fibered cusp operator as the sum of a local contribution from the interior and a term that comes from the boundary. This answers the index problem formulated by Mazzeo and Melrose. We give a more precise answer in the case where the base of the boundary fiber bundle is the circle. In particular, for Dirac operators associated to a "product fibered cusp metric", the index is given by the integral of t…

Mathematics - Differential GeometryCusp (singularity)Pure mathematics58J40 58J20 58J28Boundary (topology)Fibered knotCohomologyManifoldEta invariantOperator (computer programming)Differential Geometry (math.DG)Mathematics::K-Theory and HomologyFOS: MathematicsFiber bundleGeometry and TopologyMathematics
researchProduct

The Bishop–Phelps–Bollobás point property

2016

Abstract In this article, we study a version of the Bishop–Phelps–Bollobas property. We investigate a pair of Banach spaces ( X , Y ) such that every operator from X into Y is approximated by operators which attain their norm at the same point where the original operator almost attains its norm. In this case, we say that such a pair has the Bishop–Phelps–Bollobas point property (BPBpp). We characterize uniform smoothness in terms of BPBpp and we give some examples of pairs ( X , Y ) which have and fail this property. Some stability results are obtained about l 1 and l ∞ sums of Banach spaces and we also study this property for bilinear mappings.

Mathematics::Functional AnalysisApplied Mathematics010102 general mathematicsBanach spaceBilinear interpolationStability resultBilinear form01 natural sciences010101 applied mathematicsCombinatoricsOperator (computer programming)Norm (mathematics)0101 mathematicsBishop–Phelps theoremAnalysisMathematicsJournal of Mathematical Analysis and Applications
researchProduct

Algebras of frequently hypercyclic vectors

2019

We show that the multiples of the backward shift operator on the spaces $\ell_{p}$, $1\leq p<\infty$, or $c_{0}$, when endowed with coordinatewise multiplication, do not possess frequently hypercyclic algebras. More generally, we characterize the existence of algebras of $\mathcal{A}$-hypercyclic vectors for these operators. We also show that the differentiation operator on the space of entire functions, when endowed with the Hadamard product, does not possess frequently hypercyclic algebras. On the other hand, we show that for any frequently hypercyclic operator $T$ on any Banach space, $FHC(T)$ is algebrable for a suitable product, and in some cases it is even strongly algebrable.

Mathematics::Functional AnalysisPure mathematicsGeneral MathematicsEntire function010102 general mathematicsBanach spaceDynamical Systems (math.DS)Shift operatorSpace (mathematics)01 natural sciences010101 applied mathematicsStatistics::Machine LearningOperator (computer programming)Product (mathematics)Banach algebraFOS: MathematicsHadamard productMathematics - Dynamical Systems0101 mathematics47A16MathematicsMathematische Nachrichten
researchProduct

Isometric factorization of vector measures and applications to spaces of integrable functions

2022

Let $X$ be a Banach space, $\Sigma$ be a $\sigma$-algebra, and $m:\Sigma\to X$ be a (countably additive) vector measure. It is a well known consequence of the Davis-Figiel-Johnson-Pelczýnski factorization procedure that there exist a reflexive Banach space $Y$, a vector measure $\tilde{m}:\Sigma \to Y$ and an injective operator $J:Y \to X$ such that $m$ factors as $m=J\circ \tilde{m}$. We elaborate some theory of factoring vector measures and their integration operators with the help of the isometric version of the Davis-Figiel-Johnson-Pelczýnski factorization procedure. Along this way, we sharpen a result of Okada and Ricker that if the integration operator on $L_1(m)$ is weakly compact, t…

Mathematics::Functional AnalysisPure mathematicsIntegrable systemApplied MathematicsBanach spaceSigmaVDP::Matematikk og Naturvitenskap: 400::Matematikk: 410Injective functionOperator (computer programming)Vector measureFactorizationEquivalence (measure theory)AnalysisMathematics
researchProduct

Existence results for parametric boundary value problems involving the mean curvature operator

2014

In this note we propose a variational approach to a parametric differential problem where a prescribed mean curvature equation is considered. In particular, without asymptotic assumptions at zero and at infinity on the potential, we obtain an explicit positive interval of parameters for which the problem under examination has at least one nontrivial and nonnegative solution.

Mean curvatureApplied Mathematicsmedia_common.quotation_subjectMathematical analysisZero (complex analysis)34B1535B38Interval (mathematics)34B18InfinityOperator (computer programming)Boundary value problemDifferential (infinitesimal)AnalysisMathematicsmedia_commonParametric statistics
researchProduct

Uncertainty evaluation in the differential measurements of power losses in a power drive system

2021

Abstract In order to guarantee a correct classification in the standardized energy efficiency classes, the current standards concerning the power drive systems prescribe that their power losses must be evaluated with great accuracy. This circumstance involves the usage of expensive measurement systems, since accurate instrumentation, skilled personnel and controlled environments are required. During the design stage of a power drive system, however, the measurement of the absolute value of its power losses is not always needed. Often, in fact, it is enough to assess the power losses variations caused by a modification of either hardware or software sections of the power drive system. In the…

Measure (data warehouse)Computer sciencebusiness.industryApplied MathematicsSystem of measurementAbsolute valueDifferential (mechanical device)Settore ING-IND/32 - Convertitori Macchine E Azionamenti ElettriciCondensed Matter PhysicsReliability engineeringPower (physics)SoftwarePower drive systems Power losses measurements Uncertainty analysisInstrumentation (computer programming)Electrical and Electronic EngineeringbusinessSettore ING-INF/07 - Misure Elettriche E ElettronicheInstrumentationEfficient energy useMeasurement
researchProduct

Classifying efficient alternatives in SMAA using cross confidence factors

2006

Abstract Stochastic multicriteria acceptability analysis (SMAA) is a family of methods for aiding multicriteria group decision making. These methods are based on exploring the weight space in order to describe the preferences that make each alternative the most preferred one. The main results of the analysis are rank acceptability indices, central weight vectors and confidence factors for different alternatives. The rank acceptability indices describe the variety of different preferences resulting in a certain rank for an alternative; the central weight vectors represent the typical preferences favouring each alternative; and the confidence factors measure whether the criteria data are suff…

Measure (data warehouse)Decision support systemInformation Systems and ManagementGeneral Computer ScienceOperations researchStochastic modellingbusiness.industryLow ConfidenceRank (computer programming)Management Science and Operations ResearchMachine learningcomputer.software_genreIndustrial and Manufacturing EngineeringVariety (cybernetics)Group decision-makingModeling and SimulationData envelopment analysisArtificial intelligencebusinesscomputerMathematicsEuropean Journal of Operational Research
researchProduct

Stochastic Multicriteria Acceptability Analysis (SMAA)

2010

Stochastic multicriteria acceptability analysis (SMAA) is a family of methods for aiding multicriteria group decision making in problems with uncertain, imprecise or partially missing information. These methods are based on exploring the weight space in order to describe the preferences that make each alternative the most preferred one, or that would give a certain rank for a specific alternative. The main results of the analysis are rank acceptability indices, central weight vectors and confidence factors for different alternatives. The rank acceptability indices describe the variety of different preferences resulting in a certain rank for an alternative, the central weight vectors represe…

Measure (data warehouse)Decision support systemOperations researchComputer scienceRank (computer programming)Decision problemMultiple-criteria decision analysisPreference (economics)Variety (cybernetics)Group decision-making
researchProduct