• The Transactions of the Korean Institute of Electrical Engineers D
• /
• v.53 no.4
• /
• pp.258-264
• /
• 2004

This paper propose a method that GOP structure based on the picture complexity change realtime adaptive without pre-analysis or time delay. Proposed algorithm calculates the complexity of pictures at first, and the ratio of the complexity( X$\sub$p/ /X$\sub$i/) between P picture and I picture is calculated. The suitable M value for the three picture select by comparing with predetermined threshold. Used bit and vbv_delay the value of GOP is calculated according to selected M. Experimental results show that the prediction error is reduce than the fixed GOP structure. Since the complexity distribution of the sequence is different, applied limits of threshold value is changed, also.

• Magazine of the Korean Society of Agricultural Engineers
• /
• v.45 no.4
• /
• pp.89-97
• /
• 2003

Using inference models developed for estimation of the parameters necessary to implement the Runoff Block of the Stormwater Management Model (SWMM), a number of alternative inference scenarios were developed to assess the influence of inference model complexity and structure on the calibration of the catchment modelling system. These inference models varied from the assumption of a spatially invariant value (catchment average) to spatially variable with each subcatchment having its own unique values. Fur-thermore, the influence of different measures of deviation between the recorded information and simulation predictions were considered. The results of these investigations indicate that the model performance is more influenced by model structure than complexity, and control parameter values are very much dependent on objective function selected as this factor was the most influential for both the initial estimates and the final results.

• Journal of Internet Computing and Services
• /
• v.17 no.5
• /
• pp.59-65
• /
• 2016

Recently, a study has been progressed about the energy storage system for resolving energy shortage problems in the world. The energy storage system can maximize energy storage system's energy usage by monitoring and controlling about all energy infrastructures on energy network. However, compatibility problems among main components or devices of the energy storage system are obstacles to development of energy storage system products. An extensible profile and extensible profile verification software being able to verify the extensible profile have been required in order to resolve compatibility problems. In this paper, the study on complexity analysis for the extensible profile verification software for the energy storage system is performed. A XML based profile and C language structure based profile are used for analysis of the profile verification software. The complexity of complex verification structure that parses the XML based profile several times and simple verification structure that parses the C language structure based profile are analyzed and compared. Time complexity, space complexity, and cyclomatic complexity are used for complexity analysis. By using these complexity analysis, the study result that compares and analyzes the complexity of XML based and C language structure based profile verification software is presented.

• The Transactions of the Korea Information Processing Society
• /
• v.2 no.3
• /
• pp.335-342
• /
• 1995

In this pater, we present a syntactic software complexity measure based on program control structure using Petri Nets. Since control structure in program may be segregated by three structures such as sequence, condition and iteration structures, we are proposed a structured complexity measure based on program control structure after represented by Petri Nets. Finally, we compare our result with other measures of program complexity.

• Journal of the Korean Society for Precision Engineering
• /
• v.16 no.5 s.98
• /
• pp.132-144
• /
• 1999

In this study, the complexity of the product was evaluated quantitatively considering the product structure, assembly process and disassembly process. To evaluate the complexity of the product, subassemblies of automobile were analyzed and then characteristics of part and subassembly were determined according to product structure, assembly process and disassembly process. Evaluation criteria of complexity were determined considering each characteristics of part and subassembly. Experiential evaluation was accomplished by classified evaluation criteria and time-motion evaluation was accomplished by the relational motion factor with characteristics of part and subassembly in MTM(Methods Time Measurement) and WF(Work Factor). The total complexity of product was determined by experiential evaluation and time-motion evaluation.

• Journal of Korea Society of Industrial Information Systems
• /
• v.12 no.3
• /
• pp.19-30
• /
• 2007

