• The KIPS Transactions:PartD
• /
• v.13D no.4 s.107
• /
• pp.491-500
• /
• 2006

Since users want to have services correctly in their own position and surrounding circumstance in ubiquitous computing environment, it is very important to search, compose basic services and provide suitable services according to various circumstances. However existing techniques have been studied on service discovery mainly and lack consideration for position or preference of users. Furthermore, on service composition, they lists basic services simply and do not propose concretely method of use service history data for service composition. Therefore we propose a framework for context-based service provisioning middleware system, called COSEP, and Ontology engine with data ming. This research discovers services by reacting dynamically to circumstance information such as time and position of user, composites services using Ontology engine with data ming and offers newly created optimal services to users.

• Journal of the Korean Society of Hazard Mitigation
• /
• v.8 no.5
• /
• pp.53-58
• /
• 2008

This study presented a design model optimizing a distance of inlet with drainage pipe laid under the gutter in road. When the distance of inlet changed, a basin for the gutter divided by the distance of inlet and the inflow coming into the gutter would be changed. In this case, the change of inlet distance causes the change of a diameter of drainage pipe and slope because of the change of capacity. Therefore, the optimization is needed to design the combination of them for the distance of inlet. Genetic Algorithm is used to determine the optimal combination of them. The conditions of road and the precipitation were assumed like a real and the range of inlet distance adopted $10{\sim}30\;m$ which has been introduced in domestic. This model presented the optimal distance of inlet and the combination of pipe and slope through the minimum cost. The result of the study is that the optimal distance of inlet is different from each slope of road and it can reduce about 20% of total cost for the distance of inlet.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2006.11a
• /
• pp.81-84
• /
• 2006

다양한 멀티미디어 사용 환경 조건에 적합한 컨텐츠를 제공하기 위해서는 다양한 소비 환경을 반영할 수 있는 스케일러블 비디오의 제공이 필요하다. 이러한 스케일러블 비디오의 경우, 다양한 조합의 프레임 율, SNR, 공간해상도를 가지는 비디오가 가능하므로 사용자에 게 최적의 품질을 제공하는 조합을 결정해야 할 필요가 있다. 따라서 본 논문에서는 프레임율, SNR, 공간해상도 그리고 영상의 모션 속도에 따라 변동할 수 있는 영상 품질을 나타낼 수 있는 새로운 영상 품질 메트릭을 주관적 평가를 통하여 제안한다. 제안한 품질 메트릭은 주관적 품질평가 선호도와의 상관계수(correlation coefficient)가 PSNR과 주관적 품질평가 점수와의 상관계수 평균값에 비해 높은 값을 보였다. 본 논문에서 제안한 품질 메트릭은 다양한 조합의 부호화 조건에 따른 품질측정이 가능하여 제한적인 멀티미디어 소비환경에서 최적의 부호화 조건을 결정할 수 있다.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2013.10a
• /
• pp.761-764
• /
• 2013

Visiting k-combinations of a set S which has n elements is the general representation of many engineering problems. The performance of algorithms visiting all combinations, however, dramatically degrades with growing cases and the time to evaluate each combination. This paper presents the method to enhance the performance of these algorithms by a CUDA method. The experimental results show that the parallel algorithm running on GPU is approximately 900 times faster than the serial algorithm running on CPU.

• Proceedings of the Korean Information Science Society Conference
• /
• 2003.04c
• /
• pp.356-358
• /
• 2003

DNA microarray기술의 발달로 한꺼번에 수천 개 유전자의 발현 정보를 얻는 것이 가능해졌는데, 이렇게 얻어진 데이터를 효과적으로 분류하는 시스템을 만들어놓으면 새로운 샘플이 정상상태인지, 질병을 가진 상태인지 예측할 수 있다. 분류 시스템을 위하여 여러 가지 특징선택방법들과 분류기법들을 사용할 수 있는데, 모든 상황에서 항상 뛰어난 성능을 보이는 특징선택법이나 분류기를 찾기는 힘들다. 안정되고 개선된 성능을 내기 위해서 특징-분류기의 앙상블을 이용할 수 있는데, 앙상블에 이용될 수 있는 특징선택 방법이나 분류기의 수가 많다면, 앙상블을 만들 수 있는 조합이 많아지기 때문에, 모든 조합에 대하여 앙상블 결과를 구하기는 거의 불가능하다. 이를 해결하기 위하여 본 논문에서는 유전자알고리즘을 이용하여 모든 앙상블 결과를 계산하지 않으면서 최적의 앙상블을 찾아내는 방법을 제안하였으며, 실제로 림프종 암 데이터에 적용한 결과 100%의 결합결과를 보이는 최적의 앙상블을 효과적으로 찾아내었다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.39A no.3
• /
• pp.158-160
• /
• 2014

