<?xml version="1.0" encoding="UTF-8"?>
<feed xmlns="http://www.w3.org/2005/Atom" xmlns:dc="http://purl.org/dc/elements/1.1/">
  <title>DSpace Фонд:</title>
  <link rel="alternate" href="https://repository.hneu.edu.ua/handle/123456789/140" />
  <subtitle />
  <id>https://repository.hneu.edu.ua/handle/123456789/140</id>
  <updated>2026-06-02T16:38:42Z</updated>
  <dc:date>2026-06-02T16:38:42Z</dc:date>
  <entry>
    <title>Neuro-symbolic Formal Verification of Culinary instructions via ontology-grounded constraint satisfaction</title>
    <link rel="alternate" href="https://repository.hneu.edu.ua/handle/123456789/40270" />
    <author>
      <name>Shaposhnyk M. V.</name>
    </author>
    <author>
      <name>Minukhin S. V.</name>
    </author>
    <id>https://repository.hneu.edu.ua/handle/123456789/40270</id>
    <updated>2026-06-02T10:40:58Z</updated>
    <published>2026-01-01T00:00:00Z</published>
    <summary type="text">Назва: Neuro-symbolic Formal Verification of Culinary instructions via ontology-grounded constraint satisfaction
Автори: Shaposhnyk M. V.; Minukhin S. V.
Короткий огляд (реферат): This study proposes the «Formal-of-Thought» (FoT) approach—an architecture that shifts artificial intelligence from passive generation to active formal verification using the FoodOn ontology. FoT uses large language models (LLMs) as a specification compiler, «mapping» DenseNet-121 features to FoodOn proofs using the «Retrieval-Augmented Generation» method. Safety constraints are formulated as logical predicates, and compliance with them is verified using an SMT solver.</summary>
    <dc:date>2026-01-01T00:00:00Z</dc:date>
  </entry>
  <entry>
    <title>Integration of large language models and sensor data in recommendation systems for personalized physiological and dietary monitoring</title>
    <link rel="alternate" href="https://repository.hneu.edu.ua/handle/123456789/40269" />
    <author>
      <name>Minukhin S. V.</name>
    </author>
    <author>
      <name>Khaustov D. A.</name>
    </author>
    <id>https://repository.hneu.edu.ua/handle/123456789/40269</id>
    <updated>2026-06-02T10:42:22Z</updated>
    <published>2026-01-01T00:00:00Z</published>
    <summary type="text">Назва: Integration of large language models and sensor data in recommendation systems for personalized physiological and dietary monitoring
Автори: Minukhin S. V.; Khaustov D. A.
Короткий огляд (реферат): This study proposes the «Formal -of-Thought» (FoT)—an architecture that shifts artificial intelligence from passive generation to  active formal reasoning. This approach uses the Health-LLM principle to convert numerical sensor data in the form of time series into textual descriptions based on an individual user profile. It combines this with the PHIA agent, which  utilizes multi-step ReAct reasoning, Python code generation (Pandas), few-shot learning via embedded sentence-T5 and K-means clustering, as well as the GPT-4 Text -to-SQL method with few-shot learning and RAG for heterogeneous data.</summary>
    <dc:date>2026-01-01T00:00:00Z</dc:date>
  </entry>
  <entry>
    <title>Minimization of total task tardiness using a ranking-based method with sorting rules</title>
    <link rel="alternate" href="https://repository.hneu.edu.ua/handle/123456789/40267" />
    <author>
      <name>Minukhin S. V.</name>
    </author>
    <id>https://repository.hneu.edu.ua/handle/123456789/40267</id>
    <updated>2026-06-02T10:42:12Z</updated>
    <published>2026-01-01T00:00:00Z</published>
    <summary type="text">Назва: Minimization of total task tardiness using a ranking-based method with sorting rules
Автори: Minukhin S. V.
Короткий огляд (реферат): This paper proposes a model of general tardiness in task execution based on a graph G, in which each vertex corresponds to a task, and each edge (i, j) is characterized by a weight Tj = max(0, Cj − dj), where Cj denotes the completion time and dj denotes the execution time of task j. A distinctive feature of this problem is that the weights of the graph’s edges emanating from an arbitrary vertex Ji are not constant values but depend on the order in which the vertices leading to vertex Ji are traversed, since this determines the value of Cj, which is defined as the sum of the durations of the operations preceding the execution of operation Ji. This problem can be reduced to finding the shortest Hamiltonian path in the graph. A method is proposed to solve this problem based on randomly determining the initial order of the vertices in the graph.</summary>
    <dc:date>2026-01-01T00:00:00Z</dc:date>
  </entry>
  <entry>
    <title>Технологія Django у системах електронної комерції</title>
    <link rel="alternate" href="https://repository.hneu.edu.ua/handle/123456789/40259" />
    <author>
      <name>Білоус А. В.</name>
    </author>
    <author>
      <name>Карпенко М. Ю.</name>
    </author>
    <id>https://repository.hneu.edu.ua/handle/123456789/40259</id>
    <updated>2026-06-02T08:58:19Z</updated>
    <published>2026-01-01T00:00:00Z</published>
    <summary type="text">Назва: Технологія Django у системах електронної комерції
Автори: Білоус А. В.; Карпенко М. Ю.
Короткий огляд (реферат): У роботі проведено порівняльний аналіз фреймворку Django з альтернативними платформами веб-розробки за критеріями функціональності, безпеки, швидкості створення застосунків та підтримки баз даних. На основі результатів порівняння обґрунтовано доцільність використання Django для розробки систем електронної комерції. Показано, що Django є ефективною платформою для створення сучасних систем електронної комерції в умовах цифровізації бізнесу та нестабільного середовища.</summary>
    <dc:date>2026-01-01T00:00:00Z</dc:date>
  </entry>
</feed>

