An efficient heuristic for two-vehicle-one-depot problems is developed in this research. Vehicle moving speeds are various along hour based time intervals due to traffic jams of rush hours. Two different heuristics are examined. One is that the delivery area assignment is made using Sweep algorithm for two vehicles by splitting the whole area in half to equally divide all delivery points. The other is using common area by leaving unassigned area between the assigned for two vehicles. The common area is reassigned by two stages to balance the completion time of two vehicle's delivery. The heuristic with common area performed better than the other due to various vehicle moving speeds and traffic jams.

Autoimmune pancreatitis should be differentiated from pancreatobiliary cancers because they often have similar clinical features and images. Accurate and practical diagnostic algorithm for AIP is important to avoid unnecessary surgery and delayed treatment. International Consensus Diagnostic Criteria for AIP suggested that diagnostic algorithms and the practical patterns considerably vary worldwide. Patients with clinically suspected AIP can be categorized into patients with typical features of AIP and patients with indeterminate features based on CT findings. Serology and other organ involvement can be used as collateral evidence of AIP. If a patient presents with diffuse pancreatic enlargement but is lack of collateral evidence, pancreatogram could be useful. If a patient has obstructive jaundice, biliary drainage and endobiliary biopsy are recommended. Duodenal papillary biopsy for IgG4 immunostain can be used during ERCP. In case of atypical imaging findings, EUS-guided FNA/biopsy is recommended to exclude pancreatic cancer and to obtain the suggestive findings of AIP. If type 2 is clinically suspected, EUS-guided core biopsy is required for the definite diagnosis. Short-term steroid trial can be performed to confirm the diagnosis of AIP when pancreatobiliary cancer workup shows negative results. However, clinical practice in diagnosing AIP varies depending on the local expertise, facilities, cost, prevalence of AIP and its subtypes.

Due to growth of electronics and control devices, automation and situational awareness systems have been applied by automobile. Vision systems with the introduction of unmanned system were being actively developed. In this paper, the distortion in the 7-inch LCD screen for the treatment process are divided into Online and Offline processing. Offline processing based on the image signal processing and for generating LUT Online to Offline generated by processing the distortion is applied to the LUT. LUT is applied to distort the image processing in real time, so that distortion correction is made for the purpose of setting.

The aim of this study is to design an intelligent pattern-based real-time trading system (PRTS) using rough set analysis of technical indicators, dynamic time warping (DTW), and genetic algorithm in stock futures market. Rough set is well known as a data-mining tool for extracting trading rules from huge data sets such as real-time data sets, and a technical indicator is used for the construction of the data sets. To measure similarity of patterns, DTW is used over a given period. Through an empirical study, we identify the ideal performances that were profitable in various market conditions.

This study develops a dynamic scheduling model for parallel machine scheduling problem based on genetic algorithm (GA). GA combined with discrete event simulation to minimize the makespan and verifies the effectiveness of the developed model. This research consists of two stages. In the first stage, work sequence will be generated using GA, and the second stage developed work schedule applied to a real work area to verify that it could be executed in real work environment and remove the overlapping work, which causes bottleneck and long lead time. If not, go back to the first stage and develop another schedule until satisfied. Small size problem was experimented and suggested a reasonable schedule within limited resources. As a result of this research, work efficiency is increased, cycle time is decreased, and due date is satisfied within existed resources.

We present an improved sketch-based image search technique through which users can search their target images from the images in database. This technique can be used in constructing an efficient game development framework. Our basic approach is to search the database by comparing the user-created sketch with the graph extracted from the images in the database and estimating the similarity. The images of high similarities are suggested as the candidates that match the target image. To improve the accuracy of the matching process, we substitute the graph-based representation of images with vectorized coherent lines, which are known as one of the most precise schemes in extracting and describing important features in an image. By the experiments on 820 images of 32 categories, we prove that our scheme shows higher matching accuracy than the existing schemes.

