• ETRI Journal
• /
• v.11 no.1
• /
• pp.109-122
• /
• 1989

We developed new quadtree and octree representation schemes which reduce the storage requirements from exponential to polynomial. The new schemes not only lessen the large storage requirements of the existing quadtree and octree representation schemes but guarantee an exact representation of the original object. These are made possible by adopting a new set of termination conditions that ensure finiteness of the quadtree and octree during the decomposition. These new data structures are analyzed theoretically and tested empirically. For space complexity, we analyzed its best case, worst case, and average case. Given an $n_e$-gon, we show that the expected number of nodes in our quadtree isO($$$n_e^1.292$) For a polyhedron with $n_f$ faces, the expected number of nodes in the new octree is O($$$n_f^1.667$). For time complexity, we again analyzed the best, worst, and average cases for constructing such quadtree and octree and find the average to be the same as those of the space complexity. Finally, random $n_e$- gons are generated as test data. Regression equations are fitted and are shown to support the claims on the average case performance.

• Journal of Korea Society of Digital Industry and Information Management
• /
• v.9 no.4
• /
• pp.103-110
• /
• 2013

In Information Technology era, various amazing IT technologies, for example Big Data, are appearing and are available as the amount of information increase. The number of counselling for violation of personal data protection is also increasing every year that it amounts to over 160,000 in 2012. According to Korean Privacy Act, in the case of treating unique personal identification information, appropriate measures like encipherment should be taken. The technologies of encipherment are the most basic countermeasures for personal data invasion and the base elements in information technology. So various cryptography algorithms exist and are used for encipherment technology. Therefore studies on safer new cryptography algorithms are executed. Cryptography algorithms started from classical replacement enciphering and developed to computationally secure code to increase complexity. Nowadays, various mathematic theories such as 'factorization into prime factor', 'extracting square root', 'discrete lognormal distribution', 'elliptical interaction curve' are adapted to cryptography algorithms. RSA public key cryptography algorithm which was based on 'factorization into prime factor' is the most representative one. This paper suggests algorithm utilizing telescoping series as a safer cryptography algorithm which can maximize the complexity. Telescoping series is a type of infinite series which can generate various types of function for given value-the plain text. Among these generated functions, one can be selected as a original equation. Some part of this equation can be defined as a key. And then the original equation can be transformed into final equation by improving the complexity of original equation through the command of "FullSimplify" of "Mathematica" software.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.9
• /
• pp.3266-3285
• /
• 2014

With limited computing and storage resources, many network applications of encryption algorithms require low power devices and fast computing components. CHESS-64 is designed by employing simple key scheduling and Data-Dependent operations (DDO) as main cryptographic components. Hardware performance for Field Programmable Gate Arrays (FPGA) and for Application Specific Integrated Circuits (ASIC) proves that CHESS-64 is a very flexible and powerful new cipher. In this paper, the security of CHESS-64 block cipher under related-key differential cryptanalysis is studied. Based on the differential properties of DDOs, we construct two types of related-key differential characteristics with one-bit difference in the master key. To recover 74 bits key, two key recovery algorithms are proposed based on the two types of related-key differential characteristics, and the corresponding data complexity is about $2^{42.9}$ chosen-plaintexts, computing complexity is about $2^{42.9}$ CHESS-64 encryptions, storage complexity is about $2^{26.6}$ bits of storage resources. To break the cipher, an exhaustive attack is implemented to recover the rest 54 bits key. These works demonstrate an effective and general way to attack DDO-based ciphers.

• Journal of Korea Multimedia Society
• /
• v.25 no.2
• /
• pp.363-373
• /
• 2022

Multi-omics data is difficult to interpret due to the heterogeneity of information by the volume of data, the complexity of characteristics of each data, and the diversity of omics platforms. There is not yet a system for interpreting to visualize research data on environmental diseases concerning environmental harmful substances. We provide MEE, a web-based visualization tool, to comprehensively explore the complexity of data due to the interconnected characteristics of high-dimensional data sets according to exposure to various environmental harmful substances. MEE visualizes omics data of correlation between omics data, subjects and samples by keyword searches of meta data, multi-omics data, and harmful substances. MEE has been demonstrated the versatility by two examples. We confirmed the correlation between smoking and asthma with RNA-seq and Methylation-Chip data, it was visualized that genes (P HACTR3, PXDN, QZMB, SOCS3 etc.) significantly related to autoimmune or inflammatory diseases. To visualize the correlation between atopic dermatitis and heavy metals, we selected 32 genes related immune response by integrated analysis of multi-omics data. However, it did not show a significant correlation between mercury in blood and atopic dermatitis. In the future, should continuously collect an appropriate level of multi-omics data in MEE system, will obtain data to analyze environmental substances and diseases.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.6C
• /
• pp.539-546
• /
• 2010

