Search results for "Mathematica"

showing 10 items of 7971 documents

Nature log-analytique du volume des sous-analytiques

2000

Using a preparation theorem for subanalytic functions and Lipschitz stratification for compact subanalytic sets we prove that volumes of slices of globally subanalytic sets and density have a log-analytic nature. We also prove that the set of parameters for which the volume of fiber is finite is globally subanalytic.

Set (abstract data type)Mathematics::LogicMathematics::Algebraic GeometryMathematics::Complex VariablesFiber (mathematics)General MathematicsMathematical analysisLipschitz continuityStratification (mathematics)MathematicsVolume (compression)Illinois Journal of Mathematics
researchProduct

About Combining Metric Learning and Prototype Generation

2014

Distance metric learning has been a major research topic in recent times. Usually, the problem is formulated as finding a Mahalanobis-like metric matrix that satisfies a set of constraints as much as possible. Different ways to introduce these constraints and to effectively formulate and solve the optimization problem have been proposed. In this work, we start with one of these formulations that leads to a convex optimization problem and generalize it in order to increase the efficiency by appropriately selecting the set of constraints. Moreover, the original criterion is expressed in terms of a reduced set of representatives that is learnt together with the metric. This leads to further im…

Set (abstract data type)Matrix (mathematics)Mathematical optimizationOptimization problemmedia_common.quotation_subjectMetric (mathematics)Convex optimizationQuality (business)Equivalence of metricsMathematicsMetric k-centermedia_common
researchProduct

Approximation of Feasible Parameter Set in worst case identification of block-oriented nonlinear models

2003

Abstract The estimation of the Feasible Parameter Set for block-oriented nonlinear models in a worst case setting is considered. A bounding procedure is determined both for polytopic and ellipsoidie sets, consisting in the projection of the FPS ⊂ R MN of the extended parameter vector onto suitable M or N-dimensional subspaces and in the solution of convex optimization problems which provide the extreme points of the Parameter Uncertainties Intervals of the model parameteres. Bounds obtained are tighter then in the previous approaches.

Set (abstract data type)Nonlinear systemMathematical optimizationBounding overwatchConvex optimizationApplied mathematicsExtreme pointLinear subspaceProjection (linear algebra)MathematicsBlock (data storage)
researchProduct

Testing Independence: A New Approach

2000

In time series analysis and modelling, testing for independence allows us to determine if the estimated model is correctly specified. In this work, we present a very simple method to test for serial independence, based on the two-dimensional embedding vectors (the so-called “2-histories”), and we analyse the power and size of such a procedure against a wide set of linear and nonlinear alternatives.

Set (abstract data type)Nonlinear systemSimple (abstract algebra)Independence (mathematical logic)EmbeddingMartingale difference sequenceWhite noiseTime seriesAlgorithmMathematics
researchProduct

Efficient evolutionary approach to approximate the Pareto-optimal set in multiobjective optimization, UPS-EMOA

2010

Solving real-life engineering problems requires often multiobjective, global, and efficient (in terms of objective function evaluations) treatment. In this study, we consider problems of this type by discussing some drawbacks of the current methods and then introduce a new population-based multiobjective optimization algorithm UPS-EMOA which produces a dense (not limited to the population size) approximation of the Pareto-optimal set in a computationally effective manner.

Set (abstract data type)Pareto optimalMathematical optimizationControl and OptimizationApplied MathematicsPopulation sizeNew populationMulti-objective optimizationSoftwareMathematicsMultiobjective optimization algorithmOptimization Methods and Software
researchProduct

Nonlocal Minimal Surfaces and Nonlocal Curvature

2019

Recall that if a set E has minimal local perimeter in a bounded set Ω, then it has zero mean curvature at each point of ∂E ∩ Ω (see [51]), and the equation that says that the curvature is equal to zero is the Euler–Lagrange equation associated to the minimization of the perimeter of a set.

Set (abstract data type)PerimeterMinimal surfaceBounded set (topological vector space)Mathematical analysisZero (complex analysis)Point (geometry)MinificationCurvatureMathematics
researchProduct

MATHEMATICS AS A QUASI-EMPIRICAL SCIENCE

2006

The present paper aims at showing that there are times when set theoretical knowledge increases in a non-cumulative way. In other words, what we call ‘set theory’ is not one theory which grows by simple addition of a theorem after the other, but a finite sequence of theories T1, ..., T n in which Ti+1, for 1 ≤ i < n, supersedes T i . This thesis has a great philosophical significance because it implies that there is a sense in which mathematical theories, like the theories belonging to the empirical sciences, are fallible and that, consequently, mathematical knowledge has a quasi-empirical nature. The way I have chosen to provide evidence in favour of the correctness of the main thesis of t…

Set (abstract data type)Philosophy of mathematicsPhilosophy of scienceMultidisciplinaryCorrectnessHistory and Philosophy of ScienceSimple (abstract algebra)Universal setSet theoryNaive set theoryquasi-empiricism and mathematics Lakatos mathematical research programmes Cantor-Zermelo set theory philosophy of mathematics mathematical knowledgeMathematicsEpistemology
researchProduct

Which measures are projections of purely unrectifiable one-dimensional Hausdorff measures

2008

We give a necessary and sufficient condition for a measure p, on the real line to be an orthogonal projection of XAl for some purely 1-unrectifiable planar set A.

Set (abstract data type)PlanarApplied MathematicsGeneral MathematicsOrthographic projectionMathematical analysisHausdorff spaceMathematics::Metric GeometryOuter measureHausdorff measureReal lineMeasure (mathematics)MathematicsProceedings of the American Mathematical Society
researchProduct

A nicely behaved singular integral on a purely unrectifiable set

2001

We construct an example of a purely 1-unrectifiable AD-regular set E in the plane such that the limit

Set (abstract data type)Plane (geometry)Applied MathematicsGeneral MathematicsMathematical analysisMathematics::Metric GeometryLimit (mathematics)Construct (python library)Singular integralMathematicsProceedings of the American Mathematical Society
researchProduct

Left-to-right tree pattern matching

1991

We propose a new technique to construct left-to-right matching automata for trees. Our method is based on the novel concept of prefix unifcation which is used to compute a certain closure of the pattern set. From the closure a kind of deterministic matching automaton can be derived immediately. We also point out how to perform the construction incrementally which makes our approach suitable for applications in which pattern sets change dynamically, such as in the Knuth-Bendix completion algorithm.

Set (abstract data type)PrefixFunctional programmingTheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGESMatching (graph theory)Computer scienceClosure (topology)Point (geometry)Construct (python library)AlgorithmAutomaton
researchProduct