• 한국시뮬레이션학회:학술대회논문집
• /
• 한국시뮬레이션학회 1997년도 춘계 학술대회 발표집
• /
• pp.93-99
• /
• 1997

Most of the past studies on FMS scheduling problems may be classified into two classes, namely off-line scheduling and on-line scheduling approach. The off-line scheduling methods are used mostly for FMS planning purposes and may not be useful real time control of FMSs, because it generates solutions only after a relatively long period of time. The on-line scheduling methods are used extensively for dynamic real-time control of FMSs although the performance of on-line scheduling algorithms tends vary dramatically depending on various configurations of FMS. Current study is about finding a better on-line scheduling rules for FMS operations. In this study, we propose a method to create priority functions that can be used in setting relative priorities among jobs or machines in on-line scheduling. The priority functions reflect the configuration of FMS and the user-defined objective functions. The priority functions are generated from diverse dispatching rules which may be considered a special priority functions by themselves, and used to determine the order of processing and transporting parts. Overall system of our work consists of two modules, the Priority Function Evolution Module (PFEM) and the FMS Simulation Module (FMSSM). The PFEM generates new priority functions using input variables from a terminal set and primitive functions from a function set by genetic programming. And the FMSSM evaluates each priority function by a simulation methodology. Based on these evaluated values, the PFEM creates new priority functions by using crossover, mutation operation and probabilistic selection. These processes are iteratively applied until the termination criteria are satisfied. We considered various configurations and objective functions of FMSs in our study, and we seek a workable solution rather than an optimum or near optimum solution in scheduling FMS operations in real time. To verify the viability of our approach, experimental results of our model on real FMS are included.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제16권6호
• /
• pp.2060-2073
• /
• 2022

Cloud Computing permits users to access vast amounts of services of computing power in a virtualized environment. Providing secure services is essential. There are several problems to real-world optimization that are dynamic which means they tend to change over time. For these types of issues, the goal is not always to identify one optimum but to keep continuously adapting to the solution according to the change in the environment. The problem of scheduling in Cloud where new tasks keep coming over time is unique in terms of dynamic optimization problems. Until now, there has been a large majority of research made on the application of various Evolutionary Algorithms (EAs) to address the issues of dynamic optimization, with the focus on the maintenance of population diversity to ensure the flexibility for adapting to the changes in the environment. Generally, trust refers to the confidence or assurance in a set of entities that assure the security of data. In this work, a dynamic optimization technique is proposed to find an optimal trust weights in cloud during scheduling.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 2005년도 제36회 하계학술대회 논문집 D
• /
• pp.2531-2533
• /
• 2005

The proposed neural network technique is the real time computation method based theory of inter-node diffusion for searching the safety distances from the sudden appearance-objects during the work driving. The main steps of the distance computation using the theory of stereo vision like the eyes of man is following steps. One is the processing for finding the corresponding points of stereo images and the other is the interpolation processing of full image data from nonlinear image data of objects. All of therm request much memory space and time. Therefore the most reliable neural-network algorithm is drived for real-time matching of obejects, which is composed of a dynamic programming algorithm based on sequence matching techniques in moving objects.

• 방송공학회논문지
• /
• 제15권4호
• /
• pp.555-562
• /
• 2010

DTV 방송이 개시된 이후로 방송망의 비디오, 오디오 및 채널 정보들을 제외한 나머지 대역폭에 부가 정보를 전송하여 데이터 방송 등과 같은 서비스를 제공하고자 하는 노력이 있었다. 최근에는 이러한 대역폭에 장시간 동안 VOD 콘텐츠를 전송하여 수신기에 저장시키는 방법으로 콘텐츠를 제공하는 Push-VOD 서비스가 주목을 받고 있으며, ATSC에서도 NRT(Non-Real-Time)[1]라는 이름으로 해당 전송 방법을 규격화하는 작업을 진행하고 있다. 그러나 이러한 방식으로 콘텐츠를 전송할 때 DTV 수신환경이나 수신기의 문제 등으로 인해 한 번의 전송만으로는 콘텐츠가 에러없이 전송되지 않을 확률이 높다. 따라서 이를 극복하기 위해서는 방송망의 단방향적 특성상 콘텐츠를 여러 번 반복 전송하여 전송 신뢰도를 높여야 한다. 본 논문에서는 단방향 전송환경인 방송망으로 제한된 시간 내에 여러 콘텐츠를 수신기로 전송하고자 할 때, 마르코프 연쇄 모델링과 동적 계획 기법을 이용하여 전송된 콘텐츠들의 에러를 최소화하는 콘텐츠들의 최적 반복 전송 횟수를 구하는 방법을 제안한다.

• 대한산업공학회지
• /
• 제37권4호
• /
• pp.331-341
• /
• 2011

This paper considers an inbound lot-sizing and outbound dispatching problem for a single product in a thirdparty logistics (3PL) distribution center. Demands are dynamic and finite over the discrete time horizon, and moreover, each demand has a delivery time window which is the time interval with the dates between the earliest and the latest delivery dates All the product amounts must be delivered to the customer in the time window. Ordered products are shipped by multiple vehicle types and the freight cost is proportional to the vehicle-types and the number of vehicles used. First, we formulate a mixed integer programming model. Since it is difficult to solve the model as the size of real problem being very large, we design a conventional genetic algorithm with a local search heuristic (HGA) and an improved genetic algorithm called adaptive genetic algorithm (AGA). AGA spontaneously adjusts crossover and mutation rate depending upon the status of current population. Finally, we conduct some computational experiments to evaluate the performance of AGA with HGA.

• 대한전자공학회논문지SP
• /
• 제48권5호
• /
• pp.63-71
• /
• 2011

