• 산업경영시스템학회지
• /
• 제35권3호
• /
• pp.24-31
• /
• 2012

Priority rules or sequencing heuristics conventionally used to determine resource allocation is to maximize the earned value on time and cost. This study provides a effective strategy-oriented approach for the program resource management problem with limited same resource, which systematically connects individual project objectives to the overall organizational goal, by introducing financial values as well as priority rules in a broader context. It deals with the resource allocation problem as the decision making problem in the strategic management paradigm to meet business objective and solves it using the analytic hierarchy process, and explains the method of application and usefulness through some simulation cases.

• 한국정보시스템학회지:정보시스템연구
• /
• 제14권3호
• /
• pp.82-88
• /
• 2005

Much information has been hierarchically organized to facilitate information browsing, retrieval, and dissemination. In practice, much information may be entered at any time, but only a small subset of the information may be classified into some categories in a hierarchy. Therefore, achieving document filtering (DF) in the course of document classification (DC) is an essential basis to develop an information center, which classifies suitable documents into suitable categories, reducing information overload while facilitating information sharing. In this paper, we present a technique ICenter, which conducts DF and DC by recognizing the context of discussion (COD) of each document and category. Experiments on real-world data show that, through COD recognition, the performance of ICenter is significantly better. The results are of theoretical and practical significance. ICenter may server as an essential basis to develop an information center for a user community, which shares and organizes a hierarchy of textual information.

• 한국국방경영분석학회지
• /
• 제28권1호
• /
• pp.83-96
• /
• 2002

The Analytic Hierarchy Process (AHP) is well suited to group decision making and offers numerous benefits as a synthesizing mechanism in group decisions. To date, the majority of AHP applications have been in group settings. One reason for this may be that groups often have an advantage over individual when there exists a significant difference between the importance of quality in the decision and the importance of time in which to obtain the decision. Another reason may be the best alternative is selected by comparing alternative solutions, testing against selected criteria, a task ideally suited for AHP. In general, aggregation methods employed in group AHP can be largely classified into two methods: geometric mean method and (weighted) arithmetic mean method. In a situation where there do not exist clear guidelines for selection between them, two methods do not always guarantee the same group decision result. We propose a simulation approach for building group consensus without efforts to make point estimates from individual diverse preference judgments, displaying possible disagreements as is natural in group members'different viewpoints.

• 산업경영시스템학회지
• /
• 제27권4호
• /
• pp.110-116
• /
• 2004

ABC analysis is the process of dividing inventory items into three classes according to their monetary usage so that managers can focus on items that have the highest monetary usage value, and has been widely used in practice since its development in 1950. However, the original criterion, monetary usage value, can no longer be the only rational criterion. Applying Analytic Hierarchy Process, we develop a new method to classify inventory items by considering such operationally/strategically important criteria as annual dollar usage, lead time, supplier's capacity, defective rate, difficulty of purchasing and unit price. A case study is performed applying the method to the field data from a company which produces electrochemical products.

• Journal of Construction Engineering and Project Management
• /
• 제4권1호
• /
• pp.29-36
• /
• 2014

Tunnelling has become a preferred method of construction for road and highway projects in countries with a lot of hilly slope geological conditions such as found in Malaysia. However the construction works of a tunnelling project are usually complicated and costly, which consequently impose great risks to the parties involved. This paper identifies the key significant risks and sub-risks for tunnelling construction projects in Malaysia through a case study. Interview has been used as the solitary means to determine the significant risks from contractor's eleven key project personnel who were directly involved in the tunnelling construction such as consultant, construction manager and tunnel engineers. The importance of the risks identified is then prioritised and ranked via the Analytic Hierarchy Process (AHP)'s pairwise comparison approach to determine their criticality towards a successful delivery of project. As a result, three key risks have been identified as significant for the tunnelling case study project, namely health and safety, cost overrun in construction and time overrun in construction. Two sub-risks each of the latter categories, which are cost underestimation and unforeseen events (cost overrun in construction) as well as plant and machinery failure and delay in material delivery (time overrun in construction), have occupied the top five overall risk ranking.

• 한국지능시스템학회논문지
• /
• 제10권2호
• /
• pp.83-93
• /
• 2000

