Search results for "predicate logic"

showing 10 items of 170 documents

Improvement of Inventory Control under Parametric Uncertainty and Constraints

2011

The aim of the present paper is to show how the statistical inference equivalence principle (SIEP), the idea of which belongs to the authors, may be employed in the particular case of finding the effective statistical decisions for the multi-product inventory problems with constraints. To our knowledge, no analytical or efficient numerical method for finding the optimal policies under parametric uncertainty for the multi-product inventory problems with constraints has been reported in the literature. Using the (equivalent) predictive distributions, this paper represents an extension of analytical results obtained for unconstrained optimization under parametric uncertainty to the case of con…

Inventory controlMathematical optimizationNumerical analysisStatistical inferenceConstrained optimizationEquivalence principle (geometric)Extension (predicate logic)Pivotal quantityMathematicsParametric statistics
researchProduct

New methods for analysing colour texture based on the Karhunen–Loeve transform and quantification

2004

In this article, we offer an original study on the analysis of the texture of colour images based on Local Linear Transforms (LLT). Our colour approach is based on the separability of the data which reduces the number of texture parameters. We also propose the extension of Run Lengths (RL) and Co-occurrence Matrixes (CM) to colour images. In this respect, two different ways were explored (data merging and quantification). We finally present a comparative study showing the efficiency of the first method (LLT) as well as the complementary nature of the other methods (RL, CM).

Karhunen–Loève theoremLocal linearbusiness.industryExtension (predicate logic)Texture (geology)Co-occurrence matrixArtificial IntelligenceSignal ProcessingComputer visionComputer Vision and Pattern RecognitionArtificial intelligencebusinessSoftwareMathematicsPattern Recognition
researchProduct

Extending the sGLOH descriptor

2015

This paper proposes an extension of the sGLOH keypoint descriptor [3] which improves its robustness and discriminability. The sGLOH descriptor can handle discrete rotations by a cyclic shift of its elements thanks to its circular structure, but its performance can decrease when the keypoint relative rotation is in between two sGLOH discrete rotations. The proposed extension couples together two sGLOH descriptors for the same patch with different rotations in order to cope with this issue and it can be also applied straightly to the sCOr and sGOr matching strategies of sGLOH. Experimental results show a consistent improvement of the descriptor discriminability, while different setups can be …

Keypoint descriptorMatching (graph theory)Settore INF/01 - InformaticaComputer scienceGLOHStructure (category theory)Scale-invariant feature transformSGLOHExtension (predicate logic)Keypoint descriptor image matching rotation invarianceRunning timeTask (project management)Robustness (computer science)SIFTMatchingAlgorithm
researchProduct

A Random Extension for Discriminative Dimensionality Reduction and Metric Learning

2009

A recently proposed metric learning algorithm which enforces the optimal discrimination of the different classes is extended and empirically assessed using different kinds of publicly available data. The optimization problem is posed in terms of landmark points and then, a stochastic approach is followed in order to bypass some of the problems of the original algorithm. According to the results, both computational burden and generalization ability are improved while absolute performance results remain almost unchanged.

LandmarkOptimization problemDiscriminative modelbusiness.industryGeneralizationPopulation-based incremental learningDimensionality reductionMetric (mathematics)Pattern recognitionExtension (predicate logic)Artificial intelligencebusinessMathematics
researchProduct

SORTING CONJUGATES AND SUFFIXES OF WORDS IN A MULTISET

2014

In this paper we are interested in the study of the combinatorial aspects related to the extension of the Burrows-Wheeler transform to a multiset of words. Such study involves the notion of suffixes and conjugates of words and is based on two different order relations, denoted by <lex and ≺ω, that, even if strictly connected, are quite different from the computational point of view. In particular, we introduce a method that only uses the <lex sorting among suffixes of a multiset of words in order to sort their conjugates according to ≺ω-order. In this study an important role is played by Lyndon words. This strategy could be used in applications specially in the field of Bioinformatic…

Lyndon words; Burrows-Wheeler transform; Extended Burrows-Wheeler transform; Circular words; Conjugates; Suffixes; SortingSuffixesMultisetTheoretical computer sciencePoint (typography)Burrows–Wheeler transformSettore INF/01 - InformaticaSortingcircular wordExtension (predicate logic)Lyndon wordsBurrows-Wheeler transformLyndon wordField (computer science)ConjugatesconjugateComputer Science (miscellaneous)sortOrder (group theory)suffixeArithmeticextended Burrows-Wheeler transformCircular wordssortingMathematics
researchProduct

