Automatic discovery and invocation of services will only be accepted in practise, if the non-functional, especially QoS, parameters are taken into consideration during matchmaking. In this paper we present how this can be achieved. As an example, we use the DIANE framework and explain how the concepts developed there can be extended to easily accommodate non-functional aspects. Thereby, these a...

In this article, we formalize topological properties of real normed spaces. In the first few parts, open and closed, density, separability and sequence and its convergence are discussed. Then we argue properties of real normed subspace. In the middle of the article, we discuss linear functions between real normed speces. Several kinds of subspaces induced by linear functions such as kernel, ima...

Logic programs can be synthesized as a by-product of the planning of their verification proofs. This is achieved by using higher-order variables at the proof planning level, which become instantiated in the course of planning. We illustrate two uses of such variables in proof planning for program synthesis, one for synthesis proper and one for the selection of induction schemes. We demonstrate ...

Uniformization, choice functions and well orders in the class of trees. ABSTRACT The monadic second-order theory of trees allows quantification over elements and over arbitrary subsets. We classify the class of trees with respect to the question: does a tree T have a definable choice function (by a monadic formula with parameters)? A natural dichotomy arises where the trees that fall in the fir...

We obtain sufficient conditions for the finiteness of the moments of the single-server queue busy period in discrete and continuous time. In the cases of power and exponential moments, the conditions found coincide with the known necessary ones. 1. Introduction and notation. Consider a sequence t n n of random vectors with nonnegative coordinates which are i.i.d. in n, but any dependence betwee...

Satisfiability Modulo Theories (SMT) solvers check the satisfiability of firstorder formulas written in a language containing interpreted predicates and functions. These interpreted symbols are defined either by first-order axioms (e.g. the axioms of equality, or array axioms for operators read and write,. . . ) or by a structure (e.g. the integer numbers equipped with constants, addition, equa...

This paper argues that a powerful module compo"itioll facility can ell),il.Ilce t]le a.bility of object oriented languages to reuse aud contpose designs, specifications and code. hl addition, several flexible ways to produo.' prototypes can be supported, induuhlg symbolic eXf'cutioa of designs. rom posing prototype versions of components, and usiug "brti\t·iu" modules. ~luch of this power comes...

BACKGROUND This study aimed to develop guidelines for how a member of the Filipino public should provide mental health first aid to a person who is suicidal. METHODS The guidelines were produced by developing a questionnaire containing possible first aid actions and asking an expert panel of 34 Filipino mental health clinicians to rate whether each action should be included in the guidelines....

In this paper, we show that generic planar quadratic Hamiltonian systems with third degree polynomial perturbation can have eight small-amplitude limit cycles around a center. We use higher-order focus value computation to prove this result, which is equivalent to the computation of higher-order Melnikov functions. Previous results have shown, based on first-order and higher-order Melnikov func...

Logics for ‘generally’ were introduced for handling assertions with vague notions, such as ‘generally’, ‘most’, ‘several’, etc., by generalized quantifiers, ultrafilter logic being an interesting case. Here, we show that ultrafilter logic can be faithfully embedded into a first-order theory of certain functions, called coherent. We also use generic functions (akin to Skolem functions) to enable...