Previous research on materialized views has primarily been in the context of flat relational databases-materialized views defined in terms of one or more flat relations. This paper discusses a broader class of view definitions-materialized views defined over a nested data model such as the nested relational model or an object-oriented data model. An attribute of a tuple deriving the view can be...

Question and answering service is one of the popular services in the World Wide Web. The main goal of these services is to finding the best answer for user's input question as quick as possible. In order to achieve this aim, most of these use new techniques foe question matching. . We have a lot of question and answering services in Persian web, so it seems that developing a question matching m...

this paper presents a model for constrained multiobjective optimization of mixed-cropping planning. the decision challenges that are normally faced by farmers include what to plant, when to plant, where to plant and how much to plant in order to yield maximum output. consequently, the central objective of this work is to concurrently maximize net profit, maximize crop production and minimize pl...

Bring home now the book enPDFd multivariate statistical modelling based on generalized linear models to be your sources when going to read. It can be your new collection to not only display in your racks but also be the one that can help you fining the best sources. As in common, book is the window to get in the world and you can open the world easily. These wise words are really familiar with ...

In contrast to the classical discrete choice experiment, the respondent in a rank-order discrete choice experiment, is asked to rank a number of alternatives instead of the preferred one. In this paper, we study the information matrix of a rank order nested multinomial logit model (RO.NMNL) and introduce local D-optimality criterion, then we obtain Locally D-optimal design for RO.NMNL models in...

We present new algorithms using structured matrix methods for manipulating polynomi-als expressed in generalized form, that is, relative to a polynomial basis fp i (x)g satisfying a three-term recurrence relation. This includes computing the Euclidean remainders as well as the greatest common divisor of two polynomials u(x) and v(x) of degrees less than n. The computational schemes involve solv...