• Proceedings of the Korea Information Processing Society Conference
• /
• 2010.04a
• /
• pp.180-182
• /
• 2010

데이터웨어하우스는 기업의 정책을 결정하는데 사용하고 있다. 그러나, 새로운 시스템이 추가되면 데이터 통합 측면에서 시스템간의 여러 가지 이질적인 특성으로 인해 많은 비용과 시간이 필요로 하게 된다. 따라서, 이러한 이질적인 특성을 해결하기 위해 데이터 구조의 이질성 및 데이터 표현의 이질성은 XMDR(eXtended Master Data Registry)를 이용하여 추상화된 쿼리를 생성하고, XMDR에 맞게 쿼리를 분리함으로써 이질성을 해결한다. 특히 본 논문에서는 XMDR을 이용하여 분산 시스템 통합시 로컬시스템의 영향을 최소화하고, 데이터웨어하우스의 정보를 실시간으로 생성하기 위해 분산된 환경에서 데이터 통합을 위한 표준화된 정보를 제공한다. 또한, 기존 시스템의 변경 없이 데이터를 통합하여 비용과 시간을 절감하고, 실시간 데이터 추출 및 정제 작업을 통해 일관성있는 실시간 정보를 생성하여 정보의 품질을 향상시킬수 있도록 한다.

• Journal of the Korea Safety Management & Science
• /
• v.25 no.2
• /
• pp.1-8
• /
• 2023

This paper is proposing a novel machine scheduling model for the unrelated parallel machine scheduling problem without setup times to minimize the total completion time, also known as "makespan". This problem is a NP-complete problem, and to date, most approaches for real-life situations are based on the operator's experience or simple heuristics. The new model based on the Memetic Algorithm, which was proposed by P. Moscato in 1989, is a hybrid algorithm that includes genetic algorithm and local search optimization. The new model is tested on randomly generated datasets, and is compared to optimal solution, and four scheduling models; three rule-based heuristic algorithms, and a genetic algorithm based scheduling model from literature; the test results show that the new model performed better than scheduling models from literature.

• Convergence Security Journal
• /
• v.10 no.1
• /
• pp.55-61
• /
• 2010

It is of great practical interest to deciding when to stop testing a software system in development phase and transfer it to the user. This decision problem called an optimal release policies. In this paper, because of the possibility of introducing new faults when correcting or modifying the software, we were researched release comparative policies which based on infinite failure NHPP model and types of interval failure times. The policies which minimize a total average software cost of development and maintenance under the constraint of satisfying a software reliability requirement can optimal software release times. In a numerical example, applied data which were patterns, if intensity function constant or increasing, decreasing, estimated software optimal release time.

• Journal of Navigation and Port Research
• /
• v.44 no.3
• /
• pp.227-234
• /
• 2020

One of the most important operational goals in container terminals is to maximize the quay side productivity by minimizing the turnaround times of the vessels, for which the operations of the quay cranes (QC) to load/unload containers onto/from the vessels should be conducted efficiently without delays. This paper suggests using a policy-based dispatching method for YTs (Yard Tractor) that deliver containers between QCs and the storage yard. The goal of using such a dispatching policy is to maximize the efficiency of the YT operation and accordingly to minimize the QC delays because of late arrivals of the YTs. In particular, in this paper, we modified the previously proposed policy for its application to real container terminal and verified the effect through simulation experiments using real terminal data.

• Journal of the Korea Society for Simulation
• /
• v.18 no.2
• /
• pp.19-27
• /
• 2009

This paper addresses the berth allocation problem in naval ports. Navy vessels need various services such as emergency repair, missile loading, oil supply and many others while commercial vessels only unload and load container at the port. Furthermore, naval vessels have to shift frequently due to a limited capacity of the port. The objective of this paper is to minimize the total number of nesting vessels at the naval port. In other word, the objective is to maximize the total number of naval battleships engaging in the sea. A mixed integer programming(MIP) model is developed and experiments are conducted with ILOG CPLEX 11.0. We compare the computational results of the MIP model to the current scheduling approach by the ROK Navy. The results showed that MIP model performed well by minimizing the number of nesting vessels. and avoiding unnecessary shifts.

• Korean Journal of Construction Engineering and Management
• /
• v.12 no.1
• /
• pp.43-52
• /
• 2011

Unnecessary transportation of resources are one of the major causes that adversely affect construction site work productivity. Therefore, layout related studies have been conducted with efforts to develop management technologies and techniques to minimize the resource transportation made at site-level. However, although the necessity for floor-level layout planning studies has been increasing as buildings have become larger and floors have become more complicated, studies to optimize the transportation of materials inside buildings are currently not being actively conducted. Therefore, in this study, a model was developed using genetic algorithms(GA) that will enable the optimization of the locations of finishing materials on the work-floor. With the established model, the arrangement of diverse materials on complicated floors can be planned and the optimized material layout planning derived from the model can minimize the total material transportation time spent by laborers during their working day. In addition, to calculate travel distances between work sites and materials realistically, the concept of actual travel distances was applied. To identify the applicability of the developed model and compare it with existing methodologies and analyze it, the model was applied to actual high-rise residential complexes.

• Proceedings of the Korea Inteligent Information System Society Conference
• /
• 2000.11a
• /
• pp.247-256
• /
• 2000

