Silvers’s perfect set theorem says that every Π1 equivalence relation over a polish space either has countably many equivalence classes or has a perfect set of inequivalent elements. We prove an analog where the equivalence relation is replaced by a Π1 dependence relation, and the perfect set of inequivalent elements is replaced by a perfect independent set. The dependence relation should satis...

There is polynomial function Xq in the entries of an m×m(q− 1) matrix over a field of prime characteristic p, where q = p is a power of p, that has very similar properties to the determinant of a square matrix. It is invariant under multiplication on the left by a non-singular matrix, and under permutations of the columns. This gives a way to extend the invariant theory of sets of points in pro...

As moving to big data world where data is increasing in unstructured way with high velocity, there is a need of data-store to store this bundle amount of data. Traditionally, relational databases are used which are now not compatible to handle this large amount of data, so it is needed to move on to non-relational data-stores. In the current study, we have proposed an extension of the Mongo...

The significant computational efforts required to compute risk-based inspection plans founded on the Bayesian decision theory has hindered their application in the past. In this article, a computationally efficient method for the calculation of risk-based inspection (RBI) plans is presented, which overcomes the problem through the use of a generic approach. After an introduction in RBI planning...

This work presents the application of theory revision to the design of distributed databases to automatically revise a heuristic-based algorithm (called analysis algorithm) through the use of the FORTE system. The analysis algorithm decides the fragmentation technique to be used in each class of the database and its Prolog implementation is provided as the initial domain theory. Fragmentation s...

In this paper, we introduce Quasi Serializability, a correctness criterion for concurrency control in heterogeneous distributed database environments. A global history is quasi serializable if it is (conflict) equivalent to a quasi serial history in which global transactions are submitted serially. Quasi serializability theory is an extension of serializability. We study the relationships betwe...

In spatial database, geographic information system (GIS) technology and system engineering theory, the hydro-ecological spatial database was built, and the corresponding hydro-ecological spatial database management information system was designed and developed. From aspects of the data organization and classification, the overall structure of the database, database construction processes and da...

In reality, a lot of information is available only in an imperfect form. This might be due to imprecision, vagueness, uncertainty, incompleteness, or ambiguities. Traditional database systems can only adequately cope with perfect data. Among others, fuzzy set theory has been applied to deal with imperfections of data in a more natural way and to enhance the accessibility of databases. In this c...

More recent approaches to terminology incorporate premises from cognitive linguistics and sociolinguistics in their theoretical framework. Although such approaches range from general theoretical frameworks to more practical models based on a specific cognitive theory, none provides explicit guidelines on how to incorporate theoretical findings into a multi–domain term base, such as Struna. Stru...