The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
A moving polygonal object takes up large storage space in moving database, which incurs heavy disk I/O cost in querying process. Motivated by TPR-tree and MR-tree, Multiple-Approximation is advanced to be TPMA with Time-Parameterized technology to deal with indexing of moving polygonal objects. New indexing structure for moving polygonal objects based on TPMA, which is termed as MTPR-tree, is presented...
By casting off the direct restriction of topological structure, this paper presents another matching scheme between the input A* and the knowledge A rarr B based on the equivalence relation R on formulae set F(S) and the corresponding equivalence classification F(S)/R = { [A]R | A isin F(S)} therefore, obtains another algorithm of approximate reasoning - the IV-type R-algorithm. The paper presents...
This paper introduces and investigate the type II true level k knowledge circle, extended type II knowledge base, extended type II automatic reasoning system and the level (k,j) perfectness of extended type II knowledge base KII bases on the type II topological logicCIIT.
In this paper, we propose the basic framework of point- wise topological logic on completely distributive lattices and explore approximate reasoning in it. The logic of this paper is based on pointwise characterization, therefore the pointwise conception is pervasive. We explore approximate reasoning in abstract logical framework Fl on completely distributive lattice L. We propose the structure of...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.