Tài liệu ADVANCES IN DISCRETE TIME SYSTEMS docx

... problem of robust constrained MPC for linear continuous- time uncertain systems, and hereafter, this idea was applied to linear discrete- time uncertain systems in [64, 65]. Inspired by above-mentioned ... manu‐ facturing systems, traffic networks, water or power networks [140] with an ever increasing complexity. In addition, there is an increasing interest in networked control...

Ngày tải lên: 14/02/2014, 09:20

Ngày tải lên: 10/12/2013, 14:15

... M. A. Lopez. Indexing the positions of continuously moving objects. In SIGMOD, 2000. A. P. Sistla, O. Wolfson, S. Chamberlain, and S. Dao. Modeling and querying moving objects. In ICDE, 1997. Y. ... Clustering has become an increasingly important task in modern applica- tion domains such as marketing and purchasing assistance, multimedia, molecular bi- ology as well as many others. In...

Ngày tải lên: 14/12/2013, 15:15

... relational databases into an XML format or to store the information in an XML object in a relational database, increasing the cost of e-business development. Moreover, specifying the mapping in the application ... (such as preceding-sibling and following-sibling). Even more complex are the following and preceding axes. Our goal in normalizing the Xpath expression is to bring it to a f...

Ngày tải lên: 14/12/2013, 15:16

... of a time- varying document. A snapshot is an instance of a time- varying document at a single point in time. For instance, if the schema asserts that an element is mandatory (minOccurs=1) in the ... designing the annotation specifications, considering the specifics of data integrity constraint checking, and ascertaining the impact on particular tools remain challenging (and interestin...

Ngày tải lên: 14/12/2013, 15:16

... pruning steps using can be done to do more effective pruning, since the two sets are symmetric in this join problem. 4 Constructing NNH Using Good Pivots Pivot points are vital to NNH for obtaining ... clustering approach of choosing pivots in NNH in terms of their effect of reducing the queue size and running time in an NN search. Our experiments showed that our clustering approach...

Ngày tải lên: 24/12/2013, 02:18

... obtained in polynomial time. 5.2 Partitioning Implication into Domains According to Theorem 1, to test the containment for two given queries and we need to test the containment implication in ... implications in different domains, since testing the implication in each domain is easier. Now we show that this partitioning idea is feasible. We say a comparison X A is in domain D if X...

Ngày tải lên: 24/12/2013, 02:18

... of MLQ. Data point insertion: When a new data point is inserted into the quadtree, MLQ updates the summary information in each of the existing blocks that the new data point maps into. It then ... using no more than Let us define SSENC as the sum of squared errors of the data points in block excluding those in its children. That is, where is the set of data points in that do not map i...

Ngày tải lên: 24/12/2013, 02:18

... and since each iteration is actually a generalized bargaining step, using a nested bargaining within a bargaining will only increase the number of exchanged messages. 4 Experimental Study In order ... be computed quickly, in a single pass over the data tuples in in the (arbitrary) order of their arrival. At any point in time, our query-processing algorithms can combine the maintained...

Ngày tải lên: 24/12/2013, 02:18

... Patterns in Time Series Databases. In Proc. of the 15th Int. Conf. on Data Engineering, Sydney, Australia, March 1999. J. Han, W. Gong, and Y. Yin. Mining Segment-Wise Periodic Patterns in Time Related ... Srikant. Mining Sequential Patterns. In Proc. of the 11th Int. Conf. on Data Engineering, Taipei, Taiwan, March 1995. W. Aref, M. Elfeky, and A. Elmagarmid. Incremental, Online,...

Ngày tải lên: 24/12/2013, 02:18