X iv :m at hph /0 00 80 39 v1 3 0 A ug 2 00 0 Decimation of Scherk’s First Surface Randall D. Kamien Department of Physics and Astronomy, University of Pennsylvania, Philadelphia, PA 19104 16 August 2000 Abstract We show that Scherk’s first surface, a one-parameter family of solutions to the minimal surface equation, may be written as a linear superposition of itself.

Given a bounded autonomous vector field b : R2 → R2, we study the uniqueness of bounded solutions to the initial value problem for the related transport equation ∂tu + b · ∇u = 0. Assuming that b is of class BV and it is nearly incompressible, we prove uniqueness of weak solutions to the transport equation. The starting point of the present work is the result which has been obtained in [10] (wh...

Source traac streams as well as aggregated traac ows often exhibit long-range-dependent (LRD) properties. In this work, we model traac streams using multi-plicative multifractal processes. We develop two type of models, the multifractal point processes and multifractal counting processes. We demonstrate our model to eeectively track the behavior exhibited by the system driven by the actual traf...

Ve model the shared buffer ATM switch as a discrete-time queueing system. The arrival process to each port of the ATM switch. is assumed to be bursty and it is modelled by an Interrupted Bernoulli Process. The discrete-time queueing system is analyzed approximately. It is first decomposed into subsystems, and then each subsystem is analyzed separately. The results from the subsystems are combin...

We prove the refutational completeness of Pmep by proof techniques employed in establishing the completeness of weak superposition [9]. By giving a counter-example we show that the same approach is impossible wrt. Peqf . Hence, this result shows a semantic differences between Pmep and Peqf . We apply the result to Automated Model Building.

This paper proposes new algorithms for protein structure alignment. Protein structure alignment is, given two three-dimensional protein structures, to nd spatially equivalent residue pairs. Each algorithm consists of the following two steps: rst an initial superposition is computed; then a structure alignment is computed and re ned using bipartite graph matching. The proposed algorithms are sho...

In this paper, we investigate the ability of the Predication-based Semantic Indexing (PSI) approach, which incorporates both symbolic and distributional information, to support inference on the basis of structural similarity. For example, given a pair of related concepts prozac:depression, we attempt to identify concepts that relate to a third concept, such as schizophrenia in the same way. A n...

We introduce a new approach to handling equality in logic programs. The method is based on the transformation of equational logic programs into logic programs without equality using basic superposition and the basic folding. We prove soundness, completeness and the existence of terminating strategies. The e ciency of the method is demonstrated on examples. An implementation is brie y discussed....

Language support for object-oriented programming with patterns is provided. Thereby, designs making use of design patterns can be implemented in a more direct and traceable way. The essential language constructs are nested classes and a kind of superposition for class structures. A corresponding experimental programming language PaL is discussed. The current implementation is based on a compila...

Special class of surfaces, two-axial surfaces of revolution created by the Euclidean metric transformation of a simultaneous revolution about two different axes, is presented in the paper. Three specific subclasses of surfaces are classified with respect to the superposition of the two axes 1o, 2o of revolution. There are defined several types of two-axial surfaces of revolution specifying the ...