• Proceedings of the Korea Multimedia Society Conference
• /
• 2002.11b
• /
• pp.613-616
• /
• 2002

본 논문은 OFDM의 Cyclic Prefix를 사용하여 적은 계산랑을 통해 보다 빠른 초기 시간동기획득을 구현하였다. QPSK 매핑 신호를 입력으로 하고 수신단에서 계산의 복잡도를 줄이기 위해 실수 부와 허수 부를 양자화를 하고 양자화된 신호를 이용하였다. 또한 양자화된 신호의 개수를 줄이는 방법으로 샘플링을 통해 기존의 상관성 알고리즘에 적용할 데이터 량을 줄였다. 즉, 계산량과 복잡도를 줄여 초기 시간 동기 획득률을 유지하면서 복잡도를 줄였다.

• Proceedings of the Korea Contents Association Conference
• /
• 2015.05a
• /
• pp.27-28
• /
• 2015

내러티브의 복잡도는 수용자의 이해와 흥미에 직접적으로 영향을 미치기 때문에 창작과정에서 체계적으로 관리되어야 한다. 본 논문에서는 내러티브 구성에 있어서의 지식 분배 작업에 초점을 맞추어 정보 엔트로피 개념을 활용한 복잡도 평가 방법을 개발하였다. 수용자의 지식상태 변화 과정에서 발생하는 정보량을 엔트로피로 계산하여 복잡도 척도로 활용하였다. 실제 영화 내러티브를 대상으로 사례 연구를 수행하였고, 본 방법이 내러티브의 구조적 특성과 전개과정에서의 변화를 효과적으로 반영함을 확인하였다.

• Proceedings of the Korean Statistical Society Conference
• /
• 2005.05a
• /
• pp.221-226
• /
• 2005

우리나라의 애국가(愛國歌), 일본(Kimigayo) 그리고 미국국가(The star-spangled Banner) 등에 대해서 악보가 갖는 고유정보를 카오스적 접근 방법인 근사엔트로피(approximate entropy)와 허스트(Hurst) 지수를 이용하여 각각 음계(scale)의 복잡도(複雜度)와 장기기억속성(長期 記憶 屬性)을 계산하여 비교하였던 바, 애국가가 상대적으로 복잡도에서 가장 높았으며, 세 국가 모두 장기 기억효과가 있는 것으로 나타났는데, 지속적인(persistent) 성향은 일본국가가 가장 컸다.

• Journal of KIISE:Computing Practices and Letters
• /
• v.16 no.4
• /
• pp.392-404
• /
• 2010

Recently, as both business processes and IT systems become ever more complex. Especially, enterprise applications tend to become unmanageably complex and increasingly costly to maintain. Therefore complexity is the insidious enemy of software development. It is critical to have a methodology that recognizes and manages this enemy effectively. In this paper, we propose ISIS (Integrated System of Independent Subsystems) - the architectural style needed to develop the complex enterprise applications. The ISIS was developed to meet the challenge of reducing the complexity of a larger enterprise application today. It gives us architecture models for reducing development complexity and composite application. The enterprise application is partitioned into a collection of independent subsystems using ISIS decomposition schemes and equivalence relations. We use middleware named ISIS engine that provides a service for subsystems interoperability by enabling the integration of distributed, cross-platform subsystems. We have implemented an ITSM system that achieves our objectives, reducing development complexity, using the ISIS architecture. Finally, ISIS architecture provides greater flexibility and productivity when an organization needs either to change its business processes, or to update the underlying systems.

• Journal of Broadcast Engineering
• /
• v.16 no.1
• /
• pp.133-143
• /
• 2011

In this paper, a complexity-balancing algorithm is proposed for distributed video coding based on entropy coding. In order to reduce complexity of DVC-based decoders, the proposed method employs an entropy coder instead of channel coders and the complexity-balancing method is designed to improve RD performance with minimal computational complexity. The proposed method performs motion estimation in the decoder side and transmits the estimated motion vectors to the encoder. The proposed encoder can perform more accurate refinement using the transmitted motion vectors from the decoder. During the motion refinement, the optimal predicted motion vectors are decided by the received motion vector and the predicted motion vectors and complexity load of block is allocated by adjusting the search range based on the difference between the received motion vector and the predicted motion vectors. The computational complexity of the proposed encoder is decreased 11.9% compared to the H.264/AVC encoder and that of the proposed decoder are reduced 99% compared to the conventional DVC decoder.

• Journal of the Korea Society of Computer and Information
• /
• v.17 no.6
• /
• pp.153-161
• /
• 2012

