• Proceedings of the Korea Society for Industrial Systems Conference
• /
• 1997.11a
• /
• pp.435-449
• /
• 1997

In this paper, a new metric, universal metric, is Proposed for sequential decoding of convolutional decoding. The complexity of Fano metric for Fano's sequential decoding algorithm is compared with that of the proposed universal metric. Since the Fano metric assumes that it has previous knowledge of channel transition probability, the complexity of Fano metric increases as the assumed channel error probability does not coincide with the true channel error probability. However, the universal metric dose not require the previous knowledge of the channel transition probability since it is estimated on a branch by branch basis. It is shown that the complexity of universal metric is much less than that of the Fano metric for bursty noisy channel.

• Journal of The Korean Association of Information Education
• /
• v.2 no.2
• /
• pp.260-268
• /
• 1998

In this paper, I propose a metric model for measuring complexity of Web documentations which are wrote by HTML and XML. The complexity of Web documentation has effect on documentation understandability which is an important metric in maintenance and reusing of Web documentation. The understandable documents have more effect on WEI. The proposed metric uses the entropy to represent the degree of information flows between Web documentations. The proposed documentation complexity measures the information flows in a Web document based on the information passing relationship between Web document files. I evaluate the proposed metric by using the complexity properties proposed by Weyuker, and measure the document complexity. I show effectiveness of analyzing the correlation between the number of document file and document complexity.

• Journal of the Korean Society of Systems Engineering
• /
• v.17 no.2
• /
• pp.69-81
• /
• 2021

The human performance issues and increased automation issues in advanced Small Modular Reactors (SMRs) are critical to numerous stakeholders in the nuclear industry, due to the undesirable implications targeting the Man Machine Interface Systems (MMIS) complexity of (Generation IV) SMRs. It is imperative that the design of future SMRs must address these problems. Nowadays, Multi Agent Systems (MAS) are used in the industrial sector to solve multiple complex problems; therefore incorporating this technology in the proposed innovative SMR (I-SMR) design will contribute greatly in the decision making process during plant operations, also reduce the number MCR operating crew and human errors. However, it is speculated that an increased level of complexity will be introduced. Prior to achieving the objectives of this research, the tools used to analyze the system for complexity reduction, are the McCabe's Cyclomatic complexity metric and the Henry-Kafura Information Flow metric. In this research, the systems engineering approach is used to guide the engineering process of complexity reduction concept of the system in its entirety.

• International Journal of Internet, Broadcasting and Communication
• /
• v.9 no.1
• /
• pp.72-80
• /
• 2017

In this work, an efficient transmit antenna selection approach for the quadrature spatial modulation (QSM) systems is proposed. The conventional Euclidean distance antenna selection (EDAS)-based schemes in QSM have too high computational complexity for practical use. The proposed antenna selection algorithm is based on approximation of the EDAS decision metric employed for QSM. The elimination of imaginary parts in the decision metric enables decoupling of the approximated decision metric, which enormously reduces the complexity. The proposed method is also evaluated via simulations in terms of symbol error rate (SER) performance and compared with the conventional EDAS methods in QSM systems.

• 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 Information Technology Services
• /
• v.10 no.3
• /
• pp.167-177
• /
• 2011

Code obfuscation is a technique that protects the abstract data contained in a program from malicious reverse engineering and various obfuscation methods have been proposed for obfuscating intention. As the abstract data of control flow about programs is important to clearly understand whole program, many control flow obfuscation transformations have been introduced. Generally, inlining is a compiler optimization which improves the performance of programs by reducing the overhead of calling invocation. In code obfuscation, inlining is used to protect the abstract data of control flow. In this paper, we define new control flow complexity metric based on entropy theory and N-Scope metric, and then apply genetic algorithm to obtain optimal inlining results, based on the defined metric.

• The KIPS Transactions:PartD
• /
• v.8D no.3
• /
• pp.233-240
• /
• 2001

As software technology is in progress and software quantification is getting more important, many metrics have been proposed to quantify a variety of system entities. These metrics can be classified into two different forms : scalar metric and metric vector. Though some recent studies pointed out the composition problem of the scalar metric form, many scalar metrics are successfully used in software development organizations due to their practical applications. In this paper, it is concluded that hybrid metric form weighting external complexity is most suitable for scalar metric form. With this concept, a general framework for hybrid metrics construction independent of the development methodologies and target system type is proposed. This framework was successfully used in two projects that quantify the analysis phase of the structured methodology and the design phase of the object oriented real-time system, respectively. Any organization can quantify system entities in a short time using this framework.

• Convergence Security Journal
• /
• v.10 no.1
• /
• pp.29-34
• /
• 2010

It is very important to evaluate the quality of soft wares based on SOA, which develops rapidly. Particularly, one of the most important properties influencing on the quality of system is complexity. Therefore, we propose the metrics for measuring a structural complexity of softwares based on SOA. The proposed metrics is composed of the size of a service, the depth of a service and interdependency from the viewpoint of system structure, and finally we applied the proposed metric to an example.

• International Journal of Naval Architecture and Ocean Engineering
• /
• v.4 no.3
• /
• pp.291-301
• /
• 2012

A scalar metric for the assessment of hull surface producibility was known to be useful in estimating the complexity of a hull form of ships or large offshore structures by looking at their shape. However, it could not serve as a comprehensive measuring tool due to its lack of important components of the hull form such as longitudinals, stiffeners, and web frames attached to the hull surface. To have a complete metric for cost estimation, these structural members must be included. In this paper, major inner structural members are considered by measuring the complexity of their geometric shape. The final scalar metric thus consists of the classes containing inner members with various curvature magnitudes as well as the classes containing curved plates with single and double curvature distribution. Those two distinct metrics are merged into a complete scalar metric that accounts for the total cost estimation of complex structural bodies.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.11A
• /
• pp.862-869
• /
• 2009

We propose a new adaptive K-best Sphere Decoding (SD) algorithm for Multiple Input Multiple Output (MIMO) systems where the number of survivor paths, K is changed based on the characteristics of path metrics which contain the instantaneous channel condition. In order to overcome a major drawback of Maximum Likelihood Detection (MLD) which exponentially increases the computational complexity with the number of transmit antennas, the conventional adaptive K-best SD algorithms which achieve near to MLD performance have been proposed. However, they still have redundant computation complexity since they only employ the channel fading gain as a channel condition indicator without instantaneous Signal to Noise Ratio (SNR) information. hi order to complement this drawback, the proposed algorithm use the characteristics of path metrics as a simple channel indicator. It is found that the ratio of the minimum path metric to the other path metrics reflects SNR information as well as channel fading gain. By adaptively changing K based on this ratio, the proposed algorithm more effectively reduce the computation complexity compared to the conventional K-best algorithms which achieve same performance.