8 resultados para Self-adapting applications
em Bulgarian Digital Mathematics Library at IMI-BAS
Resumo:
Optimization of design, creation, functioning and accompaniment processes of expert system is the important problem of artificial intelligence theory and decisions making methods techniques. In this paper the approach to its solving with the use of technology, being based on methodology of systems analysis, ontology of subject domain, principles and methods of self-organisation, is offered. The aspects of such approach realization, being based on construction of accordance between the ontology hierarchical structure and sequence of questions in automated systems for examination, are expounded.
Resumo:
This paper presents a technique for building complex and adaptive meshes for urban and architectural design. The combination of a self-organizing map and cellular automata algorithms stands as a method for generating meshes otherwise static. This intends to be an auxiliary tool for the architect or the urban planner, improving control over large amounts of spatial information. The traditional grid employed as design aid is improved to become more general and flexible.
Resumo:
The Self-shrinking p-adic cryptographic generator (SSPCG) is a fast software stream cipher. Improved cryptoanalysis of the SSPCG is introduced. This cryptoanalysis makes more precise the length of the period of the generator. The linear complexity and the cryptography resistance against most recently used attacks are invesigated. Then we discuss how such attacks can be avoided. The results show that the sequence generated by a SSPCG has a large period, large linear complexity and is stable against the cryptographic attacks. This gives the reason to consider the SSPSG as suitable for critical cryptographic applications in stream cipher encryption algorithms.
Resumo:
Organizations are seeking new, integrated systems that enable rapid changes through early identification of opportunities and problems, tracking of progress against plans, flexible allocation of resources to achieve goals, and consistent operations. Total Quality Management (TQM) is an overall business strategy. It means that all activities of the company will be focused on satisfying all stakeholders of the company. TQM can be realised by using the EFQM model. The EFQM model is a tool that organizations may use as a framework for self-evaluation that enables an organization to identify its strengths and areas for improvement and the extent to which its operations and results are in line with the characteristics of an excellent organization. We focus on a training organisation or to the learning department of an organization. So we are limiting the EFQM model to the training /learning activities. We can apply EFQM perfect on the level of an activity (business line) of a company. We selected the main criteria for which the learner can play the role of assessor. So only three main criteria left: the enabling resources, the enabling processes and the (learning) results for the learner. We limited the last one to “learning results” based on the Kirkpatrick model.
Resumo:
* Supported by projects CCG08-UAM TIC-4425-2009 and TEC2007-68065-C03-02
Resumo:
Architecture and learning algorithm of self-learning spiking neural network in fuzzy clustering task are outlined. Fuzzy receptive neurons for pulse-position transformation of input data are considered. It is proposed to treat a spiking neural network in terms of classical automatic control theory apparatus based on the Laplace transform. It is shown that synapse functioning can be easily modeled by a second order damped response unit. Spiking neuron soma is presented as a threshold detection unit. Thus, the proposed fuzzy spiking neural network is an analog-digital nonlinear pulse-position dynamic system. It is demonstrated how fuzzy probabilistic and possibilistic clustering approaches can be implemented on the base of the presented spiking neural network.
Resumo:
In this paper, a novel approach for character recognition has been presented with the help of genetic operators which have evolved from biological genetics and help us to achieve highly accurate results. A genetic algorithm approach has been described in which the biological haploid chromosomes have been implemented using a single row bit pattern of 315 values which have been operated upon by various genetic operators. A set of characters are taken as an initial population from which various new generations of characters are generated with the help of selection, crossover and mutation. Variations of population of characters are evolved from which the fittest solution is found by subjecting the various populations to a new fitness function developed. The methodology works and reduces the dissimilarity coefficient found by the fitness function between the character to be recognized and members of the populations and on reaching threshold limit of the error found from dissimilarity, it recognizes the character. As the new population is being generated from the older population, traits are passed on from one generation to another. We present a methodology with the help of which we are able to achieve highly efficient character recognition.
Resumo:
AMS subject classification: Primary 49J52; secondary: 26A27, 90C48, 47N10.