효율적인 악취관리를 위해서는 민원지역에서 발생한 악취를 분류하고, 그 악취원을 분 석해야 한다. 이를 위해서는 민원지역에서 발생한 악취를 나타낼 수 있는 악취대표패턴과 악취원의 냄새가 필요하다. 이에 본 논문에서는 민원지역의 악취분류를 위해 k-mean 알고리즘을 이용하여 악취데이 터에 대한 군집화를 수행하였다. 그 결과 생성된 악취대표패턴과 미리 측정된 악취원별 냄새와의 유사도를 비교하여 악취에 대한 분류를 수행하였다. 또한, 대기 중에서 여러 악 취가 섞였을 경우를 고려하여 non-negative least square를 이용하여 해당 악취에 대해 책임 이 있는 하나 이상의 악취원과 기여도를 추적하였다. 이러한 본 연구의 성과는 악취 관련 민원해결에 기여할 것으로 사료된다.

본 연구에서는 기존의 블록 조립 후 정도 계산 절차와 블록 조립의 특성을 고려한 최적 정도 계산 알고리즘 개발을 위한 연구를 수행하였다. 여기서 제안된 알고리즘은 생산관리점들 중 특정한 관리점을 기준으로 생산관리점들의 설계와 측정 데이터 사이의 평균제곱근 오차의 합을 목적함수로 가진다. 생산관리점들은 접합면 상의 데이터와 그 외의 데이터로 구분하였으며, 구분된 데이터는 정합 과정에서 사용되어지는 6가지 자유도 조합 결정에 있어 다양한 제약조건 구성과 목적함수 계산에 사용하였다. 목적함수 및 제약조건과 함께 탑재공정을 고려하여 설계와 측정 계산 대상점 들 간의 오차가 허용 오차 이내에 포함되는지를 확인하는 과정이 포함되는 점과 점 관계를 이용하는 변형 ICP 알고리즘과 sampling법을 혼합하여 최소 오차 범위를 계산하는 최적 정도 계산 알고리즘을 개발하였다. 실제 공정에서 확인된 블록 측정 데이터를 개발된 알고리즘에 적용한 결과에 따르면 최적 정도 계산의 대상점은 접합면 상의 점들만으로 계산을 수행하는 것보다 전체 점을 대상으로 계산하는 것이 더 작은 오차를 가지며 접합면의 한 점을 고정된 일치점으로 두고 모든 생산관리점들을 대상점으로 계산 하는 것이 최소 오차를 가지는 최적 정도 계산방법이라는 결론을 도출하였다.

A multi-input single-output (MISO) semi-active control systems were studied by many researchers. For more improved vibration control performance, a structure requires more than one control device. In this paper, multi-input multi-output (MIMO) semi-active fuzzy controller has been proposed for vibration control of seismically excited small-scale buildings. The MIMO fuzzy controller was optimized by multi-objective genetic algorithm. For numerical simulation, five-story example building structure is used and two MR dampers are employed. For comparison purpose, a clipped-optimal control strategy based on acceleration feedback is employed for controlling MR dampers to reduce structural responses due to seismic loads. Numerical simulation results show that the MIMO fuzzy control algorithm can provide superior control performance to the clipped-optimal control algorithm.

Release planning in a software product line (SPL) is to select and assign the features of the multiple software products in the SPL in sequence of releases along a specified planning horizon satisfying the numerous constraints regarding technical prece- dence, conflicting priorities for features, and available resources. A greedy genetic algorithm is designed to solve the problems of release planning in SPL which is formulated as a precedence-constrained multiple 0-1 knapsack problem. To be guaranteed to obtain feasible solutions after the crossover and mutation operation, a greedy-like heuristic is developed as a repair operator and reflected into the genetic algorithm. The performance of the proposed solution methodology in this research is tested using a fractional factorial experimental design as well as compared with the performance of a genetic algorithm developed for the software release planning. The comparison shows that the solution approach proposed in this research yields better result than the genetic algorithm.

