There are two types of digital filters including Infinite Impulse Response (IIR) and Finite Impulse Response (FIR). IIR filters attract more attention as they can decrease the filter order significantly compared to FIR filters. Owing to multi-modal error surface, simple powerful optimization techniques should be utilized in designing IIR digital filters to avoid local minimum. Imperialist compe...

One of the major steps toward the industrialization of the microbial product(s) is to optimize the cultivation conditions at the large-scale bioreactor and successfully control the microbial behavior within a large scale production environment. Statistical Design of Experiment was proven to optimize a vast number of microbial processes to achieve robustness and explore possible interactions...

A class of cascade filters, orthogonal with respect to a new inner product, is presented in this paper. A sequence of generalized Malmquist orthogonal rational functions is used for design of these filters. In addition, by using these functions Müntz polynomials which are orthogonal in respect to a special inner product were derived. Obtained Müntz polynomials are applied in determination of ou...

One of the problems that we experience with today's most widespread Internet Information Systems (like WWW or Gopher) is the lack of support for maintaining referential integrity. Whenever a resource is (re)moved, dangling references from other resources may occur. This paper presents a scalable architecture for automatic maintenance of referential integrity in large (thousands of servers) dist...

In this paper we list some new orthogonal main e ects plans for three level designs for and factors in runs and compare them with designs obtained from the existing L orthogonal array We show that these new designs have better projection properties and can provide better parameter estimates for a range of possible models Additionally we study designs in other smaller run sizes when there are in...

An orthogonal double cover (ODC) of a complete graph is a collection of graphs such that every two of them share exactly one edge and every edge of the complete graph belongs to exactly two of the graphs. In this paper, we construct ODCs of Kn where all graphs are isomorphic to certain spanning subgraphs G (such as co-triangles, a star with cotriangles, and two other graph classes).