뉴로-퍼지 소프트웨어 신뢰성 예측

이상운(Sang-Un Lee) 한국정보과학회 2000 정보과학회논문지 : 소프트웨어 및 응용 Vol.27 No.4

본 논문은 주어진 고장 데이타로부터 소프트웨어의 신뢰성 예측력 향상을 위해 뉴로-퍼지 시스템 연구를 수행하였다. 다른 소프트웨어로부터 수집된 10개의 고장 수 데이타와 4개의 고장시간 데이타에 대해 규칙의 수를 변경시키면서 다음 단계 예측을 실험하였다. 뉴로-퍼지 시스템의 예측력을 보이기 위해 다음 단계 예측에 대해 비교하였다. 실험 결과 뉴로-퍼지 시스템은 다양한 소프트웨어에 잘 적용되었다. 또한 널리 사용되고 있는 신경망과 통계적 소프트웨어 신뢰성 성장 모델의 예측력과 견줄 정도의 좋은 결과를 얻었다. This paper explores neuro-fuzzy system in order to improve the software reliability predictability from failure data. We perform numerical simulations for actual 10 failure count and 4 failure time data sets from different software projects with the various number of rules. Comparative results for next-step prediction problem is presented to show the prediction ability of the neuro-fuzzy system. Experimental results show that neuro-fuzzy system is adapt well across different software projects. Also, performance of neuro-fuzzy system is favorably with the other well-known neural networks and statistical SRGMs.

격자 그래프의 최소선형배열 알고리즘

이상운,Sang-Un Lee 한국인터넷방송통신학회 2024 한국인터넷방송통신학회 논문지 Vol.24 No.2

This paper deals with the minimum linear arrangement(MinLA) of a lattice graph, to which an approximate algorithm of linear complexity O(n) remains as a viable solution, deriving the optimal MinLA of 31,680 for 33×33 lattice. This paper proposes a partitioning arrangement algorithm of complexity O(1) that delivers exact solution to the minimum linear arrangement. The proposed partitioning arrangement algorithm could be seen as loading boxes into a container. It firstly partitions m rows into r₁,r₂,r₃ and n columns into c₁,c₂,c₃, only to obtain 7 containers. Containers are partitioning with a rule. It finally assigns numbers to vertices in each of the partitioned boxes location-wise so as to obtain the MinLA. Given m,n≥11, the size of boxes C₂,C₄,C₆ is increased by 2 until an increase in the MinLA is detected. This process repeats itself 4 times at maximum given m,n≤100. When tested to lattice in the range of 2≤n≤100, the proposed algorithm has proved its universal applicability to lattices of both m=n and m≠n. It has also obtained optimal results for 33×33 and 100×100 lattices superior to those obtained by existing algorithms. The minimum linear arrangement algorithm proposed in this paper, with its simplicity and outstanding performance, could therefore be also applied to the field of Very Large Scale Integration circuit where m,n are infinitely large.

이진트리의 최소선형배열 알고리즘

이상운,Sang-Un Lee 한국인터넷방송통신학회 2024 한국인터넷방송통신학회 논문지 Vol.24 No.2

In the deficiency of an exact solution yielding algorithm, approximate algorithms remain as a solely viable option to the Minimum Linear Arrangement(MinLA) problem of Binary tree. Despite repeated attempts by a number of algorithm on k = 10, only two of them have been successful in yielding the optimal solution of 3,696. This paper therefore proposes an algorithm of O(n) complexity that delivers the exact solution to the binary tree. The proposed algorithm firstly employs an In-order search method by which n = 2^k - 1 number of nodes are assigned with a distinct number. Then it reassigns the number of all nodes that occur on level 2 ≤ 𝑙 ≤ k-2, (k = 5) and 2 ≤ 𝑙 ≤ k-3, (k = 6), including that of child of leaf node. When applied to k=5,6,7, the proposed algorithm has proven Chung[14]'s S^(k)_min=2^k-1+4+S^(k-1)_min+2S^(k-2)_min conjecture and obtained a superior result. Moreover, on the contrary to existing algorithms, the proposed algorithm illustrates a detailed assignment method. Capable of expeditiously obtaining the optimal solution for the binary tree of k > 10, the proposed algorithm could replace the existing approximate algorithms.

택지개발지구 특성에 따른 거주자의 생활권 내 근린시설 이용행태 - 청주권 3개 택지개발지구를 중심으로 -

