We review the de nition and then analyse two optimization techniques that were developed for objectoriented databases. Both of these approaches are based on incorporating redundancy into the object base. However, the redundancy is entirely controlled by the system, rather than burdening the user with this task. One technique, called Access Support Relations, is based on redundantly maintaining ...

Data retrieval is the largest task in any large database, in the world’s largest data bases like cloud data retrieval is the one of the major issue. Retrieving the data and processing the query over cloud server is very difficult. Many searching technique are used for retrieving the data from cloud servers. It can be retrieved through an optimization technique. There are many data retrieval tec...

We present a completion-like procedure for constructing weak and strong Grr obner bases for polynomial ideals over commutative Noetherian rings with unit. This generalizes all the known algorithms for computing Grr obner bases for polynomial ideals over various diierent coeecient domains. The coeecient domain is incorporated using constraints. Constraints allow us to describe an optimized proce...

As part of a larger project, one of our goals is to enable users, not trained in AI, to be able to pose questions to an inference-capable knowledge base (KB), and receive acceptable answers. In particular, we wish the system to support answering a wide variety of questions, including longer questions which may include scenario descriptions, without requiring users to formulate their queries in ...

The optimization of computing systems incorporating Boolean-circuit-based computing equipment must be expressed at some level in Boolean behaviors and operations. Boolean behaviors and operations are part of a larger family of logics -the logic of sentences, also known as the "sentential calculus". Two logics are implicationally equivalent if the axioms and inference rules of each imply the axi...

Two numerical methods are proposed to solve the electric impedance tomography (EIT) problem in a domain with arbitrary boundary shape. The first is the new fast Fourier transform subspace-based optimization method (NFFT-SOM). Instead of implementing optimization within the subspace spanned by smaller singular vectors in subspace-based optimization method (SOM), a space spanned by complete Fouri...

In the paper, a theoretical work is done for investigating effects of splitting data sequence into packs of data set. We proved that a partitioning of data sequence is possible to find such that the entropy rate at each subsequence is lower than entropy rate of the source. Effects of sequence partitioning on overall compression rate are argued on the bases of partitioning statistics, and then, ...

This paper describes links between computational intelligence (CI), data mining and knowledge discovery. The generating elements of soft computing based data mining algorithms are defined where the extracted knowledge is represented by fuzzy rule-based expert systems. It is recognized that both model performance and interpretability are of major importance, and effort has to make to keep the re...

In this paper, the problem of coordinated motion control of a nonholonomic mobile platform with a serial manipulator mounted on top of the platform is addressed. The redundancy resolution algorithm bases on a constraint optimization approach, where the non–holonomic behaviour of the platform is modeled into inequality constraints leading to a convex optimization problem.

clustering is a widespread data analysis and data mining technique in many fields of study such as engineering, medicine, biology and the like. the aim of clustering is to collect data points. in this paper, a cultural algorithm (ca) is presented to optimize partition with n objects into k clusters. the ca is one of the effective methods for searching into the problem space in order to find a n...