Learn More
This paper first presents a simple explanation for the min/max bounds which are used in interval probability theory (I n) [l], possibility theory [2], fuzzy rough sets [4], and vague logic [5]. Based on this definition , a computable version of first-order fuzzy logic is defined, where all of the upper bounds for instances of a theorem and its negation are(More)
A class algebra has been used to model the query and data manipulation language for a prototype object-oriented database system which is being implemented for the WorldWide Web [7]. The Prolog prototype (i.e. operational semantics, if you will) is located at The class algebra includes a Boolean algebra for class union, intersection, and complement (i.e.(More)
Many asynchronous distributed atomic commit protocols use a coordinator, either an application server or an elected database server, to handle the progress of a transaction. When the coordinator fails or the network becomes partitioned, the transaction may block or may suffer from a split brain syndrome. In this paper we propose a decentralized,(More)
We introduce an adaptive learning environment named DALM (DICE adaptive learning model) based on DICE test-driven development (TDD) model that was implemented in a parse-tree based automatic on-line grader. In our opinion, there are three variables in DALM. The individual differences (I) classify the learners into several groups. The training method (T)(More)
We propose a trust framework model for an educational cloud which is designed to overcome inequalities of M-shaped incomes by simplifying contract-based sharing of resources among multiple schools. We use class algebra, which is similar to SROIQ(D) description logic, as the access control policy language. Benefiting from the high expressivity of class(More)