• International Journal of Computer Science & Network Security
• /
• v.24 no.1
• /
• pp.178-186
• /
• 2024

While in high-income countries the development of digital technology began in the 1970s, in low- and middle-income countries it began in the 1990s and even after 2005, due to the political regime that constrained economic development and innovation. At the same time, there are no studies of the relationship between technological development and structural changes through innovation in low- and middle-income countries. The article aims to quantify the relationship of the introduction of digital technologies on innovation, structural transformation of low- and middle-income economies. The industrial-agrarian economy of Uzbekistan with an authoritarian regime is in a state of transition to a market economy, while in Ukraine, there are active processes of Europeanization and integration into the EU. Ukraine's economy is commodity-based (the export of raw materials of industries and the agricultural sector in developed countries predominates) and industrial-agrarian. Digital technologies and the service sector are little developed in Uzbekistan. On the other hand, Ukraine has a more developed ICT sector. Uzbekistan is gradually undergoing an innovative and structural transformation of the economy: the productivity of the agricultural, industrial, and service sectors is growing, but the ICT sector is virtually undeveloped. In comparison, in Ukraine, there are no significant structural transformations due to a significant drop in productivity of the industrial sector, with stable growth of productivity of the agricultural sector due to technology and a slight increase in productivity of the service sector. It is revealed that Ukraine and Uzbekistan have undergone structural transformations of the economy in favor of the service sector, while the agricultural and industrial sectors produce less and less. If Uzbekistan remains the industrial-agrarian country with an aggregate share of the added value of these sectors 59% in 2019, Ukraine transits to the post-industrial type of economy where the added value of the service sector in GDP grows (55% compared to agrarian and industrial sectors at 42%).

• Journal of Korea Multimedia Society
• /
• v.17 no.9
• /
• pp.1070-1075
• /
• 2014

Due to a number of illegal copied videos, many video content markets have been threatened. Since this copied videos have intercepted the profits of the content holders, content developers lose the will to generate new contents. Therefore, video copy detection approaches have been developed to protect the copyrights of video contents. However, many illegal uploader who generate copied videos used video transformations to avoid video copy detection systems. Among of the video transformations, rotation and flipping did not distorted the quality of video contents. Thus, these two video transformations were adopt to generate copied video. In order to detect rotated or flipping copy videos, rotation and flipping robust region binary pattern (RFR) recently was proposed. But, this RFR has a weakness according to rotated angles. Therefore, in order to overcome this problem, multi region binary patterns are proposed in this paper. The proposed method has the similar performance with the original RFR. But, it showed much higher efficiency for memory spaces.

• The Transactions of the Korea Information Processing Society
• /
• v.2 no.6
• /
• pp.831-838
• /
• 1995

Geometric transformations require many operations in displaying moving 3D objects on the screen and a fast computation is a important problem in CAD or animation applications. The general method to compute the transformation coordinates of an object represented by an octree must perform the operations on every node. This paper proposes an efficient method that computes the rectangular coordinates of the vertices of the octree nodes into the coordinates of the universe space using the basicvectors in order to compute quickly geometric transformations of 3D images represented by an octree. The coordinates of the vertices of each octant are computed by using the formula presented here, which requies additions and multiplications by powers of 2. This method has a very fast execution time and is compared with the general computation method.

• Journal of Electrical Engineering and Technology
• /
• v.10 no.4
• /
• pp.1886-1898
• /
• 2015

In today’s era of advanced technological developments, the threats to the authenticity and integrity of digital images, in a nutshell, the threats to the Image Forensics Research communities have also increased proportionately. This happened as even for the ‘non-expert’ forgers, the availability of image processing tools has become a cakewalk. This image forgery poses a great problem for judicial authorities in any context of trade and commerce. Block matching based image cloning detection system is widely researched over the last 2-3 decades but this was discouraged by higher computational complexity and more time requirement at the algorithm level. Thus, for reducing time need, various dimension reduction techniques have been employed. Since a single technique cannot cope up with all the transformations like addition of noise, blurring, intensity variation, etc. we employ multiple techniques to a single image. In this paper, we have used Fuzzy logic approach for decision making and getting a global response of all the techniques, since their individual outputs depend on various parameters. Experimental results have given enthusiastic elicitations as regards various transformations to the digital image. Hence this paper proposes Fuzzy based cloning detection and classification system. Experimental results have shown that our detection system achieves classification accuracy of 94.12%. Detection accuracy (DAR) while in case of 81×81 sized copied portion the maximum accuracy achieved is 99.17% as regards subjection to transformations like Blurring, Intensity Variation and Gaussian Noise Addition.

• Journal of Computing Science and Engineering
• /
• v.3 no.1
• /
• pp.27-58
• /
• 2009

