Displaying similar documents to “A neural implementation of multi-adjoint logic programs via sf-homogenization.”

Extraction of fuzzy logic rules from data by means of artificial neural networks

Martin Holeňa (2005)

Kybernetika

Similarity:

The extraction of logical rules from data has been, for nearly fifteen years, a key application of artificial neural networks in data mining. Although Boolean rules have been extracted in the majority of cases, also methods for the extraction of fuzzy logic rules have been studied increasingly often. In the paper, those methods are discussed within a five-dimensional classification scheme for neural-networks based rule extraction, and it is pointed out that all of them share the feature...

Computer Networks Security Models - A New Approach for Denial-of-Services Attacks Mitigation

Tsvetanov, Tsvetomir (2010)

Serdica Journal of Computing

Similarity:

Computer networks are a critical factor for the performance of a modern company. Managing networks is as important as managing any other aspect of the company’s performance and security. There are many tools and appliances for monitoring the traffic and analyzing the network flow security. They use different approaches and rely on a variety of characteristics of the network flows. Network researchers are still working on a common approach for security baselining that might enable early...

An Open Virtual World for Professional Development

Stefanova, Eliza (2013)

Serdica Journal of Computing

Similarity:

The paper presents a study that focuses on the issue of sup-porting educational experts to choose the right combination of educational methodology and technology tools when designing training and learning programs. It is based on research in the field of adaptive intelligent e-learning systems. The object of study is the professional growth of teachers in technology and in particular that part of their qualification which is achieved by organizing targeted training of teachers. The article...

The Properties of Sets of Temporal Logic Subformulas

Mariusz Giero (2012)

Formalized Mathematics

Similarity:

This is a second preliminary article to prove the completeness theorem of an extension of basic propositional temporal logic. We base it on the proof of completeness for basic propositional temporal logic given in [17]. We introduce two modified definitions of a subformula. In the former one we treat until-formula as indivisible. In the latter one, we extend the set of subformulas of until-formulas by a special disjunctive formula. This is needed to construct a temporal model. We also...