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

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

• Information and Communications Magazine
• /
• v.29 no.5
• /
• pp.37-41
• /
• 2012

본고에서는 수많은 구성요소가 하나의 계를 이루면서 단순하지 않은 방식으로 서로 얽혀있는 상호작용을 하는 복잡계 연결망에서의 정보 확산에 관한 연구 동향을 살펴보고자 한다. 특히 복잡계 연결망 이론은 실생활에서 나타나는 다양한 연결구조와 이와 관련된 사회현상을 자연과학의 이론을 통해 분석 및 해석하는 분야로, 다양한 학제간의 융합연구로 각광받고 있다. 특히 복잡계 연결망의 최근 연구 결과를 비롯하여 실생활에 존재하는 다양한 대용량 자료를 활용한 사회 동역학과 정보 확산에 관한 최근 연구 동향 분석을 통해 재해의 확산 및 재난 상황에서의 행동 양상 형성 및 전파 등의 연구에 활용하고자 한다.

• 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.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.13 no.10
• /
• pp.4426-4431
• /
• 2012

Though polyrhythm is definitely a complex form of rhythm as we all know, some forms of polyrhythm(for example, '2 against 3' or '3 against 4') are considered as simple rhythm compared with others such as '5 against 4' or '7 against 4'. It is because this kind of polyrhythm might be used as often as enough to be able to be understood and to be played. However, the polyrhythm that we are talking about in this study(I'd like to call them as complex polyrhythm) is not able to be played by someone who is not familiar with quintuplets or septuplets. Here I would like to suggest a new way of playing polyrhythm, called the 'Simulation Method'. The main purpose of this method is to easily approach the complex polyrhythm by using its mathematical similarity even though these polyrhythms are originally hard to be played due to its mathematical complexity.

• The KIPS Transactions:PartD
• /
• v.11D no.4
• /
• pp.865-872
• /
• 2004

Web applications have different structural characteristics from conventional applications with the structural language or object-oriented language or 4GL. A web application typically consists of server-side script elements which run on web sewers, client-side script elements which run on the client web-browser, HTML elements that contains context. Therefore web applications developer concurrently uses 3 or more development language. Cyclomatic Complexity for Web Application(CCWA) metrics reflected composite complexity of each element. In this paper, we applied cyclomatic complexity for web application metrics with Complexity level indicator to web application. We applied it to 10 web applications that were developed in practical business. High complexity web applications classify into four type(MENU, FORM, CTRL, GEN). This paper has contributed to practical use of engineering approach for web application.

• 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 Digital Convergence
• /
• v.15 no.8
• /
• pp.127-135
• /
• 2017

Consumers tend to feel concern about disclosure of personal information and, at the same time, to avoid inconvenience of procedural complexity caused by the privacy protections. The purpose of current paper is to investigate relationships between opt-in procedural complexity and shopping behavior using smart phones, moderating by the amount of visual attentions using eyetrackers. Therefore, we created a virtual mobile Web-site in which the complexity of opt-in procedures in our experiment is manipulated and measured. Also, we measured the dwell-time of area of interest using SMI-RED 250 instrument for tracking the real eye movement. Results indicated that the levels of procedural complexity are related to repurchase, indicating a moderating effect of the amount of visual attentions. Finally, we discussed several theoretical and practical implications of management for mobile commerce.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.12C
• /
• pp.1164-1174
• /
• 2007

Antenna selection based MIMO schedulers are proposed to achieve the optimal performance with low complexity in uplink multiuser MIMO/FDD system. In this paper, three heuristic schedulers are proposed to approach the optimal performance which is achieved by the optimal Brute-Force Scheduler. Two search methods called sub-set and full-set way are also discussed to set up the antenna channels to be the candidates of the scheduler. Simulation results show that the sum rate and BER performance of the proposed CSS and SOAS schemes are about the same to that of the brute-force scheduler with affordable complexity, while RC-SOAS with further reduced complexity achieves almost the optimal performance in the case of small number of antennas. Moreover, the complexity can be additionally reduced by the sub-set search method when the number of transmit and receive antennas are 2 respectively, which is applicable in the realistic systems.

• 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.