• Title/Summary/Keyword: Complexity measure

Search Result 307, Processing Time 0.029 seconds

Low Complexity Vector Quantizer Design for LSP Parameters

  • Woo, Hong-Chae
    • The Journal of the Acoustical Society of Korea
    • /
    • v.17 no.3E
    • /
    • pp.53-57
    • /
    • 1998
  • Spectral information at a speech coder should be quantized with sufficient accuracy to keep perceptually transparent output speech. Spectral information at a low bit rate speech coder is usually transformed into corresponding line spectrum pair parameters and is often quantized with a vector quantization algorithm. As the vector quantization algorithm generally has high complexity in the optimal code vector searching routine, the complexity reduction in that routine is investigated using the ordering property of the line spectrum pair. When the proposed complexity reduction algorithm is applied to the well-known split vector quantization algorithm, the 46% complexity reduction is achieved in the distortion measure compu-tation.

  • PDF

A Program Complexity Measure using the Slice-based Information Flow Graph(SIFG) (SIFG를 이용한 프로그램 복잡도 척도)

  • Choi, Wan-Kyoo;Chung, Il-Yong;Lee, Sung-Joo
    • 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.

  • PDF

Balanced bitrate control of multiple videos in transcoding for multi-view service

  • Gankhuyag, Ganzorig;Choe, Yoonsik
    • International Journal of Internet, Broadcasting and Communication
    • /
    • v.7 no.2
    • /
    • pp.168-172
    • /
    • 2015
  • In this paper, a balanced bitrate control in transcoding process based on video complexity measure for multi-view system which simultaneously shows multiple channels or video contents in single screen, is proposed. In order to consider the total quality of multiple video streams, the proposed algorithm reduces the complexity of multiple video stream and video quality differences at the same time by controlling bitrates of each stream by weighting when they are stitched for single screen. For the measure of complexity and quality differences between video streams, two different data: histogram of macroblock type and bitrate for each stream are used. The experimental result indicates that proposed algorithm decreases fluctuation of quality difference between videos in the multi-view system.

Software Component Metris for Complexity, Customizability, and Reusability (컴포넌트 복잡도, 특화성 및 재사용성 측정을 위한 메트릭)

  • 이숙희;조은숙
    • Journal of Internet Computing and Services
    • /
    • v.3 no.4
    • /
    • pp.71-82
    • /
    • 2002
  • Recently. component-based software development is getting accepted in industry as a new effective software development paradigm, Since an introduction of component-based software engineering(CBSE) at later 90's, the CBSD research has focused largely on component modeling, methodology, architecture and platform, However. as the number of components available on the market increases, it becomes more important to make metrics to measure the various characteristics of components. In this paper. we propose metrics for measuring the complexity, customizability, and resuability of software components, Complexity of metrics can be used to evaluate the complexity of components Customizability is used to measure how efficiently and widely the components can be customized for specific requirements organization, Resuability can be used to measure the degree of features that is reused in building applications.

  • PDF

Extraction of Aesthetic Measure from Various Stabilized Image (다양한 정지영상에서 미도값의 추출)

  • Shin, Seong-Yoon;Lee, Hyun-Chang;Rhee, Yang-Won
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.17 no.6
    • /
    • pp.1342-1347
    • /
    • 2013
  • Color harmony of Moon and Spencer is based on the Munsell color harmony theory. This harmony theory is established in the three of harmony and disharmony, the harmony of the area of effect, and Aesthetic Measure of harmony and disharmony. Aesthetic Measure here is how to obtain the quantitative expression of the degree of harmony. American scholar Burkhoff were analyzed with the proposition that beauty of Moon-Spencer is with the order in complexity. In this paper, the good and bad of coloration was divide elements of the order and the complexity. Aesthetic Measure is divided into elements of the complexity from elements of the order. This is utilized in the calculation shown in the various image, problem of color harmony and disharmony, which is treated as a sensibility was calculated by numerically. Thus Aesthetic Measure show was good or bad coloration by determining the color in the various image.

A Study on the Complexity Measurement of Architecture Assets (아키텍처 자산의 복잡도 측정에 관한 연구)

  • Choi, Han-Yong
    • Journal of Convergence for Information Technology
    • /
    • v.7 no.5
    • /
    • pp.111-116
    • /
    • 2017
  • In this paper, we propose a method to measure the complexity of assets when a software component is constructed as a basic asset, a standardized design model is acquired, and a reusable extended asset is designed based on the standardized design model. However, each asset of our proposed asset management system consists of composite assets that combine assets of two domains. So this method can not make accurate measurements. Therefore, the complexity of the overall asset can be measured by reflecting the property value of the basic asset stored under the architecture. In conclusion, it is possible to measure the composite-complexity of a composed asset that is inversely proportional to cohesion and proportional to the cumulative sum of the associated values of each asset in the asset-related design.

