• MALSORI
• /
• no.52
• /
• pp.101-110
• /
• 2004

This paper proposes a new confidence measure for utterance verification with posterior probability approximation. The proposed method approximates probabilistic likelihoods by using Viterbi search characteristics and a clustered phoneme confusion matrix. Our measure consists of the weighted linear combination of acoustic and phonetic confidence scores. The proposed algorithm shows better performance even with the reduced computational complexity than those utilizing conventional confidence measures.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.15 no.6
• /
• pp.780-787
• /
• 2005

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. Tn analyze the complexity of the structure of a object-oriented system for the maintainability of the system, we measured the degree of understandability of it, the reverse engineering time to draw a class diagram from the source codes, and the number of errors in the diagram. The results of this experiment shows that our proposed metric has a considerable relationship with the complexity of object-oriented systems. The metric will be helpful to the software developers for their designing tasks by evaluating the complexity of the structures of object-oriented systems and redesigning tasks , of them for the future maintainability.

• 한국HCI학회:학술대회논문집
• /
• 2006.02a
• /
• pp.931-936
• /
• 2006

This paper presents different issues of the real-time compression algorithms without compromising the video quality in the distributed environment. The theme of this research is to manage the critical processing stages (speed, information lost, redundancy, distortion) having better encoded ratio, without the fluctuation of quantization scale by using IP configuration. In this paper, different techniques such as distortion measure with searching method cover the block phenomenon with motion estimation process while passing technique and floating measurement is configured by discrete cosine transform (DCT) to reduce computational complexity which is implemented in this video codec. While delay of bits in encoded buffer side especially in real-time state is being controlled to produce the video with high quality and maintenance a low buffering delay. Our results show the performance accuracy gain with better achievement in all the above processes in an encouraging mode.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.22 no.4
• /
• pp.675-684
• /
• 1997

The bit rate control algorithm which is capable of handing scene change is proposed. In MPEG-2 TM5, block variance is used to measure block activity. But block variance is not consistent with human visual system and does not differenciate the distribution of pixel values within the block. In target bit allocation process of TM5, global complexity, obtained by results of previous coded pictures, is used. Since I pictures are spaced relatively far apart, their complexity estimate is not very accurate. In the proposed algorithm local variance is used to measure block activity and detect scene change. Local variance, using deviation from the mean of neighboring pixels, well represents the distribution of pixel values within the block. If scene change is detected, the local variance information is used for target bit allocation process. Allocating target bits for I picture, the average local variance difference between previous and current I picture is considered. The experimental results show that the proposed algorithm can detect scene change very precisely and gives better picture quality and higher PSNR values than MPEG-2 TM5.

• Journal of applied mathematics & informatics
• /
• v.29 no.1_2
• /
• pp.119-133
• /
• 2011

This paper proposes an infeasible interior-point algorithm with full-Newton step for linear programming. We introduce a special self-regular proximity to induce the feasibility step and also to measure proximity to the central path. The result of polynomial complexity coincides with the best-known iteration bound for infeasible interior-point methods, namely, O(n log n/${\varepsilon}$).

• Journal of KIISE:Software and Applications
• /
• v.26 no.11
• /
• pp.1282-1287
• /
• 1999

통신 프로그램은 고도의 신뢰성과 기능성, 확장성, 그리고 유지 보수성이 필요하다. 프로그램 테스트의 결과와 McCabe의 Complexity를 측정한 데이타를 가지고 회귀모델을 만들고 그 신뢰성을 분석함으로서 프로그램의 결함과 복잡도의 관련성을 평가한다.본 연구에서 사용한 통신 프로그램은 500개 블록이 59가지 기능을 수행하는 교환 기능 중에서 복잡도가 너무 많아서 통계 처리의 bias가 될 블록을 제외하고 394 블록을 선정하여 SAS에 의해서 통계 분석을 하고 회귀 분석 모델을 설계하였다. t 분포에 의하여 방정식의 유의성 수준을 검증하고 프로그램의 결함수에 가장 큰 영향을 주고 있는 복잡도가 McCabe의 복잡도와 설계 복잡도 임을 밝혀냈다. 이 연구 결과에 의해서 설계 정보 및 유지 보수 정보를 얻을 수 있다. Abstract Switching software requires high reliability, functionality, extendability and maintainability. For doing, software quality model based on MaCabe's complexity measure is investigated. It is experimentally shown using regression analysis the program fault density depends on the complexity and size of the function unit. The software should be verified and tested if it satisfies its requirements with automated analysis tools. In this paper we propose the regression model with the test data.The sample program for the regression model consists of more than 500 blocks, where each block compose of 10 files, which has 59 functions of switching activity.Among them we choose 394 blocks and analyzed for 59 functions by testing tools and SAS package. We developed Regression Analysis Model and evaluated significant of the equation based on McCabe's cyclomatic complexity, block design complexity, design complexity, and integration complexity.The results of our experimental study are that number of fault are under the influence of McCabe's complexity number and design complexity.

• Proceedings of the Korean Nuclear Society Conference
• /
• 2002.10a
• /
• pp.196-196
• /
• 2002

• Proceedings of the Korean Nuclear Society Conference
• /
• 2005.10a
• /
• pp.1089-1090
• /
• 2005

• Journal of Institute of Control, Robotics and Systems
• /
• v.6 no.1
• /
• pp.66-72
• /
• 2000

As the demand for the design of modular manipulators or special purpose manipulators has increased, task based design to design an optimal manipulator for a given task become more and more important. However, the complexity with a large number of design parameters, and highly nonlinear and implicit functions are characteristics of a general manipulator design. To achieve the goal of task based design, it is necessary to develop a methodology to solve the complexity. This paper addresses how to determine the kinematic parameters of a two-degrees of freedom manipulator with parallelogram five-bar link mechanism from a given task, namely, how to map a given task into the kinematic parameters. With simplified example of designing a manipulator with five-bar link mechanism, the methodology for task based design is presented. And it introduces formulations of a given task and manipulator specifications, and presents a new dexterity measure for manipulator design. Also the optimization problem with constraints is solved by using a genetic algorithm that provides robust search in complex spaces.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.10 no.12
• /
• pp.3715-3724
• /
• 2009

Recently, component-based software development is getting accepted in industry as a new effective software development paradigm. Since the introduction of component-based software engineering (CBSE) in later 90's, the CBSD research has focused largely on component modeling, methodology, architecture and component platform. However, as the number of components available on the market increases, it becomes more important to devise metrics to quantify the various characteristics of components. In this Paper, we propose metrics for measuring the complexity, customizability, and reusability of software components. Complexity metric can be used to evaluate the complexity of components. Customizability is used to measure how efficiently and widely the components can be customized for organization specific requirement. Reusability can be used to measure the degree of features that are reused in building applications. We expect that these metrics can be effectively used to quantify the characteristics of components.