본 논문은 교통 교차로 신호의 최적 주기 시간을 구하기 위해 계층분석법(AHP:Analytic Hierach Process) 제어기 사용을 제어한다 전문교통평가자로부터 데이트를 받아 시뮬레이션을 하여 AHP 제어기의 성능이 고정 시간 제어기 퍼지제어기와 비교되었다 시뮬레이션은 안산시청 로타리의 많은 전문 면담자로부터 얻은 더에터를 사용하여 실행되었다 주요한 문제는 AHP 제어기 알고리즘이 교통 교차로 신호제어를 위해 전문 시스템으로 구성되어 교통 신혼 통제 체제를 얼마나 보조할 수 있는가이다 논문은 두 단계를 갖는다 (1) 개개목적의 중요성을 계산할 수 있는 Satty의 연구를 기초로 하는 새로운 방법을 제안한다 (2) 인간의 결정 체계는 퍼지 적분이 사용되는 근사 추론에 의하여 나타내진다는 것을 고려한다.

• 전기학회논문지
• /
• 제67권5호
• /
• pp.656-662
• /
• 2018

Pattern matching algorithm is widely used in many application fields such as bio-informatics, intrusion detection, etc. Among many string matching algorithms, KMP (Knuth-Morris-Pratt) algorithm is commonly used because of its fast execution time when using large texts. However, the processing speed of KMP algorithm is also limited when the text size increases significantly. In this paper, we propose a high throughput parallel KMP algorithm considering CPU-GPU memory hierarchy based on OpenCL in GPGPU (General Purpose computing on Graphic Processing Unit). We focus on the optimization for the allocation of work-times and work-groups, the local memory copy of the pattern data and the failure table, and the overlapping of the data transfer with the string matching operations. The experimental results show that the execution time of the optimized parallel KMP algorithm is about 3.6 times faster than that of the non-optimized parallel KMP algorithm.

• 정보관리학회지
• /
• 제21권4호
• /
• pp.173-185
• /
• 2004

정보통신의 기술이 발달하면서 정보의 양이 많아지고 사용자의 질의에 대한 검색 결과 리스트도 많이 추출되므로 빠르고 고품질의 문서 클러스터링 알고리즘이 중요한 역할을 하고 있다. 많은 논문들이 계층적 클러스터링 방법을 이용하여 좋은 성능을 보이지만 시간이 많이 소요된다. 반면 K-means 알고리즘은 시간 복잡도를 줄일 수 있는 방법이다. 본 논문에서는 계층적 클러스터링 시스템인 콘도르(Condor) 시스템에서 간단하고 고품질이며 효율적으로 정보 검색 할 수 있도록 구현하였다. 이 시스템은 K-Means Algorithm을 이용하였으며 클러스터 계층 깊이와 초기값을 조절하여 $88\%$의 정확율을 보였다.

• Journal of Communications and Networks
• /
• 제12권4호
• /
• pp.358-365
• /
• 2010

We develop a low complexity cooperative diversity protocol for low energy adaptive clustering hierarchy (LEACH) based wireless sensor networks. A cross layer approach is used to obtain spatial diversity in the physical layer. In this paper, a simple modification in clustering algorithm of the LEACH protocol is proposed to exploit virtual multiple-input multiple-output (MIMO) based user cooperation. In lieu of selecting a single cluster-head at network layer, we proposed M cluster-heads in each cluster to obtain a diversity order of M in long distance communication. Due to the broadcast nature of wireless transmission, cluster-heads are able to receive data from sensor nodes at the same time. This fact ensures the synchronization required to implement a virtual MIMO based space time block code (STBC) in cluster-head to sink node transmission. An analytical method to evaluate the energy consumption based on BER curve is presented. Analysis and simulation results show that proposed cooperative LEACH protocol can save a huge amount of energy over LEACH protocol with same data rate, bit error rate, delay and bandwidth requirements. Moreover, this proposal can achieve higher order diversity with improved spectral efficiency compared to other virtual MIMO based protocols.

• 한국정보처리학회:학술대회논문집
• /
• 한국정보처리학회 2004년도 춘계학술발표대회
• /
• pp.673-676
• /
• 2004

Fast and high-quality document clustering algorithms play an important role in providing data exploration by organizing large amounts of information into a small number of meaningful clusters. In particular, hierarchical clustering provide a view of the data at different levels, making the large document collections are adapted to people's instinctive and interested requires. Many papers have shown that the hierarchical clustering method takes good-performance, but is limited because of its quadratic time complexity. In contrast, K-means has a time complexity that is linear in the number of documents, but is thought to produce inferior clusters. Think of the factor of simpleness, high-quality and high-efficiency, we combine the two approaches providing a new system named CONDOR system [10] with hierarchical structure based on document clustering using K-means algorithm to "get the best of both worlds". The performance of CONDOR system is compared with the VIVISIMO hierarchical clustering system [9], and performance is analyzed on feature words selection of specific topics and the optimum hierarchy depth.