Каширин И.Ю.

See other templatesSee other templates

  • ICF+ taxonomies

    ICF+ taxonomies

    I (IS-A) C (Contr) F (Form) = ICF+ - a derived taxonomic relation with wonderful properties. other ICF+ designation: icf. ICF+ taxonomies are used in knowledge representation for NLP and vectorization in neural networks.

  • Neural networks

    Neural networks

    Neural networks allow you to link ICF+ taxonomies and hierarchical numbers to solve the problem of understanding.

  • Hierarchical Numbers

    Hierarchical Numbers

    Hierarchical numbers are a branch of mathematical number theory that allows you to adequately operate on the main characteristics of taxonomies. In the theory of knowledge representation of artificial intelligence.

Homepage Slideshow

  • ICF+ taxonomies

    I (IS-A) C (Contr) F (Form) = ICF+ - a derived taxonomic relation with wonderful properties. other ICF+ designation: icf. ICF+ taxonomies are used in knowledge representation for NLP and vectorization in neural networks.

  • Neural networks

    Neural networks allow you to link ICF+ taxonomies and hierarchical numbers to solve the problem of understanding.

  • Hierarchical Numbers

    Hierarchical numbers are a branch of mathematical number theory that allows you to adequately operate on the main characteristics of taxonomies. In the theory of knowledge representation of artificial intelligence.

Presentation on the application of hierarchical numbers (watch online)

A NEURAL NETWORK FOR CLASSIFYING MEDIA INTO WESTERN AND EASTERN

A Bert-based-cased language model that has undergone fine tuning and modification of special tokens based on the author's materials.

The model classifies media articles into pro-Western and pro-Russian.


Download

HomeICF+ ontologiesTemplate DetailsAdvanced StuffJoomla! 2.5 & Joomla! 3.x Support

Joomla! 2.5 & Joomla! 3.x Support

JSN Boot is natively compatible with both Joomla! 2.5 and Joomla! 3.x. The installation package is compatible with both Joomla CMS.

Program machines

The formalism of software machines makes it possible to mathematically strictly describe the concept of the conceptual integrity of a programming language. To get a formalism focused on analyzing the basic structures of an algorithmic language, let's look his structural components.

Read more...

INTERRELATION

The Program Machines system can be considered in various combinations as higher-level formalisms. The connection between the components can be seen at the level of the structure of the construction of elements of the carrier sets of the algebraic systems discussed above.

Read more...

programming languages

Let's consider the use of algebraic interpretation of language constructs for PL C, Lisp and Prolog as the most well-known algorithmic languages, which are representatives of languages of the universal, functional and logical type, respectively. Optimizing transformations are possible.

 Read more...

UNIFICATION

Excelsior

If the terms s and t represent a formal record of programs some predetermined program machine, then we are talking not simply about unifying or comparing two programs in order to find common fragments in them, but about an attempt to find some third term containing  variables.

Read more...

Go to top