Vladimir Mateev
ABSTRACT
Tutoring tool for logical schemes design with a Graphical User Interface having been a part of an intelligent environment for analysis and synthesis of Boolean functions is presented in this paper. The tool affords an opportunity of drawing logical schemes in a defined basis. It determines and if the user desires brings out the truth table of the synthesised structured scheme. It offers a list of Boolean functions for structured synthesis, formed like a number of tasks which the user can choose. The tool has a possibility to estimate the rightness of the drawing scheme and can save it as a file. It is designed to help the students giving them a way to practice and improve their skills in the area of logical schemes design. It can be used for testing or self-learning. Java programming language has been used. That allows to create it as an applet and to incorporate it in a Web document or as a stand-alone application. Thus this tool can find a large area of its application in the virtual universities, distance education and e learning.
- Reference contained Cyrillic text which couldn't be captured.Google Scholar
- Darina Dicheva: "Intelligent tutoring systems", Sofia, 1997Google Scholar
- Maria Nisheva, Dimitar Shishkov, "Artifical intelligence", Dobrich, 1995Google Scholar
- Angel Smrikarov, "E-learning", Ruse, 2004Google Scholar
- Simon Roberts, Philip Heller, Michael Ernest: "Complete Java 2 Certification", 2000 Google ScholarDigital Library
- Bruce Eckel: "Thinking in Java", 2000 Google ScholarDigital Library
- Roth, Charles. H.: "Fundamentals of logic design", West Publishing Company, 1992 Google ScholarDigital Library
- Tutoring tool for logical schemes design
Recommendations
Look into the Mirror: Evolving Self-dual Bent Boolean Functions
Genetic ProgrammingAbstractBent Boolean functions are important objects in cryptography and coding theory, and there are several general approaches for constructing such functions. Metaheuristics proved to be a strong choice as they can provide many bent functions, even ...
Derivatives of bent functions in connection with the bent sum decomposition problem
AbstractIn this paper, we investigate when a balanced function can be a derivative of a bent function. We prove that every nonconstant affine function in an even number of variables n is a derivative of bent functions, where is the set ...
Four decades of research on bent functions
In this survey, we revisit the Rothaus paper and the chapter of Dillon's thesis dedicated to bent functions, and we describe the main results obtained on these functions during these last 40 years. We also cover more briefly super-classes of Boolean ...
Comments