Recently, owing to the development of active array antenna techniques, various sector beams can be applied to the LTE systems with vertical sectorization. In this paper, we evaluate the system performance and suggest an optimum beam combination and parameters by using a system level simulator

• Proceedings of the Korea Information Processing Society Conference
• /
• 2001.10a
• /
• pp.585-588
• /
• 2001

현실 세계의 많은 조합 최적화 문제들은 변수들이 강하게 상호 작용함에 따라 만족해야하는 목표 함수가 매우 복잡하게 주어진다. 복잡한 목표 함수에는 많은 지역 최적해들이 존재하기 때문에 전역 최적해를 얻는 것은 엄청난 시간을 필요로 한다. 이러한 문제에 대해 해를 찾는 방법의 하나로 평균장 어닐링 알고리즘(MFA)이 있다. 본 논문에서는 기존의 이진 상태 공간에만 적용할 수 있었던 평균장 어닐링 알고리즘을 연속 상태 공간을 갖는 조합 최적화 문제에 적용할 수 있도록 알고리즘을 수정, 제안한다. 그리고 제안된 알고리즘을 제한된 연속 상태 공간을 가지는 단순 회귀 모델의 D-최적 설계에 적용하였다. 실험결과 제안된 알고리즘이 시뮬레이티드 어닐링 알고리즘(SSA)과 비교하여 비슷한 수준의 결과를 내면서도 계산 속도면에서는 수 배 정도의 빠른 좋은 결과를 얻었다.

• Journal of Korean Society of Transportation
• /
• v.23 no.3 s.81
• /
• pp.35-47
• /
• 2005

This paper is to review a literature concerning Bus Transit Route Network Design(BTRNDP), to describe a future study direction for a systematic application for the BTRNDP. Since a bus transit uses a fixed route, schedule, stop, therefore an approach methodology is different from that of auto network design problem. An approach methodology for BTRNDP is classified by 8 categories: manual & guideline, market analysis, system analytic model. heuristic model. hybrid model. experienced-based model. simulation-based model. mathematical optimization model. In most previous BTRNDP, objective function is to minimize user and operator costs, and constraints on the total operator cost, fleet size and service frequency are common to several previous approach. Transit trip assignment mostly use multi-path trip assignment. Since the search for optimal solution from a large search space of BTRNDP made up by all possible solutions, the mixed combinatorial problem are usually NP-hard. Therefore, previous researches for the BTRNDP use a sequential design process, which is composed of several design steps as follows: the generation of a candidate route set, the route analysis and evaluation process, the selection process of a optimal route set Future study will focus on a development of detailed OD trip table based on bus stop, systematic transit route network evaluation model. updated transit trip assignment technique and advanced solution search algorithm for BTRNDP.

• Journal of the Korean Society for Aeronautical & Space Sciences
• /
• v.37 no.11
• /
• pp.1104-1111
• /
• 2009

In the low altitude, mission of the aircraft is restricted by a variety of threats such as anti-air missiles and terrain obstacles. Especially, aircraft have always a risk of ground collision near terrain. In this study, to effectively solve this problem, we developed the flight path generation algorithm that is considered the terrain avoidance. In this flight path generation algorithm, waypoints that should be passed by the UAV are selected first. The waypoints are located in the middle of the terrain obstacles. Then, physically meaningful waypoints sets are classified by Dijkstra algorithm. The optimal waypoint guidance law based on the optimal control theory is applied to produce trajectory candidates. And finally the minimum control energy trajectory is determined.

• KSBB Journal
• /
• v.15 no.2
• /
• pp.174-180
• /
• 2000

Pichia pastoris and Hansenula polymorpha, the methylotrophic yeasts have been widely used as a host for the production of e eudaryotic proteins due to the advantages related to their inherited characters. This paper describes the method to enhance t the productivity of recombinant proteins by P. pastoris and H. po$\psi$morpha. In the production of recombinant proteins using a f fed batch fermentation system, the effects of specific growth rate on the specific expression rate of re$\infty$mbinant proteins w were studied. In both species, the expression system of recombinant proteins using the fed batch fermentation was optimezed.