In next generation wireless communication systems based on OFDM, multiple-input multiple-output (MIMO) technique is adopted in order to achieve high data throughput with limited bandwidth. As one of MIMO techniques, spatial multiplexing scheme needs high performance data detection algorithm that can be performed with low computational complexity. In this paper, we propose an algorithm that can compute QRM-MLD with reduced complexity. Also, hybrid detection technique is proposed, which can reduce the complexity by selecting between MMSE and QRM-MLD according to the channel condition. The proposed algorithm provides the trade-off between performance and complexity. The computer simulations for downlink transmission in 3GPP LTE system show that less than 0.1dB performance degradation can be achieved at 0.1% BER with 59% reduction on computational complexity compared with the conventional QRM-MLD algorithm.

• Journal of KIISE:Software and Applications
• /
• v.28 no.12
• /
• pp.910-920
• /
• 2001

We developed a SIFC(Slice-based Information Flow Graph) For modeling the information flow on program on the basis of the information flow of a data tokens on program slices. Then we defined a SCM(Slice-based Complexity Measure) for measuring the program complexity by measuring the complexity of information flow on SIFG, We showed that, according to Zuse's approach, it assumed ordinal scale based on atomic modifications on SIFG and that it was additive to binary operation MBSEQ and that it was not additive to binary operation MBALT but satisfied Weyuker's 9th axiom. Also based on comparison with the existing measures, we showed that SCM could measure not only the control and data flow in program but also the physical size of program.

• The KIPS Transactions:PartB
• /
• v.12B no.4 s.100
• /
• pp.451-458
• /
• 2005

The transcoding is a solution which is able to adapt to heterogeneous clients of requesting a different playback rate of multimedia data. Thus, The transcoding needs decoding and encoding. In general, previous studies to reduce complexity have a problem, the degradation of visual quality On the contrary, previous studies to reduce the degradation of visual quality lead to heavy computation. Thus, many researchers have studied a solution between the complexity and the degradation of visual quality. But until now, most researches of this region have dealt with the transcoder itself, such researches about a server's assistance to improve the performance of transcoder is rarely studied. In case of servicing multimedia data to heterogeneous clients which have low capabilities, the assistance of server side is able to reduce frames with processing in the transcoder and improve the performance of the transcoder. Thus in this paper, we propose the frame-skipping transcoder system architecture that takes into consideration transcoder and server side to reduce the complexity of the transcoder.

• Nuclear Engineering and Technology
• /
• v.54 no.10
• /
• pp.3682-3694
• /
• 2022

The expansion of a country's ecological footprint generates resources for economic development. China's import bill and carbon footprint can be reduced by investing in green transportation and energy technologies. A sustainable environment depends on the cessation of climate change; the current study investigates nuclear energy efficiency, economic complexity, air transportation, and industrial improvement for reducing environmental footprint. Using data spanning the years 1983-2016, the dynamic autoregressive distributed lag simulation method has demonstrated the short- and long-term variability in the impact of regressors on the ecological footprint. The study findings revealed that economic complexity in China had been found to have a statistically significant impact on the country's ecological footprint. Moreover, the industrial improvement process is helpful for the ecological footprint in China. In the short term, air travel has a negative impact on the ecological footprint, but this effect diminishes over time. Additionally, energy innovation is negative and substantial both in the short and long run, thus demonstrating its positive role in reducing the ecological footprint. Policy implications can be extracted from a wide range of issues, including economic complexity, industrial improvement, air transportation, energy innovation, and ecological impact to achieve sustainable goals.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 1998.06a
• /
• pp.3-8
• /
• 1998

The conversion of monoscopic video to 3D stereoscopic video has been studied by some pioneering researchers. In spite of the commercial of potential of the technology, two problems have bothered the progress of this research area: vertical motion parallax and high computational complexity. The former causes the low 3D perception, while the hardware complexity is required by the latter. The previous research has dealt with NTSC video, thur requiring complex processing steps, one of which is motion estimation. This paper proposes 3D stereoscopic conversion method of MPGE encoded data. Our proposed method has the advantage that motion estimation can be avoided by processing MPEG compressed data for the extraction of motion data as well as that camera and object motion in random in random directions can be handled.

• ETRI Journal
• /
• v.45 no.4
• /
• pp.557-569
• /
• 2023

Traditional deterministic channel modeling is accurate in prediction, but due to its complexity, improving computational efficiency remains a challenge. In an alternative approach, we investigated a multilayer artificial neural network (ANN) to predict large-scale and small-scale channel characteristics in metro tunnels. Simulated high-precision training datasets were obtained by combining measurement campaign with a ray tracing (RT) method in a metro tunnel. Performance on the training data was used to determine the number of hidden layers and neurons of the multilayer ANN. The proposed multilayer ANN performed efficiently (10 s for training; 0.19 ms for prediction), and accurately, with better approximation of the RT data than the single-layer ANN. The root mean square errors (RMSE) of path loss (2.82 dB), root mean square delay spread (0.61 ns), azimuth angle spread (3.06°), and elevation angle spread (1.22°) were impressive. These results demonstrate the superior computing efficiency and model complexity of ANNs.