Mehdi Mirzazadeh

Learn More
We investigate the problem of finding an unknown cut through querying vertices of a graph G. Our complexity measure is the number of submitted queries. To avoid some worst cases, we make a few assumptions which allow us to obtain an algorithm with the worst case query complexity of O(k) + 2k log n k in which k is the number of vertices adjacent to(More)
Constructing soccer robots is an attempt in development of AI researches, done by defining a standard problem and solving it by many researchers all over the world. In this field, every year a formal federation holds international competitions, called RoboCup [1]. The Simulation League is one of the branches of the RoboCup. We have designed and implemented(More)
We consider the problem of evaluating an expression consisting of unions and intersections of some sorted sets in the comparison model. Given the expression and the sizes of the sets, we are interested in the worst-case complexity of evaluating the expression in terms of the sizes of the sets. We assume the sets in the given expression are independent. We(More)
BACKGROUND Point-of-care testing allows rapid analysis of samples to facilitate prompt clinical decisions. Electrolyte and calcium abnormalities are common in acutely ill patients and can be associated with life-threatening consequences. There is uncertainty whether clinical decisions can be based on the results obtained from blood gas analysers or if(More)
A simple and sensitive method is described for the pre-concentration by cloud point extraction followed by atomic absorption spectrometric determination of nickel, lead, zinc and copper ions in real samples. At a solution pH of 7.0, 2-amino-5-mercapto-1, 3, 5 -thiadiazole (AMTD) and TritonX-114 were used as hydrophobic ligand and non-ionic surfactant. The(More)
In this thesis we study a problem that arises in answering boolean queries submitted to a search engine. Usually a search engine stores the set of IDs of documents containing each word in a pre-computed sorted order and to evaluate a query like “computer AND science” the search engine has to evaluate the union of the sets of documents containing the words(More)
We give experimental evidence for the benefits of order-preserving compression in sorting algorithms. While, in general, any algorithm might benefit from compressed data because of reduced paging requirements, we identified two natural candidates that would further benefit from order-preserving compression, namely string-oriented sorting algorithms and(More)
In this thesis, we study the problem of evaluating set expressions over sorted sets in the comparison model. The problem arises in the context of evaluating search queries in text database systems; most text search engines maintain an inverted list, which consists of a set of documents that contain each possible word. Thus, answering a query is reduced to(More)