• Journal of Communications and Networks
• /
• 제11권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
• /
• 제14권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$.

• 방송과미디어
• /
• 제7권3호
• /
• pp.75-82
• /
• 2002

본 연구에서는 ITU-T와 MPEG에서 공동개발중인 JVT압축/복원방식에 대한 복잡도 분석이 수행된다. 압축률을 향상시키는 측면U떠 부호화 할 때 3가지의 configuration을 설정하여 각각의 configuration이 부호기와 복호기 구현시 필요한 메모리 및 계산시간에 대한 분석을 수행한다. 복잡도분석을 위하여 ATOMIUM 분석기를 이용한 메모리 대역폭 및 처리시간의 2가지 요인에 대한 결과를 소개한다. 또한 부호기 및 복호기의 각 비디오 툴들에 대한 상대적인 계산량을 정량적으로 도시한다.

• Asia pacific journal of information systems
• /
• 제11권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.

• 한국지능시스템학회:학술대회논문집
• /
• 한국퍼지및지능시스템학회 2000년도 추계학술대회 학술발표 논문집
• /
• pp.85-88
• /
• 2000

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

• 정보처리학회논문지:소프트웨어 및 데이터공학
• /
• 제5권1호
• /
• pp.1-6
• /
• 2016

도메인 분석은 신뢰성 있는 프로젝트 개발의 중요한 요소가 된다. 도메인 분석에서 발생되는 오류는 전체 시스템에 영향을 주게 되고, 그 결과 고객의 만족도가 낮아진다. 따라서 요구사항 단계에서 신뢰성 있는 분석을 위하여 도메인의 특성을 분석할 수 있는 방법이 필요하게 된다. 본 논문에서는 이와 같은 문제를 해결하기 위하여 도메인 분석의 신뢰성 향상을 위한 도메인 분류와 복잡도 측정방법을 제시하고자 한다.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2002년도 ITC-CSCC -3
• /
• 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%

• 한국컴퓨터정보학회논문지
• /
• 제9권3호
• /
• pp.27-34
• /
• 2004

개발 패러다임이 점차 복잡한 웹 환경으로 전환되면서 복잡도에 대한 연구가 다시 활발해지고 있으나 아직 웹 어플리케이션의 구조나 복잡도 측정 매트릭에 정립된 이론이 부족한 실정이다. 또한 전통적 복잡도를 측정하는 프로그램 규모(LOC)나 순환복잡도 매트릭은 구현 후에나 알 수 있어 소프트웨어 개발주기 초기의 분석 및 설계 단계에는 큰 도움을 주지 못하고 있다. 본 연구에서는 실무에서 사용되는 6개 웹 프로젝트에 복잡도 인디케이터를 적용하여 결함 가능성이 높은 어플리케이션을 추출한다 추출한 61개의 프로그램을 대상으로 복잡도와 클래스 수 및 메소드 수에 대한 선형적 상관관계를 제안함으로써 웹어플리케이션의 복잡도를 구현 전에 미리 예측 가능하도록 하여 개발 프로세스의 인적 자원 관리나 비용 예측에 기여하고자 한다.

• 보건행정학회지
• /
• 제14권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.

• 복식문화연구
• /
• 제8권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.