본 논문에서는 유전알고리즘을 사용하여 철근콘크리트 구조물의 최적 지진설계를 효율적으로 수행하기 위해 클러스터를 사용하는 경우 확장성을 확인하였다. 클러스터를 구성하는 코어프로세서의 개수를 증가시키면서 유전알고리즘의 각 세대에 소요되는 시간의 감소를 관찰하였다. 단일 퍼스널 컴퓨터의 구성을 분류한 후, wall-clock time과 암달의 법칙으로 예상된 값을 비교하여 예상되었던 병목현상을 확인하였다. 이에 클러스터의 확장성에서 복합적인 요인에 의한 경향을 확인할 수 있었다. 병목현상의 물리적인 요인과 알고리즘 측면에서의 요인을 구분하기 위해 유전알고리즘의 개채수를 나누어 실험을 수행하여 결과를 확인하였다.

To ensure that the production system of a factory is efficient, the factory layout design should consider the location and material flow plans of facilities, workshops, and storage areas. Highly productive factories need to have an optimized layout planning process, and a customized design methodology of the production system is a necessity for feasible layout planning. This paper presents a method for designing a layout module's size and shape and provides a heuristic location-allocation algorithm for the modules. The method is implemented and validated using a rich internet application-based platform. The layout design method is based on the leisure ship production process; this method can be used for designing the layout of a new factory or remodeling an existing factory and its production system. In contrast to existing layout methods, the inputs required for the proposed method, such as target products, production processes, and human-resource plans, are simple. This layout design method provides a useful solution for the initial stage of factory design.

최근 국내에 많이 보급되고 있는 이류체 포그 냉방시스템의 효율적인 제어알고리즘을 개발하기 위하여 다양한 조건의 분무사이클을 설정하여 토마토재배 온실에서 냉방실험을 실시하였다. 냉방효과는 평균 1.2~4.0℃를 보였고, 냉방효율은 평균 8.2~32.9%로 나타났다. 분무간격에 따른 실험에서 90초 분무사이클의 냉방효율이 가장 높았고, 대체로 분무시간이 길수록, 정지시간이 짧을수록 냉방효율이 높게 나타났다. 이류체 포그시스템의 분무량이 증가할수록 냉방효율이 높아지는 경향을 찾을 수 있었다. 그러나 분무량을 증가시키더라도 내부공기가 포화상태에 가까워지면 더 이상 증발이 일어나지 않으므로 내부공기가 포화상태에 도달하기 전까지 분무량을 증대시키는 방법으로 냉방효율을 높일 수 있을 것으로 판단된다. 냉방효율이 증가함에 따라 실내공기의 포차는 감소하였고 실내외 절대습도 차이는 증가하는 경향을 보였다. 포그의 증발량이 증가할수록 실내와 실외의 절대습도 차이는 커지고, 이에 따라 환기에 의한 수증기 배출이 잘 되어 다시 증발효율을 상승시키므로 냉방효율이 높아지는 순환구조를 갖게 되는 것으로 판단된다. 분무시간과 정지시간에 따른 실내공기의 포차변화를 회귀분석한 결과 10g·kg-1의 포차 변화에 필요한 분무시간은 120초, 정지시간은 60초로 나타났다. 그러나 온도의 진동폭을 줄이고 냉방효율을 높이기 위해서는 포차의 변동범위를 5g·kg-1으로 설정하여 60초 분무, 30초 정지가 더 적당할 것으로 판단된다. 이류체 포그시스템의 제어방식을 컴퓨터 제어시스템과 현재 보급되고 있는 간편제어시스템으로 분류하여 제어알고리즘을 유도하였다. 자연환기 온실에서 간편 제어시스템을 사용한다면 분무사이클을 60초 on, 30초 off로 설정하고 온도하한은 30~30~32℃, 습도상한은 85~90%로 설정할 것을 제안한다.

Reduction of microvibration is regarded as important in high-technology facilities with high precision equipments. In this paper, smart control technology is used to improve the microvibration control performance. Mr damper is used to make a smart base isolation system amd fuzzy logic control algorithm is employed to appropriately control the MR damper. In order to develop optimal fuzzy control algorithm, a multi-objective genetic algorithm is used in this study. As an excitation, a train-induced ground acceleration is used for time history analysis and three-story example building structure is employed. Microvibration control performance of passive and smart base isolation systems have been investigated in this study. Numerical simulation results show that the multi-objective genetic algorithm can provide optimal fuzzy logic controllers for smart base isolation system and the smart control system can effectively reduce microvibration of a high-technology facility subjected to train-induced excitation.

