• 한국철도학회:학술대회논문집
• /
• 한국철도학회 2007년도 추계학술대회 논문집
• /
• pp.1451-1455
• /
• 2007

MAGLEV(Magnetic Levitation) with Middle-low speed be classified as a kind of LRT(Light Rail Transit) in KOREA. Also this vehicle has adopted LIM propulsion method. The MAGLEV has adopted LIM type in operational or developing model in the world. The power rail of LIM is very similar with the 3th rail of LRT in the functional property but the structure and shape of power rail is different with that. WE have to search the optimal power rail system for Korean MAGLEV vehicle. In this paper, we suggest the conceptual design and direction of design for power rail of Korean MAGLEV developing.

• 한국산업정보학회논문지
• /
• 제11권5호
• /
• pp.163-169
• /
• 2006

In order to use parallel computers in specific applications, algorithms need to be developed and mapped onto parallel computer architectures. Main memory access for shared memory system or global communication in message passing system deteriorate the computation speed. In this paper, it is found that the m-step generalization of the block Lanczos method enhances parallel properties by forming in simultaneous search direction vector blocks. QR factorization, which lowers the speed on parallel computers, is not necessary in the m-step block Lanczos method. The m-step method has the minimized synchronization points, which resulted in the minimized global communications and main memory access compared to the standard methods.

• 제어로봇시스템학회논문지
• /
• 제12권5호
• /
• pp.444-449
• /
• 2006

Path planning is a key element in navigation of a mobile robot. Several algorithms such as a gradient method have been successfully implemented so for. Although the gradient method can provide the global optimal path, it computes the navigation function over the whole environment at all times, which result in high computational cost. This paper proposes a high-speed path planning scheme, called a gradient method with topological information, in which the search space for computation of a navigation function can be remarkably reduced by exploiting the characteristics of the topological information reflecting the topology of the navigation path. The computing time of the gradient method with topological information can therefore be significantly decreased without losing the global optimality. This reduced path update period allows the mobile robot to find a collision-free path even in the dynamic environment.

• 한국지능시스템학회:학술대회논문집
• /
• 한국퍼지및지능시스템학회 2002년도 추계학술대회 및 정기총회
• /
• pp.399-405
• /
• 2002

요즈음에는 GPS 및 GIS을 기반으로, 운전자에게 최단 경로탐색 및 예상도착시간을 인터넷 및 휴대폰으로 검색할 수 있다. 그러나, 아무리 좋은 자동항법 장치도 평균차량속도가 10-20 Km 일 때에는 최단경로를 생성할 수 없다. 그러므로 승용차대기시간과 평균차량속도를 개선하기 위해서, 서로 다른 교차로 길이 및 교차로 차선수 일때에도, 퍼지 적응 규칙을 이용한 최적녹색시간 알고리즘을 제안한다. 본 논문에서는 인터넷을 이용해서 위험한 도로, 공사중인 도로 및 목적지 예상도착시간 및 최적의 교통상황을 예보하는 기능을 제공할 수 있도록 하였다.

• Journal of Information Processing Systems
• /
• 제11권3호
• /
• pp.389-405
• /
• 2015

Most traditional database systems exploit a record-oriented model where the attributes of a record are placed contiguously in a hard disk to achieve high performance writes. However, for read-mostly data warehouse systems, the column-oriented database has become a proper model because of its superior read performance. Today, flash memory is largely recognized as the preferred storage media for high-speed database systems. In this paper, we introduce a column-oriented database model based on flash memory and then propose a new column-aware flash indexing scheme for the high-speed column-oriented data warehouse systems. Our index management scheme, which uses an enhanced $B^+$-Tree, achieves superior search performance by indexing an embedded segment and packing an unused space in internal and leaf nodes. Based on the performance results of two test databases, we concluded that the column-aware flash index management outperforms the traditional scheme in the respect of the mixed operation throughput and its response time.

• 전기학회논문지
• /
• 제61권7호
• /
• pp.944-949
• /
• 2012

As modern power systems become large and complicated, the automated voltage and reactive power control system is required in most developed countries due to the recent amazing progress of computer net works and information thechnology. So far the voltage control has been depend on human operator in korean power system. This paper presents an intelligent voltage control system based on sensitivity analysis and artificial intelligence technology. Detailed state space modeling technique is discussed and a new performance index is proposed to speed up the searching performance of the expert system. As the searching strategy is very important factor of the speed of expert system the least first search algorithm is applied using this performance index. The intelligent voltage control system is applied to the Jeju power system. As a result, case studies showed a promissing application of the intelligent voltage control system.

• 한국정밀공학회지
• /
• 제20권3호
• /
• pp.112-119
• /
• 2003

This paper presents the identification of rotor dynamic parameters. The solution of the system equation can be obtained using least square method. The sensitivity analysis is performed to extract optimized solution, which is considered to be insensitive to inherent measurement errors. The cosine and sine term of orbit shapes can be obtain ed through the by experiment of the orbit analysis at a different speed after doing orbit analysis at an arbitrary selected speed. This values measured time domain are used to search the stiffness and damping coefficients of rotor bearing.

• 한국소음진동공학회:학술대회논문집
• /
• 한국소음진동공학회 1996년도 추계학술대회논문집; 한국과학기술회관, 8 Nov. 1996
• /
• pp.313-318
• /
• 1996

In this paper, a parametric study of the unbalance response and the stability is carried out to show the influence of seal parameters on the response of rotor. The seal parameters optimized are the seal clearance and the seal length. The minimum quantity of a Q factor in the critical speed and the maximum quantity of a logarithmic decreement in the operating speed, avoiding the reign of resonance, are the objective function. This paper describes a new approach to find a seal parameter of rotor system. The optimization method is used genetic algorithms, which are search algorithms based on the mechanics of natural selection and natural genetics. The results show the capability of this method and indicate that an optimal design of seals can improve the unbalance and the stability of rotor.

• 대한원격탐사학회지
• /
• 제16권2호
• /
• pp.145-156
• /
• 2000

Clustering is the process of partitioning a data set into meaningful clusters. As the data to process increase, a laster algorithm is required than ever. In this paper, we propose a clustering algorithm to partition a multispectral remotely sensed image data set into several clusters using a hash search algorithm. The processing time of our algorithm is compared with that of clusters algorithm using other speed-up concepts. The experiment results are compared with respect to the number of bands, the number of clusters and the size of data. It is also showed that the processing time of our algorithm is shorter than that of cluster algorithms using other speed-up concepts when the size of data is relatively large.

• 국제학술발표논문집
• /
• The 6th International Conference on Construction Engineering and Project Management
• /
• pp.656-657
• /
• 2015

Recently, Multi-Objective Optimization of design elements is an important issue in building design. Design variables that considering the specificities of the different environments should use the appropriate algorithm on optimization process. The purpose of this study is to compare and analyze the optimal solution using three evolutionary algorithms and energy modeling simulation. This paper consists of three steps: i)Developing three evolutionary algorithm model for optimization of design elements ; ii) Conducting Multi-Objective Optimization based on the developed model ; iii) Conducting comparative analysis of the optimal solution from each of the algorithms. Including Non-dominated Sorted Genetic Algorithm (NSGA-II), Multi-Objective Particle Swarm Optimization (MOPSO) and Random Search were used for optimization. Each algorithm showed similar range of result data. However, the execution speed of the optimization using the algorithm was shown a difference. NSGA-II showed the fastest execution speed. Moreover, the most optimal solution distribution is derived from NSGA-II.