Upper bound constraints are often set when complex scientific or business processes are modelled as grid workflow specifications. However, many existing processes such as climate modelling or international stock market analysis often have only one end-to-end upper bound constraint. This is not sufficient to control overall temporal correctness as we may not find temporal violations until the la...

In this paper, we propose an algorithm base on decomposition technique for solvingthe mixed integer linear multiplicative-linear bilevel problems. In actuality, this al-gorithm is an application of the algorithm given by G. K. Saharidis et al for casethat the rst level objective function is linear multiplicative. We use properties ofquasi-concave of bilevel programming problems and decompose th...

In this paper we derive high probability lower and upper bounds on the excess risk of stochastic optimization of exponentially concave loss functions. Exponentially concave loss functions encompass several fundamental problems in machine learning such as squared loss in linear regression, logistic loss in classification, and negative logarithm loss in portfolio management. We demonstrate an O(d...

Generalizing a result (the case k = 1) due to M. A. Perles, we show that any polytopal upper bound sphere of odd dimension 2k+1 belongs to the generalizedWalkup class Kk(2k + 1), i.e., all its vertex links are k-stacked spheres. This is surprising since the k-stacked spheres minimize the face-vector (among all polytopal spheres with given f0, . . . , fk−1) while the upper bound spheres maximize...

The isometric embeddings 2;K → p;K (m ≥ 2, p ∈ 2N) over a field K ∈ {R,C,H} are considered, and an upper bound for the minimal n is proved. In the commutative case (K = H) the bound was obtained by Delbaen, Jarchow and Pe lczyński (1998) in a different way. Let K be one of three fields R,C,H (real, complex or quaternion). Let K be the K-linear space consisting of columns x = [ξi] n 1 , ξi ∈ K, ...