The long term goal of this project is to develop a better understanding of oceanic processes in the range of 100 m to 10 km, in the so-called submesoscale range. In particular, it is important to explore and find out whether and what type of submesoscale instabilities exist, how they are connected to both larger scale and smaller scale motions, and to what extent they influence transport proces...

Cucurbit[7[uril, the wheel component in two new and structurally simple pseudorotaxanes, shuttles between the two axle termini at low pH, whereas the shuttling motion stops at higher pH, as the wheel is bound to the center of the axle.

a characteristic of data envelopment analysis (dea) is to allow individual decision making units (dmus) to select the factor weights which are the most advantageous for them in calculating their efficiency scores. this flexibility in selecting the weights, on the other hand, deters the comparison among dmus on a common base. for dealing with this difficulty and assessing all the dmus on the sam...

a characteristic of data envelopment analysis (dea) is to allow individual decision making units (dmus) to select the factor weights that are the most advantages for them in calculating their efficiency scores. this flexibility in selecting the weights, on the other hand, deters the comparison among dmus on a common base. for dealing with this difficulty and assessing all the dmus on the same s...

The design and construction of a high-performance, low-cost, and easy to assemble adiabatic extension set for homebuilt and commercial spectrometers is described. Described apparatus set was designed for the fast adiabatic passage generation and is based on direct digital synthesizer DDS. This solution gives generator high signal to noise ratio, phase stability even during frequency change whic...

A large number of generating functions for permutation statistics can be obtained by applying homomorphisms to simple symmetric function identities. In particular, a large number of generating functions involving the number of descents of a permutation σ, des(σ), arise in this way. For any given finite set S of positive integers, we develop a method to produce similar generating functions for t...

We discuss an implementation of a derivative-free generating set search method for linearly constrained minimization with no assumption of nondegeneracy placed on the constraints. The convergence guarantees for generating set search methods require that the set of search directions possesses certain geometrical properties that allow it to approximate the feasible region near the current iterate...

For a graph G and a set F of connected graphs, G is said be F-free if G does not contain any member of F as an induced subgraph. We let G3(F) denote the set of all 3-connected F-free graphs. This paper is concerned with sets F of connected graphs such that |F| = 3 and G3(F) is finite. Among other results, we show that for an integer m > 3 and a connected graph T of order greater than or equal t...

Given a frame multi-resolution analysis of L2(Rd) with a set of multiple scaling functions that is a quasi-stable generating set for V0, we give some neccessary and su cient conditions under which the standard generating set for V1 is also a quasi-stable generating set. We also give some equivalent conditions for W0 to admit a quasi-stable generating set by means of the re nement equation mask,...

In ontology-based data access, data are queried through an ontology that offers a representation of the domain of interest. In this context, correct answers are those entailed by the logical theory constituted by the data and the ontology. Traditional database constraints like tuple-generating dependencies (TGDs) and equality-generating dependencies (EGDs) are a useful tool for ontology specifi...