이상운,박경옥,Lee, Sang-Un,Park, Kyoung-Ok 한국주거학회 2010 한국주거학회 논문집 Vol.21 No.5

This study has the purpose to reveal the differences of residents' using behaviors of living facilities at 3 complexes. The physical characteristics of the complexes have been investigated by a literature study and field survey. In addition, questionnaires were answered by residents on living facilities using behavior on community environment. The tools of analysis are frequency, percentage, and cross tabulation using SPSS WIN 12.0 program. Followings are the results of the study. 1) The developmental concept of 3 complexes maintained its initial identity. (1) The residence-oriented complex, having wider residential space, had better downtown access and more convenient facilities for daily life. (2) The residence-government mixed complex, constructed with an eco-friendly concept, had wider green and public service space and good downtown access but on the other hand, had less convenience facilities because of a short period from construction. (3) The residence-industry mixed complex, located in sub-urbanity and conceding more land for industries, had poor access to downtown but had more convenient facilities for workers' use. 2) The most frequently visited convenience facilities were shopping facilities, large or small, and banks, and activities were commonly done in the complex or adjacent area. This means it is recommended that the developer of the new complex locate convenience facilities in multi-core concentration types or street types rather than one-core concentration types.

가꾸로 퍼즐에 관한 마법 규칙 기반 실마리 후보 결정 알고리즘

이상운,Sang-Un Lee 한국인터넷방송통신학회 2024 한국인터넷방송통신학회 논문지 Vol.24 No.3

가꾸로 퍼즐은 다항시간으로 퍼즐을 풀 수 있는 방법이 알려져 있지 않은 NP-완전 문제이다. 지금까지는 가능한 모든 경우수를 대입해 보는 전수탐색 법이나 선형계획법을 적용하고 있다. 본 논문은 박스 크기와 합 실마리에 따른 들어갈 수 없는 숫자들에 대한 규칙인 마법의 규칙을 찾아내었다. 마법의 규칙에 기반하여 빈 셀에 들어갈 수 없는 숫자들을 행과 열 합 실마리에 대한 박스에서 삭제하였다. 다음으로 합 실마리 값에 기반하여 박스에 들어갈 수 없는 숫자들을 삭제하였다. 최종적으로 단일 숫자만 존재하는 셀을 실마리로 확정하였다. 제안된 알고리즘을 7개의 벤치마킹 실험 데이터에 적용한 결과 모든 문제에 대해 해를 구할 수 있음을 보였다. Kakuro puzzles are NP-complete problems where no way to solve puzzles in polynomial time is known. Until now, a brute-force search method or a linear programming method has been applied to substitute all possible cases. This paper finds a magic rule, a rule for box sizes and unfilled numbers according to sum clues. Based on the magic rule, numbers that cannot enter empty cells were deleted from the box for row and column sum clues. Next, numbers that cannot enter the box were deleted based on the sum clue value. Finally, cells with only a single number were confirmed as clues. As a result of applying the proposed algorithm to seven benchmarking experimental data, it was shown that solutions could be obtained for all problems.

택지개발지구 특성에 따른 거주자의 생활권 내 근린환경만족도 및 개선우선지수 - 청주권 3개 택지개발지구를 중심으로 -

이상운,박경옥,Lee, Sang-Un,Park, Kyoung-Ok 한국주거학회 2010 한국주거학회 논문집 Vol.21 No.3

This study has the purpose to reveal the differences of residents' satisfaction level & demand of community environment and recognized residents' improvement priority of community environment at 3 complexes at the big city in the provinces. The 3 residential complexes had differentiated developmental concepts; the residence-oriented complex, the residence-government mixed complex with an eco-friendly concept, and the outskirt residence-industry mixed complex. Followings are the results of the study. 1) The satisfaction of residents in the community environment correlates with the increasing convenience facilities after construction. In the new outskirt complexes of smaller cities, dissatisfaction occurs more with public transportation rather than the road system, so that efficient public transportation systems, inner and neighboring areas, is requisite. 2) Even in the residence-oriented complex, the education environment does not entirely account for satisfaction level; the green environment is also second in priority after the education environment. In the residence-government mixed complex with an eco-friendly concept, a good natural environment does not entirely account for satisfaction level; education environment is also second in priority after the natural environment. The supply of sufficient schools may be fulfilled in the ways of reform of the education zone with neighboring existing residential areas. In the outskirt residence-industry mixed complex of smaller cities, priority was placed more on the location and convenience; this explains the complex's poor access to downtown.

