• Journal of Communications and Networks
• /
• v.11 no.1
• /
• pp.84-93
• /
• 2009

This paper focuses on message complexity performance analysis of mobile ad hoc network (MANET) address autoconfiguration protocols (AAPs) in reference to link errors generated by mobile wireless nodes. An enhancement was made using a proposed retransmission limit, S, to be computed for error recovery (based on the link error probability), to measure message complexity of AAPs in reference to the link error probability, $P_e$. The control procedures for the retransmission limit have been included for each of the AAPs. Retransmission limit control is critical for efficient energy consumption of MANET nodes operating on limited portable energy. O-notation has been applied to analyze the upper bound of the number of messages generated by a MANET group of nodes. The AAPs investigated in this paper are strong duplicate address detection (DAD), weak DAD with proactive routing protocol (WDP), weak DAD with on-demand routing protocol (WDO), and MANETConf. Each AAP reacts different to link errors, as each AAP has different operational procedures. The required number of broadcasting, unicasting, relaying, and received messages of the nodes participating in a single-node joining procedure is investigated to asymptotically calculate the message complexity of each AAP. Computer simulation was conducted and the results have been analyzed to verify the theoretical message complexity bounds derived. The message complexity of WDP was lowest, closely followed byWDO, based on the simulation results and analysis of the message complexity under nominal situations. The message complexity of MANETConf was higher than WDO, and strong DAD resulted to be most complex among the four AAPs.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• v.14 no.2
• /
• pp.93-111
• /
• 2010

The purpose of this paper is to obtain new complexity results for a second-order cone optimization (SOCO) problem. We define a proximity function for the SOCO by a kernel function. Furthermore we formulate an algorithm for a large-update primal-dual interior-point method (IPM) for the SOCO by using the proximity function and give its complexity analysis, and then we show that the new worst-case iteration bound for the IPM is $O(q\sqrt{N}(logN)^{\frac{q+1}{q}}log{\frac{N}{\epsilon})$, where $q{\geqq}1$.

• Broadcasting and Media Magazine
• /
• v.7 no.3
• /
• pp.75-82
• /
• 2002

In this report, the complexity analysis of the JVT(Joint Video Team) codec, which has jointly developed the next video coding standard, is performed. Three types of configurations in terms of coding efficiency are set and the analysis of the memory band width and computation time for each configuration is performed. ATOMIUM complexity analysis tool is used for both the memory access statistics and computation time calculation of JVT codec. Also the complexity of each video coding tool in the encoder and decoder is shown in relative complexity.

• Asia pacific journal of information systems
• /
• v.11 no.2
• /
• pp.141-158
• /
• 2001

This paper examines the effects of environmental uncertainty, structural decentralization, formalization, complexity and task interdependence on the information sharing through information system. 197 firms in Korea are surveyed and analyzed to investigate the relationship between the contextual variables and the information sharing. The result of multiple regression analysis shows that task interdependence, structural decentralization, complexity are significant factors to influence on the Information Sharing. Also, additional analysis shows that task interdependence, structural decentralization are major factors in service industry, and task interdependence, structural complexity are in manufacturing industry.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 2000.11a
• /
• pp.85-88
• /
• 2000

본 논문은 Threshold Logic Unit(TLU)를 기본 뉴런으로 하여 최소화된 이진신경회로망을 합성하는 방법인 MSP Term Grouping(MTG) 알고리즘의 time complexity를 분석하고자 한다. 이를 전체 패턴 탐색을 통한 이진신경회로망 합성의 경우와 비교하여 MTG 알고리즘의 효용성을 보여준다.

• KIPS Transactions on Software and Data Engineering
• /
• v.5 no.1
• /
• pp.1-6
• /
• 2016

Domain analysis is an important component for reliability of development project. Domain analysis error have an effect in the whole system. As a result, the system reliability will be deteriorated. Therefore, we need a methodology to analyze domain characteristic for a reliable analysis in the domain analysis phase. In this paper, we propose a methodology for domain categorization and estimation of complexity for reliability improvement of domain analysis.

• Proceedings of the IEEK Conference
• /
• 2002.07c
• /
• pp.2035-2038
• /
• 2002

The necessity of the filter coefficients compensation for the LTJ adaptive filter was explained generally and easily by analyzing it with respect to the time-varying transform domain adaptive filter. And also the reduction method of computational complexity for filter coefficients compensation was proposed and its effectiveness was verified through experiments using artificial and real speech signals. The proposed adaptive filter reduces the computational complexity for filter coefficients compensation by 95%, and when the filter is applied to the acoustic echo canceller with 1000 taps, the total complexity is reduced by 82%

• Journal of the Korea Society of Computer and Information
• /
• v.9 no.3
• /
• pp.27-34
• /
• 2004

As software developing paradigm has been changing to complicate Web environment, study of complexity becomes vigorous. Yet still it seems that general agreement has not to be reached to architecture or complexity measure of Web application. And so traditional complexity metrics - program size(LOC) and Cyclomatic Complexity can be derived from the source code after implementation. it is not helpful to the early phase of software development life cycle - analysis and design phase. In this study 6 Web projects has been used for deriving applications with possible errors suited by Complexity Indicator. Using 61 programs derived, linear correlation between complexity, number of classes and number of methods has been proposed. As Web application complexity could be estimated before implementation, effort and cost management will be processed more effectively.

• Health Policy and Management
• /
• v.14 no.1
• /
• pp.89-120
• /
• 2004

The purpose of this empirical study is to test hypotheses in order to identify the cost drivers that drive indirect costs in general hospitals in Korea. In various cases' studies, it has been suggested that overhead costs are driven by volume and complexity variables, how they are structurally related and how the cost impacts of these variables can be A unique feature of the research is the treatment of complexity as an endogenous variable. It is hypothesized that level of hospital complexity in terms of the number of services provided(i.e., “breath" complexity) and the intensity of individual estimated in practice. overhead services(ie., “depth" complexity) are simultaneous determined with the level of costs needed to support the complexity. Data used in this study were obtained from the Database of Korean Health Industry Development Institute, Health Insurance Review Agency and analyzed using simultaneous equation model, path model. The results found those volume and complexity variables are all statistically signi-ficance drivers of general hospital overhead costs. This study has documented that the level of service complexity is a significant determinant of hospital overhead costs, caution should be exercised in interpreting this as supportive of the cost accounting procedures associated with ABC. with ABC.

• The Research Journal of the Costume Culture
• /
• v.8 no.1
• /
• pp.30-39
• /
• 2000

The purpose of this study were to 1) identify types and levels of production environments, 2) classify apparel manufacturers based on production environments and 3) investigate relationship between characteristics of apparel manufacturers and production environment. Apparel manufacturer's characteristics included product line and the number of employees. For this study, the questionnaires were administered to 215 apparel manufacturers in seoul and Kyung-gi region from Feb. to Mar. 1998. Employing a sample of 201, data were analyzed by factor analysis, descriptive statistics, cluster analysis, cluster analysis, discriminant Analysis, and multivariate analysis of variance. The following are the results of this study : 1. The production environment was identified as three types such as complexity of product environment, uncertainty of demand/supply environment and uncertainty of worker environment. 2. Based on three types of the production environment, apparel manufacturers were classified into stable group, uncertain group and complicated group. 3. With respect to product line, men's wear manufacturers were lied the most high complexity of product environment, casual wear and knit wear were lied the most frequently uncertainty of worker environment. With respect to the number employees, apparel manufacturers comprising 50∼99 employees were lied the most high complexity of product environment, while those comprising 100∼299 employees the most high demand/supply environment.