In this paper, we propose low-complexity implementation of orthogonal frequency division multiple access (OFDMA) timing delay detector with multiple receive antennas for broadband wireless access (BWA). First, in order to reduce the computational complexity, the detection structure which rotates the phase of the received ranging symbols is introduced. Second, we propose the detection structure with the N-point/M-interval fast Fourier transform structure and a frequency-domain average-power estimator for complexity reduction without sacrificing the system performance. Finally, simulation results for the proposed structures and complexity comparison of the existing structure with the proposed detectors are presented.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.4
• /
• pp.1944-1956
• /
• 2016

The Digital Video Broadcasting-Common Scrambling Algorithm is an ETSI-designated algorithm designed for protecting MPEG-2 signal streams, and it is universally used. Its structure is a typical hybrid symmetric cipher which contains stream part and block part within a symmetric cipher, although the entropy is 64 bits, there haven't any effective cryptanalytic results up to now. This paper studies the security level of CSA against impossible differential cryptanalysis, a 20-round impossible differential for the block cipher part is proposed and a flaw in the cipher structure is revealed. When we attack the block cipher part alone, to recover 16 bits of the initial key, the data complexity of the attack is O(2^44.5), computational complexity is O(2^22.7) and memory complexity is O(2^10.5) when we attack CSA-BC reduced to 21 rounds. According to the structure flaw, an attack on CSA with block cipher part reduced to 21 rounds is proposed, the computational complexity is O(2^21.7), data complexity is O(2^43.5) and memory complexity is O(2^10.5), we can recover 8 bits of the key accordingly. Taking both the block cipher part and stream cipher part of CSA into consideration, it is currently the best result on CSA which is accessible as far as we know.

• Journal of the Korean Society of Costume
• /
• v.56 no.9 s.109
• /
• pp.1-13
• /
• 2006

The purpose of this study is to apply a concept of open structure to clothing design and to verify the characteristics found in the various types of clothing which has open structure. The literatures from various academic fields including philosophy, literature, social science, architecture, and fine arts are investigated to define the concept of openness and to analyze it from the perspectives both of the visual and of the moaning of openness. This paper is to identify the types and the characteristics of clothing by future intention, complexity, discontinuity of open structure. By closely examining fashion design after 1980s found in fashion collection publications and designer's websites, the results of this study are as follows: first, the concept of openness can be classified into two different levels, that is, visual and meaning, secondly, in clothing the concept of open structure is applied to the meaning side by future intention, by complexity and by discontinuity. Open structure through future Intention has new content and interpretation and must have the possibility of intelligence awakening, future guidance and basic contents. Open structure through complexity has secondary function exists concurrent with the shape key example is the smart clothes with the digital functions. It has functions of amusement, supplement and protective, and is future clothes which satisfies with health, welfare, desire of beauty. Open structure with discontinuity is clothes with dramatic changes in system, structures and states. Structure can be changed by silhouette, detail, or fabric, material, or dramatic and practical function as tools in terms of productions and environment. This study can help to formulate and to integrate the concept of open structure in clothing with various phases and enhance the value of clothes by showing an application of the concept of openness to the clothing in meaning level.

• Proceedings of the IEEK Conference
• /
• 2002.06b
• /
• pp.277-280
• /
• 2002

This paper analyze the characteristics of three multipliers in finite fields GF(2m) from the point of view of processing time and area complexity. First, we analyze structure of three multipliers; 1) LSB-first systolic array, 2) LFSR structure, and 3) CA structure. To make performance analysis, each multiplier was modeled in VHDL and was synthesized for FPGA implementation. The simulation results show that LFSR structure is best from the point of view of area complexity, and LSB systolic array is best from the point of view of processing time per clock.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.18 no.5
• /
• pp.695-707
• /
• 1993

Marked Petri Net(MPN) is used to analyze communication complexity with respect to the maximum number of concurrently active rendezvous. But, because it cannot represent timed & probability characteristics explicitly, it is not used to analyze the new execution time of complexity with respect to the communication. Thus to effectively analyze that execution time complexity, we propose Ada Tasking Structure Nets (ATSN) introduced restrictive conditions : net reduction rules, execution time, and probability. Finally, we show the powers of analyze of communication complexity with ATSN.