Airat Khasianov

Kazan (Volga Region) Federal University · Higher School of Information Technology and Intelligent Systems

Potential function based methods play significant role in both global and local path planning. While these methods are characterized with good reactive behaviour and implementation simplicity, they suffer from a well-known problem of getting stuck in local minima of a navigation function. In this paper we propose a modification of our original spli...

A very short presentation of what we are doing at our department with the names of particular researchers on it. You are welcome to contact me concerning possible collaboration!

In the paper we present a method of gamification applying in the Unified State Examination (USE) preparation activities in the Russian Federation. The USE is a final examination at school as well as a university entrance examination. Students' preparing for this exam takes two years and is accompanied by solving of a large number of similar tasks....

A Number of results obtained within the framework of the project for the formation of the scientific and information space of the Republic of Tatarstan the basis of the service-oriented platform science.tatarstan.ru are described. The project is aimed at creating an information system of cloud services that provide multilevel support of the process...

В данной работе представлено исследование внедрения геймификации в образовательный процесс в трех различных контекстах: средние классы школы, старшие классы школы и университет. В процессе исследования была разработана специальная программная платформа геймификации. Эта платформа включает облачный сервис, доступный на всех основных мобильных платфо...

Explains some basics of how we implement project and problem-based learning at our department

Описана архитектура системы интеллектуального анализа текстов в юриспруденции, способной на имеющейся базе данных судебных документов выявлять общие зависимости, предоставлять для ознакомления юридические дела, близкие по тематике, рекомендовать наиболее вероятные исходы судебного рассмотрения или помечать важные места, на которые следует обращать...

Монография освещает вопросы, связанные с когнитивной-семиотическими аспектами моделирования в гуманитарной сфере.

In this paper we study a new model of mobile learning for the Unified State Exam (USE) preparation. USE - is the test school graduates need to pass in order to obtain matura. In recent years the efforts teachers put for preparation of their students to the USE diminish how much the subject is actually mastered buy the students. The problem lays in...

Considering the current advancements in biometric sensors and other related technologies, and using bio-inspired models for AI improvements, we can infer that swarm intelligence paradigm can be implemented in human daily spheres through the connectivity between user gadgets connected to the Internet of Things. This is a first step towards the a rea...

Potential function-based methods play a significant role in global and local path planning. While these methods are characterized by good reactive behaviour and implementation simplicity, they suffer from a well-known problem of getting stuck in local minima of a navigation function. In this article, we propose a modification of our original spline...

There is a long standing tradition, the university graduates to get adequate training for a real-life job. Whereas only up to 10% of the graduates prefer to pursue an academic career, universities still keep teaching them to become academicians. In order to resolve this issue in 2010 Kazan Federal University and the Ministry of Telecommunication of...

We present a case study of implementing gamification in middle school, high school and the university. A special platform for gamification was developed. This platform includes a cloud service accessible through any sort of mobile devices (iOS, Windows, Android) and web-interface (for-teachers primarily). This service integrates with the existing u...

We present a case study of implementing gamification in the Higher School for Information Technology and Information Systems of Kazan Federal University-the teaching department educating the new generation of ICT professionals. A special platform for gamification was developed. This platform includes a cloud service accessible through any sort of m...

We consider the Hidden Subgroup in the context of quantum Ordered Binary Decision Diagrams. We show several lower bounds for this function. In this paper we also consider a slightly more general definition of the hidden subgroup problem (in contrast to that in [KH10]). It turns out that in this case the problem is intractable for the quantum OBDD....

We study quantum computational complexity of several problems connected to the Hidden Subgroup Problem. This problem drew substantial attention when a polynomial-time quantum algorithm for it was found. The algorithm generalized the quantum algorithms for factoring integers and finding discrete logarithms. We consider the the problems in the contex...

Stronger upper bound for the Hidden Subgroup Problem for OBDD

We consider the problems of computing certain types of boolean functions which we call Equal-ity, Semi-Simon and Periodicity functions. For all these problems, we prove linear lower complexity bounds on oblivious Ordered Read-Once Quantum Branching Programs (quantum Ordered Binary Decision Diagrams). We present also two different approaches to prov...

We consider the Hidden Subgroup, and Equality-related problems in the context of quantum Ordered Binary Decision Diagrams. For the decision versions of considered problems we show polynomial upper bounds in terms of quantum OBDD width. We apply a new modification of the fingerprinting technique and present the algorithms in circuit notation. Our al...

Fololwing topics from the Thesis https://www.researchgate.net/publication/306460148_COMPLEXITY_BOUNDS_ON_SOME_FUNDAMENTAL_COMPUTATIONAL_PROBLEMS_FOR_QUANTUM_BRANCHING_PROGRAMS presented: Problems Classical Branching Prog. Quantum Branching Prog. The Problems of Interest Classical Branching Programs Quantum Branching Programs Why the functions Why B...

This presentation covers: Introduction to quantum computers Very short historical overwiew Qubits and unitary gates Motivation and background of the thesis research: Why Equality, Periodicity and Simon problems Why branching programs model Previous research on branching programs and Equality Quantum complexity of Equality, Simon and Periodicity The...

Boolean function representation by finite quantum automata