Modelling the behaviour of genetic algorithms has concentrated on Markov chain analysis. However, Markov chains yield little insight into the dynamics of the underlying mechanics and processes. Thus, a framework and m...
详细信息
The ability to frequently update a simulation model in the light of new problem understanding is limited by the method of implementation of the model. This paper describes research, conducted by building a graphics sp...
详细信息
The ability to frequently update a simulation model in the light of new problem understanding is limited by the method of implementation of the model. This paper describes research, conducted by building a graphics specification system, into the possibility of the client and modeler deriving the model in a natural visual way. The research system uses this pictorial representation as the basis for the modeling system. The range of applicability of the research system is described, as well as its limitations, and possible future research work.
The trend towards Multimedia technology in Education is exemplified by the growing number of "multimedia ready" classrooms. Besides using the conventional computer-based training techniques, courseware has i...
详细信息
The problem researched is that there presently does not exist a set of success factors which are common across organizations and have some predictability relationship to software reuse. For completeness, this research...
详细信息
Discretization refers to splitting the range of continuous values into intervals so as to provide useful information about classes. This is usually done by minimizing a goodness measure, subject to constraints such as...
详细信息
Discretization refers to splitting the range of continuous values into intervals so as to provide useful information about classes. This is usually done by minimizing a goodness measure, subject to constraints such as the maximal number of intervals, the minimal number of examples per interval, or some stopping criterion for splitting. We take a different approach by searching for minimum splits that minimize the number of intervals with respect to a threshold of impurity (i.e., badness). We propose a "total entropy" motivated selection of the "best" split from minimum splits, without requiring additional constraints. Experiments show that the proposed method produces better decision trees.
Fairness may be a desirable property of a non-repudiation service, Protocols can achieve fairness through the involvement of a trusted third party but the extent of the trusted third party's involvement can vary b...
ISBN:
(纸本)0818679913
Fairness may be a desirable property of a non-repudiation service, Protocols can achieve fairness through the involvement of a trusted third party but the extent of the trusted third party's involvement can vary between protocols. Hence, one of the goals of designing an efficient non-repudiation protocol is to reduce the work load of the trusted third pally. fn this paper we present a variant of our fair non-repudiation protocol [15] where the trusted third party wilt be involved only in case that one party cannot obtain the expected non-repudiation evidence from the other party. This variant is efficient in an environment where the two parties are likely to resolve communications problems between themselves.
暂无评论