The paper studies semi-almost periodic holomorphic functions on a polydisk which have, in a sense, the weakest possible discontinuities on the boundary torus. The basic result used in the proofs is an extension of the classical Bohr approximation theorem for almost periodic holomorphic functions on a strip to the case of Banach-valued almost periodic holomorphic functions.

In this paper, we consider minimization problems with a quasiconvex vector-valued inequality constraint. We propose two constraint qualifications, the closed cone constraint qualification for vector-valued quasiconvex programming (the VQ-CCCQ) and the basic constraint qualification for vector-valued quasiconvex programming (the VQ-BCQ). Based on previous results by Benoist, Borwein, and Popovic...

One of the limitation of the constraint network formalism lies in its inability of explicitly expressing a criteria to optimize. The introduction of several ad-hoc optimization mechanisms in constraint (logic) programming languages shows how important this restriction is. Several formalisms of varied generality have been proposed to remove this restriction: fuzzy constraint networks, partial co...

Changing the QAP's hard definition such that the facilities M are allowed to be mapped by a (single-valued, not necessarily injective) function π into the set of possible locations Y subject to a relation Π, π ⊆ Π, it arises the Semi-QAP that might be regarded as a relaxation of the QAP. In contrast to the Tree-QAP (flow graph F is a tree) the corresponding Semi-Tree-QAP is solvable in polynomi...

Traditional linear methods for forecasting multivariate time series are not able to satisfactorily model the non-linear dependencies that may exist in non-Gaussian series. We build on the theory of learning vector-valued functions in the reproducing kernel Hilbert space and develop a method for learning prediction functions that accommodate such non-linearities. The method not only learns the p...

We propose assertion-consistency (AC) semi-lattices as suitable orders for the analysis of partial models. Such orders express semantic entailment, multiple-viewpoint and multiple-valued analysis, maintain internal consistency of reasoning, and subsume finite De Morgan lattices. We classify those orders that are finite and distributive and apply them to design an efficient algorithm for multipl...

This work gathers new results concerning the semi-geostrophic equations: existence and stability of measure valued solutions, existence and uniqueness of solutions under certain continuity conditions for the density, convergence to the incompressible Euler equations. Meanwhile, a general technique to prove uniqueness of sufficiently smooth solutions to non-linearly coupled system is introduced,...

We consider the numerical solution of differential Riccati equations. We review the existing methods and investigate whether they are suitable for large-scale problems arising in LQR and LQG design for semi-discretized partial differential equations. Based on this review, we suggest an efficient matrix-valued implementation of the BDF for differential Riccati equations.

We show that a nite graph that is the inverse limit with a single surjective upper semi-continuous set valued function f : [0, 1] → 2[0,1] is either an arc or a simple triod. It is not known if there is such a simple triod.

Characterizations of semi-stable and stage extensions in terms of 2-valued logical models are presented. To this end, the so-called GL-supported and GL-stage models are defined. These two classes of logical models are logic programming counterparts of the notion of range which is an established concept in argumentation semantics.