Aggregation join queries are an important class of queries over data streams. These queries involve both join and aggregation operations, with window-based joins followed by an aggregation on the join output. All existing research address join query optimization and aggregation query optimization as separate problems. We observe that, by putting them within the same scope of query optimization, more efficient query execution plans are possible through more versatile query transformations. The enabling idea is to perform aggregation before join so that the join execution time may be reduced. There has been some research done on such query transformations in relational databases, but none has been done in data streams. Doing it in data streams brings new challenges due to the incremental and continuous arrival of tuples. These challenges are addressed in this paper. Specifically, we first present a query processing model geared to facilitate query transformations and propose a query transformation rule specialized to work with streams. The rule is simple and yet covers all possible cases of transformation. Then we present a generic query processing algorithm that works with all alternative query execution plans possible with the transformation, and develop the cost formulas of the query execution plans. Based on the processing algorithm, we validate the rule theoretically by proving the equivalence of query execution plans. Finally, through extensive experiments, we validate the cost formulas and study the performances of alternative query execution plans.

• Journal of the Korean Institute of Telematics and Electronics C
• /
• v.36C no.3
• /
• pp.1-7
• /
• 1999

In this research, transformation-based optimization techniques for pipelined designs have been developed. The transformation-based optimization techniques include pipelined architecture transformations and retiming transformations. The new transformation method has the following three features. First, the overall performance of a pipelined system is optimized owing to various transformations including retiming of multiple pipelined blocks. Second, these techniques can be used to search a large solution space by allowing efficient exploration of trade-offs between area and performance. Third, these techniques can be easily extended to a new transformation or algorithm and can be used to optimize memory or bus architectures. Experimental results illustrate that these transformation-based optimization techniques improve area by 21% and performance by 17% on the average for a set of pipelined designs. Especially, the techniques are useful to efficiently explore a large design space.

• The Bulletin of The Korean Astronomical Society
• /
• v.35 no.2
• /
• pp.39.1-39.1
• /
• 2010

We study the effects of the cluster environment on galactic morphology by defining a dimensionless angular momentum parameter ld, to obtain a quantitative and objective measure of galaxy type. The use of this physical parameter allows us to take the study of morphological transformations in clusters beyond the measurements of merely qualitative parameters, e.g. S/E ratios, to a more physical footing. To this end, we employ an extensive SDSS sample, with galaxies associated with Abell galaxy clusters. The sample contains 93 relaxed Abell clusters and over 34,000 individual galaxies. We find that the median ld value tends to decrease as we approach the cluster center, with different dependences according to the mass of the galaxies and the hosting cluster; low and intermediate mass galaxies showing a strong dependence, while massive galaxies seems to show, at all radii, low ld values. By analysing trends in ld as functions of the nearest galactic neighbour environment, clustercentric radius and velocity dispersion of clusters, we can identify clearly the leading physical processes at work. We find that in massive clusters (s > 700 km/s), the interaction with the cluster central region dominates, whilst in smaller clusters galaxy-galaxy interactions are chiefly responsible for driving galactic morphological transformations.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.47 no.2
• /
• pp.51-59
• /
• 2010

Two logic transformations, De Morgan and re-substitution, are sufficient to convert a unate gate network (UGN) to a more general balanced inversion parity (BIP) network. Circuit classes of interest are discussed in detail. We prove that De Morgan and re-substitution transformations are test-set preserving for path delay faults. Using the results of this paper, we can easily show that a high-level test set for a function z that detects all path delay faults in any UGN realizing z also detects all path delay faults in any BIP realization of z.

• Communications for Statistical Applications and Methods
• /
• v.30 no.2
• /
• pp.163-178
• /
• 2023

GARCH-X(1, 1) model specifies that conditional variance follows an AR(1) process and includes a past exogenous variable. This study proposes a new class from that model by allowing a more general (non-linear) variance function to follow an AR(1) process. The functions applied to the variance equation include exponential, Tukey's ladder, and Yeo-Johnson transformations. In the framework of normal and student-t distributions for return errors, the empirical analysis focuses on two stock indices data in developed countries (FTSE100 and SP500) over the daily period from January 2000 to December 2020. This study uses 10-minute realized volatility as the exogenous component. The parameters of considered models are estimated using the adaptive random walk metropolis method in the Monte Carlo Markov chain algorithm and implemented in the Matlab program. The 95% highest posterior density intervals show that the three transformations are significant for the GARCHX(1, 1) model. In general, based on the Akaike information criterion, the GARCH-X(1, 1) model that has return errors with student-t distribution and variance transformed by Tukey's ladder function provides the best data fit. In forecasting value-at-risk with the 95% confidence level, the Christoffersen's independence test suggest that non-linear models is the most suitable for modeling return data, especially model with the Tukey's ladder transformation.

• Proceedings of the Korean Magnestics Society Conference
• /
• 2007.05a
• /
• pp.11.1-11.1
• /
• 2007