Related papers: Parametricity Features and their Requirements
Some metric and graphical regularity properties of generalized constraint systems are investigated. Then, these properties are applied in order to penalize (in the sense of Clarke) various scalar and vector optimization problems. This…
When we speak about parametric programming, sensitivity analysis, or related topics, we usually mean the problem of studying specified perturbations of the data such that for a given optimization problem some optimality criterion remains…
In this paper, we consider the problem of local parameter identifiability of a parameter function in a system of ordinary differential equations. Previously, in this problem, the case where the dimensions of a parameter and a solution of a…
Building software-driven systems that are easily understood becomes a challenge, with their ever-increasing complexity and autonomy. Accordingly, recent research efforts strive to aid in designing explainable systems. Nevertheless, a common…
We define the notion of localizable property for a dynamical system. Then we survey three properties of complexity and relate how they are known to be typical among differentiable dynamical systems. These notions are the fast growth of the…
In the recent years, machine learning has made great advancements that have been at the root of many breakthroughs in different application domains. However, it is still an open issue how make them applicable to high-stakes or…
This chapter reviews the purpose and use of models from the field of complex systems and, in particular, the implications of trying to use models to understand or make decisions within complex situations, such as policy makers usually face.…
Complexity measures are essential to understand complex systems and there are numerous definitions to analyze one-dimensional data. However, extensions of these approaches to two or higher-dimensional data, such as images, are much less…
We propose a complexity measure which addresses the functional flexibility of networks. It is conjectured that the functional flexibility is reflected in the topological diversity of the assigned graphs, resulting from a resolution of their…
The purpose of this paper is to define some notions of movability for morphisms of inverse systems which extend the movability properties of inverse systems and which are compatible with the equivalence relations which define pro-morphisms…
Methods of determination of constants of the Standard Model are considered. The constants values obtained now are presented and experiments for improving some values are pointed out. A few possible generalized models are considered together…
Disorder in point patterns can be quantified by means of the complexity, rather than in terms of geometric attributes of pattern structure. A complexity-based disorder-quantifying statistic indicates the practical difficulties associated…
There are two basic ways of weakening the definition of the well-known metric regularity property by fixing one of the points involved in the definition. The first resulting property is called metric subregularity and has attracted a lot of…
We review possible measures of complexity which might in particular be applicable to situations where the complexity seems to arise spontaneously. We point out that not all of them correspond to the intuitive (or "naive") notion, and that…
Variability constraints are an integral part of the requirements for a configurable system. The constraints specified in the requirements on the legal combinations of options define the space of potential valid configurations for the…
We discuss various compatibility criteria for overdetermined systems of PDEs generalizing the approach to formal integrability via brackets of differential operators. Then we give sufficient conditions that guarantee that a PDE possessing a…
New measures for the quantization of systems with constraints are discussed and applied to several examples, in particular, examples of alternative but equivalent formulations of given first-class constraints, as well as a comparison of…
We discuss methods to construct a polynomial parametrization of some interesting knotted surfaces (knotted spheres, knotted tori and knotted planes) and provide examples.
There are many different notions of optimality even in testing a single hypothesis. In the multiple testing area, the number of possibilities is very much greater. The paper first will describe multiplicity issues that arise in tests…
The purpose of this paper is to address some of the challenges of formally specifying components of shared-memory concurrent programs. The focus is to provide an abstract specification of a component that is suitable for use both by clients…