지상파 DMB 데이터방송 표준

이상운,Lee, Sang-Un 한국정보통신기술협회 2005 TTA저널 Vol.101 No.-

한계 알고리즘을 적용한 결혼문제

이상운(Sang-Un Lee) 한국컴퓨터정보학회 2015 韓國컴퓨터情報學會論文誌 Vol.20 No.11

This paper deals with a newly proposed algorithm for stable marriage problem, which I coin threshold algorithm. The proposed algorithm firstly constructs an n × n matrix of the sum of each sex’s preference over the members of the opposite sex. It then selects the minimum value from each row and column to designate the maximum value of the selected as the sum threshold p∗ij. It subsequently deletes the maximum preference maxpij from a matrix derived from deleting pij>p∗ij, until │ci│=1 or │cj│=1. Finally, it undergoes an optimization process in which the sum preference is minimized. When tested on 7 stable marriage problems, the proposed algorithm has proved to improve on the existing solutions.

화공약품 탱크 적재 문제의 최소 여유량 탱크 적재 알고리즘

이상운(Sang-Un Lee) 한국컴퓨터정보학회 2015 韓國컴퓨터情報學會論文誌 Vol.20 No.2

화공약품 탱크 적재 문제는 다항시간으로 해를 찾을 수 있는 알고리즘이 알려져 있지 않아 NP-완전으로 분류된 난제이다. 화공약품 탱크 적재 문제는 상자 포장 문제의 일종으로, Gueret et al.은 O(m<SUP>4</SUP>) 수행 복잡도의 선형계획법으로 해를 얻고자 하였다. 반면에, 본 논문에서는 최소 여유량을 가진 탱크에 적재하는 규칙인 O(m) 복잡도의 알고리즘을 제안하였다. 제안된 방법은 첫 번째로 잔여량이 있는 탱크에 해당 화공약품을 적재하였다. 다음으로, 남은 화공약품을 적재할 수 있는 최소 여유량을 가진 탱크에 해당 화공약품을 적재하였다. 실험 결과, 제안된 알고리즘은 NP-완전 문제인 화공약품 적재 문제에 대해 선형계획법의 O(m<SUP>4</SUP>) 를 O(m)으로 단축시켰다. The chemical tank loading problem has been classified as nondeterministic polynomial time (NP)-complete problem because of the polynomial-time algorithm to find the solution has been unknown yet. Gueret et al. tries to obtain the optimal solution using linear programming package with O(m<SUP>4</SUP>) time complexity for chemical tank loading problem a kind of bin packing problem. On the other hand, this paper suggests the rule of loading chemical into minimum margin tank algorithm with O(m) time complexity. The proposed algorithm stores the chemical in the tank that has partial residual of the same kind chemical firstly. Then, we load the remaining chemical to the minimum marginal tanks. As a result of experiments, this algorithm reduces the O(m<SUP>4</SUP>) of linear programming to O(m) time complexity for NP-complete chemical tank loading problem.

중형 임대아파트 거주자의 거주 후 평가

이상운,박경옥,Lee Sang-Un,Park Kyoung-Ok 한국주거학회 2006 한국주거학회 논문집 Vol.17 No.3

This study analyzes relevant data based on the mid-sized rental unit. It focuses on how we can set up appropriate mid-sized rental unit plan as its supply has been accelerated over time. The questionnaires used in this study cover a series of categories including site environment, unit plan, neighborhood, economy, and management. The 342 respondents are from the 3-year old apartments at Cheongju. The key findings are as follows. 1) As the average indices including number of family, life cycle, and income under the survey are different in terms of the rental unit sizes between 20 and 30 pyeongs. 2) In general, residents present comparatively high level of satisfaction in terms of residential environments. Their evaluation on the site environment unit plan, and neighborhood is around the average. In contrast, the economic and management efficiency categories are under the average. This study suggests residential guidelines should be derived from tenant differentiation policies dealing with diverse socio-demographic characteristics and satisfaction level. 3) In terms of improvement priority, residents present, higher preference on the management system and site environment. This study advises to establish an appropriate alternative to guarantee effective tenant participation. Considering the lower satisfaction level in the green space, common facilities, and resting space, this study also urges to secure quality control for desirable planning of the mid-sized rental apartments.