In this research, Fischer Tropsch synthesis (FTS) has been modeled in the fixed bed chromatographic reactor for the first time by applying a rather complex dispersed plug flow model for fluid phase and linear driving force (LDF) model for adsorbent. Model equations are dynamic, multi-component, non-linear and heterogeneous including reaction and adsorption simultaneously Complex kinetics fo...

It is well-known that an image can be reconstructed from an infinite set of moments. Many works have focused on the reconstruction aspects of orthogonal moments, and have shown that the image can be reconstructed easily from a finite set of orthogonal moments. However, reconstruction ability of geometric moments is not yet proved. In this paper, the inverse problem of geometric moments is addre...

This paper proposes the use of new target vectors for MLP learning in EEG signal classification. A large Euclidean distance provided by orthogonal bipolar vectors as new target ones is explored to improve the learning and generalization abilities of MLPs. The data set consisted of EEG signals captured from normal individuals and individuals under brain-death protocol. Experimental results are r...

In this paper two types of multiple orthogonal polynomials on the semicircle with respect to a set of r different weight functions are defined. Such polynomials are generalizations of polynomials orthogonal on the semicircle with respect to a complex-valued inner product 1⁄2f ; g 1⁄4 R p 0 f e ih g eih w eih dh. The existence and uniqueness of introduced multiple orthogonal polynomials for cert...

Let P = fP 0 ; : : : ; P n?1 g denote a set of polynomials with complex coeecients. Let Z = fz 0 ; : : : ; z n?1 g C denote any set of sample points. For any f = (f 0 ; : : : ; f n?1) 2 C n the discrete polynomial transform of f (with respect to P and Z) is deened as the collection i=0 f i P j (z i)w(i) for some associated weight function w. These sorts of transforms nd important applications i...

An orthogonal double cover (ODC) of the complete graph Kn by some graph G is a collection of n spanning subgraphs of Kn, all isomorphic to G, such that any two of the subgraphs share exactly one edge and every edge of Kn is contained in exactly two of the subgraphs. A necessary condition for such an ODC to exist is that G has exactly n− 1 edges. We show that for any given positive integer d, al...

This paper describes the application of a combined orthogonal array design and overlapping resolution mapping to the optimization of miceller electrokinetic chromatography for the separation of 10 substituted benzenes. The most important factors were first determined according to an OA16(2(15)) through 16 pre-designed experiments; a second set of experiments was carried out according to a trian...

Zernike polynomials provide a well known, orthogonal set of scalar functions over a circular domain, and are commonly used to represent wavefront phase or surface irregularity. A related set of orthogonal functions is given here which represent vector quantities, such as mapping distortion or wavefront gradient. Previously, we have developed a basis of functions generated from gradients of Zern...

The nonlinear integral equation P (x) = ∫ β α dy w(y)P (y)P (x + y) is investigated. It is shown that for a given function w(x) the equation admits an infinite set of polynomial solutions P (x). For polynomial solutions, this nonlinear integral equation reduces to a finite set of coupled linear algebraic equations for the coefficients of the polynomials. Interestingly, the set of polynomial sol...

We consider questions concerning the tileability of orthogonal polygons with colored dominoes. A colored domino is a rotatable 2× 1 rectangle that is partitioned into two unit squares, which are called faces, each of which is assigned a color. In a colored domino tiling of an orthogonal polygon P , a set of dominoes completely covers P such that no dominoes overlap and so that adjacent faces ha...