65 research outputs found
Digital Transformation of the Insurance Business as a Factor in the Small Business and Private Entrepreneurship Digitalization
No full textAzimov, M. Mirsadikov. Digital transformation of the insurance business as a factor in the small business and private entrepreneurship (SBPE) digitalization. The current developing of market relations in Uzbekistan and the improvement of the quality of socio-economic services for businesses and the population of the country to the international standards level require the financial infrastructure of our country to provide a wider range of various services to individuals and legal entities. At the same time, the introduction of new financial instruments and services to overcome existing problems that are prerequisites for the emergence and increase of risks for market relations participants is of particular importance. The SBPE digitalization is significantly behind the insurance business digitalization, which is explained by a lack of knowledge about technologies, shortage of specialized personnel, lack of understanding of the prospects for the implementation of technologies, insufficient development of digital infrastructure and low level of demand for digital goods and services. The digital revolution the insurance business is currently undergoing is a unique opportunity to optimize all business processes, increase added value and generate additional profits. Using the resources of insurance company to improve the digital literacy of SBPE entities will contribute to both expanding the insurance field and increasing the efficiency of SBPE entities
The Perspective on IPO Placement: A Case Study of Insurance Companies in Uzbekistan
No full textThis article is dedicated to analyzing the process of Initial Public Offering (IPO) placement by insurance companies, examining its peculiarities and impact on the market. The study covers the key stages of preparing a company for an IPO, including assessing its financial stability, developing strategies for attracting investors, and ensuring compliance with regulatory requirements. Special attention is given to the specifics of the insurance sector, highlighting factors that influence the attractiveness of insurance companies to investors, such as risk management, capitalization levels, dividend policies, and projected returns. The article also addresses the challenges faced by insurance companies when entering the market, including the need to comply with stringent regulatory standards and ensure financial transparency. Examples of both successful and unsuccessful IPO placements in the insurance industry are analyzed, and recommendations for organizing an effective IPO process for insurance companies in Uzbekistan are provided
Context-Free Path Querying by Matrix Multiplication
No full textGraph data models are widely used in many areas, for example, bioinformatics,
graph databases. In these areas, it is often required to process queries for
large graphs. Some of the most common graph queries are navigational queries.
The result of query evaluation is a set of implicit relations between nodes of
the graph, i.e. paths in the graph. A natural way to specify these relations is
by specifying paths using formal grammars over the alphabet of edge labels. An
answer to a context-free path query in this approach is usually a set of
triples (A, m, n) such that there is a path from the node m to the node n,
whose labeling is derived from a non-terminal A of the given context-free
grammar. This type of queries is evaluated using the relational query
semantics. Another example of path query semantics is the single-path query
semantics which requires presenting a single path from the node m to the node
n, whose labeling is derived from a non-terminal A for all triples (A, m, n)
evaluated using the relational query semantics. There is a number of algorithms
for query evaluation which use these semantics but all of them perform poorly
on large graphs. One of the most common technique for efficient big data
processing is the use of a graphics processing unit (GPU) to perform
computations, but these algorithms do not allow to use this technique
efficiently. In this paper, we show how the context-free path query evaluation
using these query semantics can be reduced to the calculation of the matrix
transitive closure. Also, we propose an algorithm for context-free path query
evaluation which uses relational query semantics and is based on matrix
operations that make it possible to speed up computations by using a GPU.Comment: 9 pages, 11 figures, 2 table
A Comparative Study of Machine Learning Methods and Text Features for Text Authorship Recognition in the Example of Azerbaijani Language Texts
No full textThis paper presents various machine learning methods with different text features that are explored and evaluated to determine the authorship of the texts in the example of the Azerbaijani language. We consider techniques like artificial neural network, convolutional neural network, random forest, and support vector machine. These techniques are used with different text features like word length, sentence length, combined word length and sentence length, n-grams, and word frequencies. The models were trained and tested on the works of many famous Azerbaijani writers. The results of computer experiments obtained by utilizing a comparison of various techniques and text features were analyzed. The cases where the usage of text features allowed better results were determined
Оптимизация алгоритма поиска путей с контекстно-свободными ограничениями, основанного на произведении Кронекера
No full textГрафовые базы данных активно развиваются. Для выполнения запросов к ним используется теория формальных языков. В недавнем исследовании Арсения Терехова и др было показано, что алгоритмы, основанные на линейной алгебре, демонстрируют высокую производительность на реальных данных. Однако алгоритм, основанный на произведении Кронекера, обладает некоторыми недостатками. В этой работе предложены улучшение выявленных недостатков.Graph databases are actively developed. The theory of formal languages is used to execute queries to them. In a recent study by Arseniy Terekhov et al., it was shown that algorithms based on linear algebra demonstrate high performance on real data. However, the algorithm based on the Kronecker product has some deficiencies. In this work the identified deficiencies are corrected
Диагностика синтаксических ошибок в динамически формируемом коде
No full textИспользование встроенных языков затрудняет статическую диагностику ошибок, что снижает надёжность целевых систем. В рамках проекта YaccConstructor разрабатывается платформа для статического анализа динамически формируемого кода, алгоритм синтаксического анализа которой строит лес разбора для всех корректных цепочек, но игнорирует синтаксические ошибки. По этой причине её практическая применимость ограничена. В данной работе представлен алгоритм синтаксического анализа динамически формируемого кода, расширенный механизмом обнаружения ошибок. Доказана корректность модифицированного алгоритма и выполнена его реализация в проекте YaccConstructor.String-embedded languages complicate static error detection which reduces reliability of the target systems. The framework for static analysis of string-embedded languages is being developed in the research project YaccConstructor. The algorithm for parsing of dynamically generated code is implemented as a part of the framework. It constructs the parsing forest for all correct strings, but ignores syntactical errors which restricts the framework applicability. In this work, we present an algorithm for parsing of dynamically generated code, extended with error detection. Modified algorithm correctness is proved and it is implemented in the YaccConstructor project
- …
