Gulzat Turken

Gulzat Turken

Auto-generated profile, based on publicly available information

Gulzat Turken

Kazakh National University Named After Al-Farabi (KazNU)

Research Focus & Metrics

Academic Career Length

4Years (2023-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 June 2024 in Indonesian Journal of Electrical Engineering and Computer Science
Verified
Journal Article
Open access
PDF file
TZTemirbekova Zhanerke
Temirbekova Zhanerke
TSTynymbayev Sakhybay
Tynymbayev Sakhybay
ZAZukhra Muratovna Abdiakhmetova
Zukhra Muratovna Abdiakhmetova
TGTurken Gulzat
Turken Gulzat
One of the new areas of cryptography considered-homomorphic cryptography. The article presents the main areas of application of homomorphic encryption. An analysis of existing developments in the field of homomorphic encryption carried out. The analysis showed that existing library implementations only allow processing bits or arrays of bits and do not support division and subtraction operations. However, to solve applied problems, support for performing integer operations are necessary. Because of the analysis, the need to implement the homomorphic division and subtraction operations identified, as well as the relevance of developing our own implementation of a homomorphic encryption library over integers. The ability to perform four operations (addition, difference, multiplication and division) on encrypted data will expand the areas of application of homomorphic encryption. A homomorphic division and subtraction methods proposed that allows the division operation performed on homomorphically encrypted data. An architecture for a library of fully homomorphic operations on integers is proposed. The library supports basic homomorphic operations on integers, as well as homomorphic division method. The article also provides measurements of the time required to perform certain operations on encrypted data and analyzes the efficiency of the developed implementation of the library.

4 May 2023
Verified
Conference Paper
Closed access
GTGulzat Turken
Gulzat Turken
VPVan Pey
Van Pey
ZAZukhra Abdiakhmetova
Zukhra Abdiakhmetova
ZTZhanerke Temirbekova
Zhanerke Temirbekova
With the popularization of the internet and the rapid development of science and technology, “online shopping” has become the norm in people's lives, and the e-commerce industry is booming, n addition, it has led to an increase in logistics. in today's business Wars, many companies strive for better development in enterprises of the same type, which continue to improve their information capabilities and level. This paper in order to solve the problems such as the increasing of massive data of e-commerce logistics and the phenomenon of data isolation in various business systems. The overall data warehouse is designed and constructed on the Hadoop cluster environment and data warehouse tool Hive is used to process data. Extraction of data from ETL, Sqoop and Flume tools is used for retrieving business data and log data and other aspects of ETL, we use Scala and Java to easily process and filter data and upload it to HDFS. The data warehouse is divided into levels and subject areas to simplify data management. Under the design of the entire system and data warehouse architecture, the conceptual, logical, and physical models of the data warehouse are developed and the star model is selected as a dimensional model. Finally, the application and implementation of data warehouse based on e-commerce logistics will be demonstrated. The development of a data warehouse based on e-commerce logistics not only ensures that e-commerce companies receive logistics information in a timely manner, but also forces decision makers to adjust logistics strategies in a timely manner based on data information, which can also improve user satisfaction and experience, and reduce costs.

4 May 2023
Verified
Conference Paper
Closed access
GTGulzat Turken
Gulzat Turken
LNLyazat Naizabayeva
Lyazat Naizabayeva
Maxatbek Nurgaliuly SatymbekovMaxatbek Nurgaliuly Satymbekov
Maxatbek Nurgaliuly Satymbekov
ZAZukhra Abdiakhmetova
Zukhra Abdiakhmetova
The data warehouse is based on the development of relational databases, parallel processing and distributed processing technologies, as well as online analytical processing technologies. SAP BW is widely used in many enterprise data warehouses. It can issue reports of enterprises at the group level, manage the group's business operations, help find the laws and trends behind the performance of corporations and ultimately provide decision-making support for decision makers of enterprises. Therefore, how to use the SAP BW model architecture to better realize enterprise data warehouses is one of the hot topics in the data warehouse industry today. For a large corporation, its branches and subsidiaries have deployed multiple sets of enterprise data warehouses. At the same time, because there are multiple sets of data warehouse systems, when the data model needs to be modified at the group level, the data model of the branch also needs to be modified accordingly, and the flexibility of maintenance is poor. Finally, every time the corporation needs to upgrade the version of the data warehouse, it needs to maintain and upgrade the version of the data warehouse of each branch and the maintenance cost is high. Therefore, how to integrate multiple sets of data warehouses distributed in various subsidiaries into a corporation enterprise data warehouse by designing the model hierarchy, so as to ensure the reliability of data, enhance the flexibility of model modification and reduce the cost of data warehouse. This paper completes the design of an enterprise data warehouse of a large corporation, which can be used for the summary and collation of data from multiple branches such as finance and sales of a corporation, effectively improving the efficiency of data utilization and ensuring the authenticity of data. At the same time, through hierarchical design, the problems of poor flexibility in model modification and high system maintenance costs are solved.

30 April 2024 in Eastern-European Journal of Enterprise Technologies
Verified
Journal Article
Open access
PDF file
LNLyazat Naizabayeva
Lyazat Naizabayeva
GTGulzat Turken
Gulzat Turken
ZAZukhra Muratovna Abdiakhmetova
Zukhra Muratovna Abdiakhmetova
TZTemirbekova Zhanerke
Temirbekova Zhanerke
Maxatbek Nurgaliuly SatymbekovMaxatbek Nurgaliuly Satymbekov
Maxatbek Nurgaliuly Satymbekov
The object of this study is a clustering algorithm using various technologies. This paper compares clustering algorithms that are more commonly used to analyze urban road network trajectories, the growth curve model, with the elbow method and the x-means algorithm. Experiments were conducted with various volumes of big data to determine calculation time, accuracy, and ways to increase calculation time. These results can be used to manage traffic jams in congested areas and city streets. Considering the widespread use of clustering algorithms for solving various problems, this study proposes to introduce GCM, SPGK methods for monitoring and analyzing the state of congestion on city roads. The work was carried out in the following steps: research and selection of methods based on efficiency and time, implementation of parallel computing technologies to improve computation speed, demonstration of the selected method based on collected data from a real city with visualization of the results. The growth curve model algorithm has been proven to be almost 5 times more effective than the elbow method and the x-means algorithm. The time allocated for data processing has been calculated. An increase in the volume of processed data showed an almost stable execution time t = 3 s for the GCM algorithm for data with a volume of up to almost 2,000 units. The effectiveness of SPGK-means was shown for different values of the number of points. Models of the Chengdu transport network obtained using a clustering algorithm with maximum grid density of neighborhoods are presented. There are some deviations between the grid and the road network due to the large grid size. This error is explained by an error of up to one between the points and the real grid. The results obtained clearly show how optimization of congested roads can be influenced. They provide information to obtain data on available routes, which allows you to analyze the road network individually and as a whole