In this paper, we proposed a new method for the determination of strategies that are required in a continuous optimization algorithm based on the fictitious play theory. In order to apply the fictitious play theory to continuous optimization problems, it is necessary to express continuous values of a variable in terms of discrete strategies. In this paper, we proposed a method in which all strategies contain an equal number of selected real values that are sorted in their magnitudes. For comparative analysis of the characteristics and performance of the proposed method of representing strategies with respect to the conventional method, we applied the method to the two types of benchmarking functions: separable and inseparable functions. From the ex- perimental results, we can infer that, in the case of the separable functions, the proposed method not only outperforms but is more stable. In the case of inseparable functions, on the contrary, the performance of the optimization depends on the benchmarking functions. In particular, there is a rather strong correlation between the performance and stability regardless of the benchmarking functions.

Control allocation is an important part of a system. It implements the function that map the desired command forces from the controller into the commands of the different actuators. In this paper, the authors present an approach for solving constrained control allocation problem in vessel system by using multi-parametric quadratic programming (mp-QP) algorithm. The goal of mp-QP algorithm applied in this study is to compute a solution to minimize a quadratic performance index subject to linear equality and inequality constraints. The solution can be pre-computed off-line in the explicit form of a piecewise linear (PWL) function of the generalized forces and constrains. The efficiency of mp-QP approach is evaluated through a dynamic positioning simulation for a vessel by using four tugboats with constraints about limited pushing forces and found to work well.

Inter-granular Bright Points (igBPs) are small-scale objects in the Solar photosphere which can be seen within dark inter-granular lanes. We present a new algorithm to automatically detect and extract igBPs. Laplacian and Morphological Dilation (LMD) technique is employed by the algorithm. It involves three basic processing steps: (1) obtaining candidate "seed" regions by Laplacian; (2) determining the boundary and size of igBPs by morphological dilation; (3) discarding brighter granules by a probability criterion. For validating our algorithm, we used the observed samples of the Dutch Open Telescope (DOT), collected on April 12, 2007. They contain 180 high-resolution images, and each has a 85×68arcsec2 85×68arcsec2 field of view (FOV). Two important results are obtained: first, the identified rate of igBPs reaches 95% and is higher than previous results; second, the diameter distribution is 220±25km 220±25km , which is fully consistent with previously published data. We conclude that the presented algorithm can detect and extract igBPs automatically and effectively.

It has been recognized as an important issue to design optimally a firm's logistics network for minimizing logistics cost and maximizing customer service. It is, however, not easy to get an optimal solution by analyzing trade-off of cost factors, dynamic and interdependent characteristics in the logistics network decision making. Although there has been some developments in a system which helps decision making for logistics analysis, it is true that there is no system for enterprise-wise's on-site support and methodical logistics decision. Specially, E-biz process along with information technology has been made dramatic advance in a various industries, there has been much need for practical education closely resembles on-site work. The software developed by this study materializes efficient algorithm suggested by recent studies in key topics of logistics such as location and allocation problem, traveling salesman problem, and vehicle routing problem and transportation and distribution problem. It also supports executing a variety of experimental design and analysis in a way of the most user friendly based on Java. In the near future, we expect that it can be extended to integrated supply chain solution by adding decision making in production in addition to a decision in logistics.

Release planning for incremental software development is to select and assign features in sequence of releases along a specified planning horizon. It includes the technical precedence inherent in the features, the conflicting priorities as determined by the representative stakeholders, and the balance between required and available resources. The complexity of this consideration is getting more complicated when planning releases in software product lines. The problem is formulated as a precedence-constrained multiple 0-1 knapsack problem. In this research a genetic algorithm is developed for solving the release planning problems in software product lines as well as tests for the proposed solution methodology are conducted using data generated randomly.