Recently, a model theoretic semantics for lazy functional programming combining parametric and inclusion polymorphism has been proposed in 2]. The aim of the present work is to provide the previous one with the incorporation of a typed lazy narrowing calculus for goal solving which combines lazy uniication, sharing and type checking at run-time. Furthermore, we state soundness and completeness ...

We present a family of hedging strategies for a European derivative security in a stochastic volatility environment. The strategies are robust to speciication of the volatility process and do not need a parametric description of it or estimation of the volatility risk premium. They allow the hedger to control the probability of hedging success according to risk aversion. The formula exploits th...

We present a parametric walk model for a four-legged robot. The walk model is improved using a genetic algorithm, but unlike previous approaches, the fitness is determined in a run that closely resembles the later application. We thus not only achieve high speeds, but also a high degree of flexibility. In addition to the walking model being flexible, we present a means of automatically calibrat...

Overview: The main function of this Matlab toolbox is to run a GLM on graph theoretic network properties computed from brain networks. The GLM accepts continuous & categorical between-participant predictors and a categorical within-participant predictor. Significance is determined via non-parametric permutation tests. The toolbox allows testing of both fully connected and thresholded (binarized...

We examine a family of GI/GI/1 queueing processes generated by a parametric family of service time distributions, F (x, θ), and we show that under suitable conditions the corresponding customer stationary expectation of the system time is twice continuously differentiable with respect to θ. Expressions for the derivatives are given which are suitable for single run derivative estimation. These ...

This paper presents a complete system model for scheduling and dispatching CORBA service requests that have hard as well as soft real-time timing requirements in a distributed environment. The model provides the methodology for expressing and enforcing time-based QoS constraints for real-time CORBA service requests. Therefore, the presented model complements the state of the art in real-time sc...