George Pashev

Website of George Pashev (Jidai Mirai)

Scientist, Programmer, Data Scientist, Enterpreneur

ДИНАМИЧНО ОПРЕДЕЛЯНЕ НА ПЕРСОНАЛИЗИРАНИ УЧЕБНИ ПЪТИЩА

 

 

динамично ОПРЕДЕЛЯНЕ
на ПЕРСОНАЛИЗИРАНИ УЧЕБНИ ПЪТИЩА

Георги Пашев, Георги Тотков

ПУ „Паисий Хилендарски“, georgepashev@gmail.com

ПУ „Паисий Хилендарски“, totkov@uni-plovdiv.bg

Резюме: В работата се представя софтуерно приложение, осигуряващо персонално и адаптивно електронно обучение. За всеки учебен план приложението съхранява и поддържа данни – примери за неговото изпълнение (спец. пътищата за постигане на учебните цели от различни обучавани). На конкретен обучаван се предлага учебен път за по-ефективно усвояване на учебното съдържание на базата на откриване на сходство с данните за вече приключилите своето обучение. Реализацията използва авторска система за управление на графови бази данни.

Ключови думи: план за обучение, предсказване, път в граф, адаптивно обучение, машинно обучение

Линк към публикацията: http://sci-gems.math.bas.bg/jspui/handle/10525/2389

 


Process Definition and Control in EMSG Complex Work-flow Management System Using Process Graphs and Data Addressing in a File with Flow Identifier Operator

Process Definition and Control in EMSG Complex Work-flow Management System Using Process Graphs and Data Addressing in a File with Flow Identifier Operator

 

Georgi Pashev(1) and Ivan Kodinov(2) and Georgi Totkov(3)

 

(3): University of Plovdiv “Paissi Hilendarski”, Tzar Assen Str.24, BG-4000 Plovdiv

 

(1, 2): Dextro Research Ltd., Prezviter Kozma Str. 3, BG-4000

 

e-mail(3): totkov@uni-plovdiv.bg

e-mail(1): georgepashev@gmail.com

e-mail(2): ivankodinov@gmail.com

 

 

Abstract

In the context of this WfMS, a File is a sequence of Steps, ordered, according to applicable Process Graphs. Processes, defined by Developer Defined Process Graphs represent the connections between different steps and the sequence in which they may appear in the work-flow. Sub-processes are used to differentiate separate work cycles and can be nested inside standard processes. Midstream processes are system processes which cover the work-flow process. All processes, except midstream processes, contain a marker class. A step can be included in a process even if it does not have the marker class, if one of its satellite steps use it. Sub-processes are used to differentiate separate work cycles and can be nested inside standard processes or other sub-processes. A Process Instance is an actual sequence of steps. A Flow Identifier is a n-tuple of the following: step identifier, class identifier, assortment, radius, row and column.

 

Type: Conference Paper

Conference: "Days of Science 2013Union of Scientists in Bulgaria - Plovdiv

Линк към публикацията: https://www.dropbox.com/s/f5h4gcs4esbjrlj/Doc%20Apr%2027%2C%202016%2C%2005_06.pdf?dl=0

Demo available here.

SOFTWARE PLATFORM FOR EXECUTION OF GRAPH DATABASE APPLICATIONS

 

SOFTWARE PLATFORM FOR EXECUTION OF GRAPH DATABASE APPLICATIONS

 

Type of publication:  Conference paper

Conference: ICTTE 2013

 

Georgi Pashev, Dilyana Budakova

Dextro Research Ltd.

Pr. Kozma Str. 4000, Plovdiv, Bulgaria, +035(9) 895/662140, e-mail: georgepashev@gmail.com

Technical University Sofia, Plovdiv Branch

25 Tsanko Diustabanov St., Plovdiv, 4000 Bulgaria, +035(9) 32/659 727, e-mail: dilyana_budakova@yahoo.com

 

Main characteristics of the software platform are: 1. Fully transactional; 2. Supports formalism called labelled directed attributed hypergraph; 3. Users management, sessions, transactions are separated by the transport system, so that different transport system can be used in future; 4. Its own procedural language for definition of triggers and user scripts; 5. Type definition subsystem, which supports class object-like hierarchy structures, arrays definitions, simple types aliases definitions.

GDBMS is designed and implemented to support Graph Database formalism called Directed, labelled hyper-graph, which increases the power of the set of applicable tasks which can be solved by such a system. In mathematics, a hypergraph is a generalization of a graph in which an edge can connect any number of vertices.[4] More efficient disk usage is also achieved by using the formalism: 2 or more edges can be represented as 1 hyper-edge.[6] User types can be user defined structures, arrays or simple type aliases for integers or strings.

Scripting language for direct execution GDBMS has been created. It has suitable built-in API for accessing to the functionality of our pройects' own Graph Database Management System. Definition of user-defined macros is enabled. The implemented user language is procedural. The language syntax has operators for trigger definition. Supported triggers are after insert/delete/update on edges/nodes; before/after creation/destruction of user session/ user transaction. New method for data addressing through flow identifier has been developed.

The transactional subsystem is quite sophisticated unlike the transactional subsystems of other lookalike graph database systems. It insures that only those edges or nodes, which have been added or altered by the transaction are in the transactional folder and/or locked by the transaction. Information about the transaction history is maintained, and when transaction close command is received, some edge/node operations dependencies are resolved and handled: Insert after update, update after insert, update after update, for example.

Keywords: graph, database, hyper-graph, transactional, procedural, language.

Линк към публикацията: https://sites.google.com/a/trakia-uni.bg/artte/articles/artte-vol-1-no-2

https://sites.google.com/a/trakia-uni.bg/artte/articles/artte-vol-1-no-2/Georgi%20Pashev%2C%20Dilyana%20Budakova.%20SOFTWARE%20PLATFORM%20FOR%20EXECUTION%20OF%20GRAPH%20DATABASE%20APPLICATIONS.pdf?attredirects=0&d=1