On Equivalent Random Traffic method extension

2011

The key result of the paper is the Equivalent Random Traffic (ERT) method extension for estimation of the throughput for schemes with traffic splitting. The excellent accuracy (relative error is less than 1%) is shown in numerical example. A numerical algorithm is given — how to estimate the throughput for schemes at traffic splitting and merging. The paper also contains new Erlang-B formula algorithm for non-integer number of channels based on parabolic approximation.

Mathematical optimizationApproximation errorTelecommunication channelsNumerical analysisComputer Science::Networking and Internet ArchitectureKey (cryptography)Integrated opticsExtension (predicate logic)Throughput (business)Erlang (unit)AlgorithmMathematics2011 Baltic Congress on Future Internet and Communications
researchProduct

Notice of Violation of IEEE Publication Principles: Robust Observer Design for Unknown Inputs Takagi–Sugeno Models

2013

This paper deals with the observer design for Takagi-Sugeno (T-S) fuzzy models subject to unknown inputs and disturbance affecting both states and outputs of the system. Sufficient conditions to design an unknown input T-S observer are given in linear matrix inequality (LMI) terms. Both continuous-time and discrete-time cases are studied. Relaxations are introduced by using intermediate variables. Extension to the case of unmeasured decision variables is also given. A numerical example is given to illustrate the effectiveness of the given results.

Mathematical optimizationObserver (quantum physics)Applied MathematicsDecision theoryLinear matrix inequalityFuzzy control systemExtension (predicate logic)Fuzzy logicDecision variablesComputational Theory and MathematicsTakagi sugenoComputer Science::Systems and ControlArtificial IntelligenceControl and Systems EngineeringControl theoryMathematicsIEEE Transactions on Fuzzy Systems
researchProduct

Best Proximity Points for Some Classes of Proximal Contractions

2013

Given a self-mapping g: A → A and a non-self-mapping T: A → B, the aim of this work is to provide sufficient conditions for the existence of a unique point x ∈ A, called g-best proximity point, which satisfies d g x, T x = d A, B. In so doing, we provide a useful answer for the resolution of the nonlinear programming problem of globally minimizing the real valued function x → d g x, T x, thereby getting an optimal approximate solution to the equation T x = g x. An iterative algorithm is also presented to compute a solution of such problems. Our results generalize a result due to Rhoades (2001) and hence such results provide an extension of Banach's contraction principle to the case of non-s…

Mathematical optimizationmetric spacesArticle SubjectIterative methodApplied Mathematicslcsh:MathematicsWork (physics)proximal contractionbest proximity pointExtension (predicate logic)Resolution (logic)lcsh:QA1-939Nonlinear programmingReal-valued functionPoint (geometry)Settore MAT/03 - GeometriaContraction principleAnalysisMathematicsAbstract and Applied Analysis
researchProduct

Quasisymmetric extension on the real line

2018

We give a geometric characterization of the sets $E\subset \mathbb{R}$ that satisfy the following property: every quasisymmetric embedding $f: E \to \mathbb{R}^n$ extends to a quasisymmetric embedding $f:\mathbb{R}\to\mathbb{R}^N$ for some $N\geq n$.

Mathematics::Combinatoricsrelatively connected setsApplied MathematicsGeneral Mathematics010102 general mathematicsta111Extension (predicate logic)Characterization (mathematics)01 natural sciencesCombinatoricsfunktioteoria0103 physical sciencesMathematics::Metric GeometryEmbedding010307 mathematical physics0101 mathematicsReal linequasisymmetric extensionMathematicsProceedings of the American Mathematical Society
researchProduct

Controlled diffeomorphic extension of homeomorphisms

2018

Let $\Omega$ be an internal chord-arc Jordan domain and $\varphi:\mathbb S\rightarrow\partial\Omega$ be a homeomorphism. We show that $\varphi$ has finite dyadic energy if and only if $\varphi$ has a diffeomorphic extension $h: \mathbb D\rightarrow \Omega$ which has finite energy.

Mathematics::Functional AnalysisPure mathematicsMathematics::Dynamical SystemsMathematics - Complex VariablesdiffeomorphismApplied Mathematicsta111010102 general mathematicsHigh Energy Physics::PhenomenologyPoisson extensionExtension (predicate logic)01 natural sciencesHomeomorphismfunktioteoria010101 applied mathematicsDomain (ring theory)chord-arc curveFOS: MathematicsDiffeomorphismtopologia0101 mathematicsComplex Variables (math.CV)AnalysisEnergy (signal processing)Mathematics
researchProduct