In this empirical study at the Web environment based on the frequency distribution of the cyclomatic complexity number of the application, the relevance of the threshold has been analyzed with the next two assumptions. The upper bound established by McCabe in the procedural programming equals 10 and the upper bound established by Lopez in the Java programming equals 5. Which numerical value can be adapted to Web application contexts? In order to answer this 10 web site projects have been collected and a sample of more than 4,000 ASP files has been measured. After analyzing the frequency distribution of the cyclomatic complexity of the Web application, experiment result is that more than 90% of Web application have a complexity less than 50 and also 50 is proposed as threshold of Web application. Web application has the complex architecture with Server, Client and HTML, and the HTML side has the high complexity 35~40. The reason of high complexity is that HTML program is usually made of menu type for home page or site map, and the relevance of that has been explained. In the near future we need to find out if there exist some hidden properties of the Web application architecture related to complexity.

• Journal of the Korea Society of Computer and Information
• /
• v.15 no.8
• /
• pp.117-126
• /
• 2010

Software complexity is used to evaluate a target system's maintainability. The existing complexity metrics on web applications are count-based, so it is hard to incorporate the understandability of developers or maintainers. To make up for this shortcomings, entropy-theory can be applied to define complexity, however, it is assumed that information quantity of each paper is identical. In this paper, structural complexity of a web application is defined based on information theory and similarity. In detail, the proposed complexity is defined using entropy as the previous approach, but the information quantity of individual pages is defined using similarity. That is, a page which are similar with many pages has smaller information quantity than a page which are dissimilar to others. Furthermore, various similarity measures can be used for various views, which results in many-sided complexity measures. Finally, several complexity properties are applied to verify the proposed metric and case studies shows the applicability of the metric.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.18 no.10
• /
• pp.2537-2543
• /
• 2014

Between tandem source-channel coding systems and joint source-channel coding systems, it has been known that there is a complexity threshold in complexity versus performance. In this paper, by expanding the previous analysis for equal error protection systems, we analyze and compare the performance under complexity constrains for tandem source-channel coding systems which employ unequal error protection. Under a given complexity constraint, the optimization is performed to minimize the end-to-end distortion of each representative tandem and joint source-channel coding system. The results show that the complexity threshold for unequal error protection systems becomes smaller and the performance enhancement of unequal error protection systems over equal error protection systems gets smaller as the system complexity gets larger.

• Journal of the Korea Society of Computer and Information
• /
• v.11 no.3
• /
• pp.281-289
• /
• 2006

Even though software developing environment has been changing to Web basis very fast, there are just few studies of quality metric or estimation model for Web software. In this study after analyzing the correlation between the risk level and property of objects using linear regression, six middle sized industrial system has been used to propose the correlation model of size and Number of Classes(NOC), size and Number of Methods(NOM), complexity and NOC, and complexity and NOM. Among of six systems 5 systems(except S06) have high correlation between size(LOC) and NOM, and four systems(except S04 & S06) have high correlation between complexity and NOC / NOM. As Web software architecture with three sides of Server, Client and HTML, complexity of each sides has been compared, two system(S04, S06) has big differences of each sides compleity values and one system(S06) has very higher complexity value of HTML, So the risk level could be estimated through NOM to improve maintenance in case of that the system has no big differences of each sides complexity.

• Proceedings of the IEEK Conference
• /
• 2000.11a
• /
• pp.141-144
• /
• 2000

PRML (partial response maximum-likelihood) 과 FDTS/DF (fixed-delay tree search with decision feedback)는 기록 저장 시스템에서 준최적의 성능을 보임이 잘 알려져 있다. 그러나, 위와 같은 정보열 검출 기법은 피할 수 없는 복잡도 문제를 가지고 있다. 본 논문은 최소 run 길이 제한조건 d=2를 가진 광기록 채널을 위한 다양한 저복잡도 검출 기법을 다룬다. 우선, 결정 궤환 기법을 이용한 이산 정합 여파기 (discrete matched filter with decision feedback：DMF/DF)가 기존의 PRML로부터 유도된다. 유도된 시스템은 PRML보다 결정 궤환에 의한 성능 이득을 갖는다. 또한, 메트릭 계산을 사용하지 않는 저복잡도 FDTS/DF가 유도된다. 모의실험 결과에 의하면, 유도된 저복잡도 검출 기법들은 기록 밀도 S>=5.5에서 P(D)=1+D+D/sup 2/+D/sup 3/의 target을 갖는 PRML보다 우수한 성능을 보인다.