오늘날의 기업은 상품을 판매하는 것 뿐만 아니라 기업의 신용과 이미지를 위해 그 상품에 대한 사후처리(After Service) 업무에 많은 투자를 하고 있다. 이러한 양질의 사후서비스를 고객에게 공급하기 위해서는 많은 인력을 합리적으로 관리해야 하고 요청되는 고장수리 서비스 업무를 빠르게 해결하기 위해서는 업무를 인력들에게 합리적으로 배정을 하고 회사의 비용을 최소화하면서 정해진 시간에 요청된 작업을 처리하기 위해서는 인력들에게 작업을 배정하고 스케줄링하는 문제가 발생된다. 본 논문에서는 이러한 문제를 해결하기 위해 화학계기의 A/S 작업을 인력에게 합리적으로 배정하는 스케줄링 시스템에 관한 연구이다. 먼저 스케줄링 모델을 HP 사의 화학분석 및 시스템을 판매, 유지보수 해 주는 "영진과학(주)"회사의 작업 스케줄을 분석하여 필요한 도메인과 고객서비스전략과 인력관리전략에서 제약조건을 추출하였고 여기에 스케줄링 문제를 해결하기 위한 방법으로 제약만족문제(CSP) 해결기법인 도메인 여과기법을 적용하였다. 도메인 여과기법은 제약조건에 의해 변수가 갖는 도메인의 불필요한 부분을 여과하는 것으로 제약조건과 관련되어 있는 변수의 도메인이 축소되는 것이다. 또한, 스케줄링을 하는데에 있어서 비용적인 측면에서의 스케줄링방법과 고객 만족도에서의 스케줄링 방법을 비교하여 가장 이상적인 해를 찾는데 트래이드오프(Trade-off)를 이용하여 최적의 해를 구했으며 실험을 통해 인력에게 더욱 효율적으로 작업들을 배정 할 수 있었고 또한, 정해진 시간에 많은 작업을 처리 할 수 있었으며 작업을 처리하는데 있어 소요되는 비용을 감소하는 결과를 얻을 수 있었다. 검증하였다.를, 지지도(support), 신뢰도(confidence), 리프트(lift), 컨빅션(conviction)등의 관계를 통해 다양한 방법으로 모색해본다. 이 연구에서 제안하는 이러한 개념계층상의 흥미로운 부분의 탐색은, 전자 상거래에서의 CRM(Customer Relationship Management)나 틈새시장(niche market) 마케팅 등에 적용가능하리라 여겨진다.선의 효과가 나타났다. 표본기업들을 훈련과 시험용으로 구분하여 분석한 결과는 전체적으로 재무/비재무적 지표를 고려한 인공신경망기법의 예측적중률이 높은 것으로 나타났다. 즉, 로지스틱회귀 분석의 재무적 지표모형은 훈련, 시험용이 84.45%, 85.10%인 반면, 재무/비재무적 지표모형은 84.45%, 85.08%로서 거의 동일한 예측적중률을 가졌으나 인공신경망기법 분석에서는 재무적 지표모형이 92.23%, 85.10%인 반면, 재무/비재무적 지표모형에서는 91.12%, 88.06%로서 향상된 예측적중률을 나타내었다.ting LMS according to increasing the step-size parameter $\mu$ in the experimentally computed. learning curve. Also we find that convergence speed of proposed algorithm is increased by (B+1) time proportional to B which B is the number of recycled data buffer without complexity

• Journal of Internet Computing and Services
• /
• v.1 no.2
• /
• pp.19-28
• /
• 2000

The scheduling problem in parallel processing systems has been a challenging research issue for decades. The problem is defined as finding an optimal schedule which minimizes the parallel execution time of an application on a target multiprocessor system. Duplication Based Scheduling (DBS) is a relatively new approach for solving the problem. The DBS algorithms are capable of reducing communication overhead by duplicating remote parent tasks on local processors. Most of DBS algorithms assume an availability of the unlimited number of processors in the system. Since the assumption may net hold in practice, the paper proposes a new scalable DBS algorithm for a target system with limited number of processors. It Is shown that the proposed algorithm with N available processors generates the same schedule as that obtained by the algorithm with unlimited number of processors, where N is the number of input tasks. Also, the performance evaluation reveals that the proposed algorithm shows a graceful performance degradation as the number of available processors in the system is decreased.

• KSCE Journal of Civil and Environmental Engineering Research
• /
• v.39 no.5
• /
• pp.631-636
• /
• 2019

Over the last decade, many researchers have investigated a number of vision-based construction object detection algorithms for the purpose of construction site monitoring. However, previous methods require the ground truth labeling, which is a process of manually marking types and locations of target objects from training image data, and thus a large amount of time and effort is being wasted. To address this drawback, this paper proposes a vision-based construction object detection framework that employs an active learning technique while reducing manual labeling efforts. For the validation, the research team performed experiments using an open construction benchmark dataset. The results showed that the method was able to successfully detect construction objects that have various visual characteristics, and also indicated that it is possible to develop the high performance of an object detection model using smaller amount of training data and less iterative training steps compared to the previous approaches. The findings of this study can be used to reduce the manual labeling processes and minimize the time and costs required to build a training database.

• Journal of the Korean Society of Marine Environment & Safety
• /
• v.21 no.6
• /
• pp.790-797
• /
• 2015

This study tried to evaluate the safety and economical benefit of Nitrox-diving by comparing with Air diving. We used actual diving data which was recorded in construction site of the Busan-Geoje fixed link immersed tunnel in 2010. The study method was to assort and analyze the diving data by divers, depth, breathing air, and diving table. Furthermore, the study examined the possibility of outbreak decompression sickness by comparing Nitrox diving and Air diving in no-decompression limit time, decompression time, working time. As a result, this study confirms that if certain diver breathe Nitrox for diving and oxygen for decompression, not only the risk of decompression sickness could be minimized, but also duration of decompression could be shortened. Moreover, it was estimated that a remarkable difference(more than 3 times) between actual duration of underwater construction period and virtual construction period by using air. As a result, the study confirmed that Nitrox diving is more efficient and economical than Air diving in physically limited and hazardous diving environment.