scattering of an incoming wave train by a discontinuity at the upper surface of the ocean over a uniform porous bottom of finite depth is considered here in the framework of linearized water wave theory. by employing residue calculus method, the reflection and transmission coefficient are obtained. these coefficients are computed numerically for different values of the porosity parameter g and ...

we describe a variational problem on a surface under a constraintof geometrical character. necessary and sufficient conditions for the existence ofbifurcation points are provided. in local coordinates the problem corresponds toa quasilinear elliptic boundary value problem. the problem can be consideredas a physical model for several applications referring to continuum medium andmembranes.

We present symmetric Rogers--Hölder's inequalities on time scales when $frac{1}{p}+frac{1}{q}+frac{1}{r}=0$ and $frac{r}{p}+frac{r}{q}$ is not necessarily equal to $1$ where $p,$ $q$ and $r$ are nonzero real numbers.

This paper proposes an implementation of objects and functions via a calculus with explicit substitutions which is connuent and preserves strong normal-ization. The source calculus corresponds to the combination of the &-calculus of Abadi and Cardelli AC96] and the-calculus, and the target calculus corresponds to an extension of the former calculus with explicit substitutions. The interesting f...

Modules and linking are usually formalized by encodings which use the-calculus, records (possibly dependent), and possibly some construct for recursion. In contrast, we introduce the m-calculus, a calculus where the primitive constructs are modules, linking, and the selection and hiding of module components. The m-calculus supports smooth encodings of software structuring tools such as function...

The λ̄μμ̃-calculus is a variant of the λ-calculus with significant differences, including non-confluence and a Curry-Howard isomorphism with the classical sequent calculus. We present an encoding of the λ̄μμ̃-calculus into the π-calculus. We establish the operational correctness of the encoding, and then we extract from it an abstract machine for the λ̄μμ̃-calculus. We prove that there is a tight rel...

We define a continuation-passing style (CPS) translation for typed ?-calculus with probabilistic choice, unbounded recursion, and tick operator — modeling cost. The target language is (non-probabilistic) ?-calculus, enriched type of extended positive reals fixpoint operator. then show that applying the CPS transform an expression M to continuation ? v . 0 yields expected cost also introduce for...