Application of the D-Fullness Technique for Breakdown Point Study of the Trimmed Likelihood Estimator to a Generalized Logistic Model

2000 Mathematics Subject Classification: 62J12, 62F35

Exponential approximation in the norms and semi-norms

The deviations of some entire functions of exponential type from real-valued functions and their derivatives are estimated. As approximation metrics we use the Lp-norms and power variations on R. Theorems presented here correspond to the Ganelius and Popov results concerning the one-sided trigonometric approximation of periodic functions (see [4, 5 and 8]). Some related facts were announced in [2, 3, 6 and 7].

An Iterative Procedure for Solving Nonsmooth Generalized Equation

2000 Mathematics Subject Classification: 47H04, 65K10.

Steffensen Methods for Solving Generalized Equations

2000 Mathematics Subject Classification: 65G99, 65K10, 47H04.

Density of Polynomials in the L^2 Space on the Real and the Imaginary Axes and in a Sobolev Space

2000 Mathematics Subject Classification: 41A10, 30E10, 41A65.

Selections, Paracompactness and Compactness

2000 Mathematics Subject Classification: 54C60, 54C65, 54D20, 54D30.

The Lindelöf number greater than continuum is u-invariant

2000 Mathematics Subject Classification: 54C35, 54D20, 54C60.

Viability Theory and Economic Modeling

A brief introduction into the theory of differential inclusions, viability theory and selections of set valued mappings is presented. As an application the implicit scheme of the Leontief dynamic input-output model is considered.

Yang–Mills solutions and dyons on cylinders over coset spaces with Sasakian structure

We present solutions of the Yang–Mills equation on cylinders R×G/HR×G/H over coset spaces of odd dimension 2m+12m+1 with Sasakian structure. The gauge potential is assumed to be SU(m)SU(m)-equivariant, parameterized by two real, scalar-valued functions. Yang–Mills theory with torsion in this setup reduces to the Newtonian mechanics of a point particle moving in R2R2 under the influence of an inverted potential. We analyze the critical points of this potential and present an analytic as well as several numerical finite-action solutions. Apart from the Yang–Mills solutions that constitute SU(m)SU(m)-equivariant instanton configurations, we construct periodic sphaleron solutions on S1×G/HS1×G/H and dyon solutions on iR×G/HiR×G/H.

Corrigendum to “The envelope theorem for multiobjective convex programming via contingent derivatives” [J. Math. Anal. Appl. 372 (1) (2010) 197–207]

The aim of this note is to formulate an envelope theorem for vector convex programs. This version corrects an earlier work, “The envelope theorem for multiobjective convex programming via contingent derivatives” by Jiménez Guerra et al. (2010) [3]. We first propose a necessary and sufficient condition allowing to restate the main result proved in the alluded paper. Second, we introduce a new Lagrange multiplier in order to obtain an envelope theorem avoiding the aforementioned error.

Sensitivity Analysis in Convex Optimization through the Circatangent Derivative

The main goal of this paper is to analyse the sensitivity of a vector convex optimization problem according to variations in the right-hand side. We measure the quantitative behavior of a certain set of Pareto optimal points characterized to become minimum when the objective function is composed with a positive function. Its behavior is analysed quantitatively using the circatangent derivative for set-valued maps. Particularly, it is shown that the sensitivity is closely related to a Lagrange multiplier solution of a dual program.

A natural extension of the classical envelope theorem in vector differential programming

The aim of this paper is to extend the classical envelope theorem from scalar to vector differential programming. The obtained result allows us to measure the quantitative behaviour of a certain set of optimal values (not necessarily a singleton) characterized to become minimum when the objective function is composed with a positive function, according to changes of any of the parameters which appear in the constraints. We show that the sensitivity of the program depends on a Lagrange multiplier and its sensitivity.

Regulation, stability and change: Reflections on the UK and Sweden

Despite the impact of neo-liberal agendas, the issue of regulation remains central to our understanding of economic processes, and particularly employment. The concept of regulation is often reduced to a narrowly defined set of functions performed by the state. However, processes of regulation involve a much wider range of sites and actors, within and beyond the boundaries of the state. This paper presents a framework for the analysis of the panoply of regulatory actors and the complex relations between them, including the shifting boundaries between regulatory spaces. The paper concludes with some illustrative examples of shifting regulatory structures within Sweden.

Constraint solving over multi-valued logics - application to digital circuits

Due to usage conditions, hazardous environments or intentional causes, physical and virtual systems are subject to faults in their components, which may affect their overall behaviour. In a ‘black-box’ agent modelled by a set of propositional logic rules, in which just a subset of components is externally visible, such faults may only be recognised by examining some output function of the agent. A (fault-free) model of the agent’s system provides the expected output given some input. If the real output differs from that predicted output, then the system is faulty. However, some faults may only become apparent in the system output when appropriate inputs are given. A number of problems regarding both testing and diagnosis thus arise, such as testing a fault, testing the whole system, finding possible faults and differentiating them to locate the correct one. The corresponding optimisation problems of finding solutions that require minimum resources are also very relevant in industry, as is minimal diagnosis. In this dissertation we use a well established set of benchmark circuits to address such diagnostic related problems and propose and develop models with different logics that we formalise and generalise as much as possible. We also prove that all techniques generalise to agents and to multiple faults. The developed multi-valued logics extend the usual Boolean logic (suitable for faultfree models) by encoding values with some dependency (usually on faults). Such logics thus allow modelling an arbitrary number of diagnostic theories. Each problem is subsequently solved with CLP solvers that we implement and discuss, together with a new efficient search technique that we present. We compare our results with other approaches such as SAT (that require substantial duplication of circuits), showing the effectiveness of constraints over multi-valued logics, and also the adequacy of a general set constraint solver (with special inferences over set functions such as cardinality) on other problems. In addition, for an optimisation problem, we integrate local search with a constructive approach (branch-and-bound) using a variety of logics to improve an existing efficient tool based on SAT and ILP.

INTEGRAL FUNCTIONALS ON C*-ALGEBRA OF VECTOR-VALUED REGULATED FUNCTIONS

In this paper we deal with the notion of regulated functions with values in a C*-algebra A and present examples using a special bi-dimensional C*-algebra of triangular matrices. We consider the Dushnik integral for these functions and shows that a convenient choice of the integrator function produces an integral homomorphism on the C*-algebra of all regulated functions ([a, b], A). Finally we construct a family of linear integral functionals on this C*-algebra.