본 논문에서는 영상이 가지는 컨텐츠를 보호하면서 영상의 크기를 실시간으로 변환하는 영상 리타겟팅 방법에 대하여 제안한다. 기존의 컨텐츠 기반의 영상 리타겟팅 기법인 seam carving은 영상의 크기 조절 시 다이나믹 프로그래밍(Dynamic Programming) 기법을 사용하기 때문에 반복적인 누적 최소 에너지 맵의 갱신 과정이 반드시 필요하다. 이 갱신 과정에서 전체 영상을 탐색해야 하므로 많은 연산량이 요구되며, 이로 인한 처리 시간 지연이 불가피하다. 제안하는 방법은 이러한 누적 최소 에너지 맵의 갱신으로 인한 처리 시간 지연을 개선하기 위하여, 우선 계산된 누적 최소 에너지 맵에서 seam이 될 수 있는 모든 후보들이 영향을 미치는 영역을 계산한다. 이 후보들의 영역을 이용하여 여러 개의 seam을 동시에 추출함으로써 누적 최소 에너지 맵의 갱신 횟수가 줄어들기 때문에, 전체 연산량이 줄어들어 빠른 처리가 가능하면서도 영상의 화질은 기존의 seam carving 기법과 비슷하게 유지할 수 있다. 실험 결과는 제안하는 방법이 영상이 가지고 있는 컨텐츠를 보존하면서 실시간으로 영상의 크기를 조절할 수 있음을 보여준다.

• 한국경영과학회지
• /
• 제25권4호
• /
• pp.97-109
• /
• 2000

This work proposes a neural network approach to solve vehicle routing problems which have diverse application areas such as vehicle routing and robot programming. In solving these problems, classical mathematical approaches have many difficulties. In particular, it is almost impossible to implement a real-time vehicle routing with multiple vehicles. Recently, many researchers proposed methods to overcome the limitation by adopting heuristic algorithms, genetic algorithms, neural network techniques and others. The most basic model for path planning is the Travelling Salesman Problem(TSP) for a minimum distance path. We extend this for a problem with dynamic upcoming of new positions with multiple vehicles. In this paper, we propose an algorithm based on SOM(Self-Organization Map) to obtain a sub-optimal solution for a real-time vehicle routing problem. We develope a model of a generalized multiple TSP and suggest and efficient solving procedure.

• 정보처리학회논문지A
• /
• 제8A권1호
• /
• pp.70-74
• /
• 2001

A general web-based remote lecture system uses video data and audio data to provide synchronize between teacher and students. This system requires high bandwidth, high speed networking, television, compression and computing technologies between server and client for remote lecture over Internet. As a result, this system can decrease an efficiency for lecturing over current Internet. So, this paper proposes a new mechanism calling as ‘Synchronization of WWW browsers between server and client’to cope with above problems and finally pursues low cost needed for real-time remote lecture over Internet. The mechanism means that every browser of teacher and students displays the same page and the action of teacher is transferred to the browser of student. And, this can be implemented by Windows hooking APIs, Memory Mapping, and DLL (Dynamic Link Library) programming technology. This paper points to the design and implementation of LAS (Lecture Assistant Server) and LAC (Lecture Assistant Client) to perform the synchronization between server and client.

• Journal of Information Technology Applications and Management
• /
• 제17권1호
• /
• pp.141-155
• /
• 2010

We develop an intelligent information system in a multilayer electronic supply chain network. Using the internet for supply chain management (SCM) is a key interest for contemporary managers and researchers. It has been realized that the internet can facilitate SCM by making real time information available and enabling collaboration between trading partners. Here, we propose a multi-agent system to analyze the performance of the elements of a supply network based on the attributes of the information flow. Each layer consists of elements which are differentiated by their performance throughout the supply network. The proposed agents measure and record the performance flow of elements considering their web interactions for a dynamic route selection. A dynamic programming approach is applied to determine the optimal route for a customer in the end-user layer.

• 한국정보과학회논문지:시스템및이론
• /
• 제32권7호
• /
• pp.377-392
• /
• 2005

컴퓨터 시스템이 등장한 이후 시스템 성능을 측정하고 분석하기 위한 많은 연구가 시스템 모델링, 성능 측정, 감시, 그리고 성능 예측 등 여러 분야에서 진행되었다. 그럼에도 불구하고, 각 성능 관련 분야를 하나로 묶는 통합 프레임워크에 관한 연구는 거의 이루어지지 않았다. 특히 TMO(Time-Triggered Message-Triggered Object) 실시간 프로그래밍 모델의 경우, 간단한 감시 도구를 제외하고 성능 측정 도구나 분석 프레임워크가 없어, TMO 모델 기반 시스템 및 태스크를 분석하는데 어려움이 있다. 이에 따라, 본 논문에서는 TMO 모델 기반의 동적 분석 프레임워크인 TDAF(TMO based Dynamic Analysis Framework)를 제안한다. TDAE는 성능 측정 및 분석 단계를 전체적으로 다루며, 구성 요소인 부하 모델, 성능 모델, 그리고 보고 모델을 유기적으로 결합하여 보다 신뢰할 수 있는 정보를 개발자에게제공한다. 이를 지원하기 위해 기존 부하 모델에 TMO 모델을 결합하여 확장한 부하 모델을 제안하고, TMO 객체 부하를 파악할 수 있는 부하 계산 알고리즘을 제안한다. 또한 TMO 객체 부하를 고려하여 성능 측정지수를 구현한 성능 알고리즘과, 부하 및 성능을 기초로 실시간 태스크의 주기 및 데드라인을 도출할 수 있는 보고 모델과 알고리즘을 제안한다. 마지막으로 부하 계산 알고리즘의 타당성을 입증하기 위한 실험을 수행하고 그 결과를 제시한다.