The Complexity of the Static Structures of Object-Oriented Systems by Analyzing the Class Diagram of UML (UML 클래스 다이어그램의 분석에 의한 객체지향 시스템의 정적 구조 복잡도 연구)

  • Chung, Hong;Hong, Dong-Kwon
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.14 no.6
    • /
    • pp.793-799
    • /
    • 2004
  • Many researches and validations for the complexity metrics of the object-oriented systems have been studied. Most of them are aimed for the measurement of the partial aspects of the systems, for example, the coupling between objects, the complexity of inheritance structures, the cohesion of methods, and so on. But the software practitioners want to measure the complexity of overall system, not partial. We studied the complexity of the overall structures of object-oriented systems by analyzing the class diagram of UML. The class diagram is composed of classes and their relations. There are three kinds of relations, association, generalization, and aggregation, which are making the structure of object-oriented systems to be difficult to understand. We proposed a heuristic metric to measure the complexity of object-oriented systems by putting together the three kinds of the relations. This metric will be helpful to the software developers for their designing tasks by evaluating the complexity of the structures of object-oriented system and redesigning tasks of the system.

Learning Behavior Analysis of Bayesian Algorithm Under Class Imbalance Problems (클래스 불균형 문제에서 베이지안 알고리즘의 학습 행위 분석)

  • Hwang, Doo-Sung
    • Journal of the Institute of Electronics Engineers of Korea CI
    • /
    • v.45 no.6
    • /
    • pp.179-186
    • /
    • 2008
  • In this paper we analyse the effects of Bayesian algorithm in teaming class imbalance problems and compare the performance evaluation methods. The teaming performance of the Bayesian algorithm is evaluated over the class imbalance problems generated by priori data distribution, imbalance data rate and discrimination complexity. The experimental results are calculated by the AUC(Area Under the Curve) values of both ROC(Receiver Operator Characteristic) and PR(Precision-Recall) evaluation measures and compared according to imbalance data rate and discrimination complexity. In comparison and analysis, the Bayesian algorithm suffers from the imbalance rate, as the same result in the reported researches, and the data overlapping caused by discrimination complexity is the another factor that hampers the learning performance. As the discrimination complexity and class imbalance rate of the problems increase, the learning performance of the AUC of a PR measure is much more variant than that of the AUC of a ROC measure. But the performances of both measures are similar with the low discrimination complexity and class imbalance rate of the problems. The experimental results show 4hat the AUC of a PR measure is more proper in evaluating the learning of class imbalance problem and furthermore gets the benefit in designing the optimal learning model considering a misclassification cost.

ESTIMATING THE OPERATOR'S PERFORMANCE TIME OF EMERGENCY PROCEDURAL TASKS BASED ON A TASK COMPLEXITY MEASURE

  • Jung, Won-Dea;Park, Jin-Kyun
    • Nuclear Engineering and Technology
    • /
    • v.44 no.4
    • /
    • pp.415-420
    • /
    • 2012
  • It is important to understand the amount of time required to execute an emergency procedural task in a high-stress situation for managing human performance under emergencies in a nuclear power plant. However, the time to execute an emergency procedural task is highly dependent upon expert judgment due to the lack of actual data. This paper proposes an analytical method to estimate the operator's performance time (OPT) of a procedural task, which is based on a measure of the task complexity (TACOM). The proposed method for estimating an OPT is an equation that uses the TACOM as a variable, and the OPT of a procedural task can be calculated if its relevant TACOM score is available. The validity of the proposed equation is demonstrated by comparing the estimated OPTs with the observed OPTs for emergency procedural tasks in a steam generator tube rupture scenario.

A Study of Cyclomatic Complexity for Web Application (웹 어플리케이션의 순환복잡도 메트릭스에 관한 연구)

  • An, Jong-Geun;Yu, Hae-Yeong
    • The KIPS Transactions:PartD
    • /
    • v.9D no.3
    • /
    • pp.447-456
    • /
    • 2002
  • Web applications haute different structural characteristics from conventional applications. A web application typically consists of server-side script elements which run on web sowers, client-side script elements which run on the client web-browser, link elements that the user clicks, and event elements that connect user-triggered request to the client script elements. These four elements are combined to form a web application. In such environments, direct application of conventional methods for measuring application complexity may not be possible, because they are primarily designed to measure complexity of modules and classes. In this paper, therefore, we propose metrics of Cyclomatic Complexity for Web Application (CCWA). We developed a tool to measure such metrics and applied it to the real-world examples. We found that the proposed CCWA metrics can be used for measuring complexity of highly complex web applications, which is not possible with conventional module and class based measurement techniques.