• Proceedings of the Korean Society for Noise and Vibration Engineering Conference
• /
• 2009.10a
• /
• pp.321-321
• /
• 2009

This paper presents quasi-zero-stiffness (QZS) characteristic of a passive isolator using flexures under compression force. The passive isolator consists of a positive stiffness element (a vertical coil spring) and a negative stiffness element (flexures under compression force), and their proper combination of the positive and negative stiffness elements can produce both substantial static and zero dynamic stiffness, so called QZS. Firstly, a nonlinear dimensionless expression of a flexure under compression force is derived. A dynamic model of the passive isolator is developed and numerical simulations of its time and frequency response are performed. Then, undesirable nonlinear vibration is quantified using a period doubling bifurcation diagram and a Poincare's map of the isolator under forced excitation. Finally, experiments are performed to validate the QZS characteristic of the passive isolator.

• Journal of Korea Spatial Information System Society
• /
• v.11 no.2
• /
• pp.162-169
• /
• 2009

The real-time traffic data is generated continuous and unbounded stream data type while intelligent transport system (ITS) needs to provide various and high quality services by combining with spatial information. Traditional database techniques in ITS has shortage for processing dynamic real-time stream data and static spatial data simultaneously. In this paper, we design and implement an advanced traffic monitoring system (ATMS) with the integration of existed data stream management system (DSMS) and spatial DBMS using IntraMap. Besides, the developed ATMS can deal with the stream data of DSMS, the trajectory data of relational DBMS, and the spatial data of SDBMS concurrently. The implemented ATMS supports historical and one time query, continuous query and combined query. Application programmer can develop various intelligent services such as moving trajectory tracking, k-nearest neighbor (KNN) query and dynamic intelligent navigation by using components of the ATMS.

• Proceedings of the Korean Institute of Navigation and Port Research Conference
• /
• 2017.11a
• /
• pp.6-7
• /
• 2017

무인선박의 출현 및 운항 시기가 도래하는 시점에서, 항해사들의 경험적, 정성적 방법으로 항로를 설정하던 기존의 방식이 아니라 정량적 항로 결정 방식 필요성이 제기된다. 본 연구에서는 위험물(HNS) 적재선의 해상교통사고 리스크 기반의 침로 설정을 통해 실시간 데이터 활용에 따라 변화 추정 및 인적 오류를 최소화하여 무인선박 운항 시 활용 가능한 항로 설정 기법을 제안하였다. 항로 주변의 정적 위험(Static Hazard)을 기반한 리스크 평가 방법을 제시하고, Contour map으로 시각화 통해 무인선박뿐 아니라 현존하는 선박에도 적용 가능하여, 사용자 결정에 따라 리스크 기반으로 침로 설정 통해 선박 운항 효율성 및 안전성 확보에 기여할 것으로 기대된다. 본 연구 내용을 토대로 정적 위험뿐 만아니라 선박을 포함한 동적 위험을 반영한 실시간 리스크 기반 항로 설정까지 확장하기 위한 연구가 요구된다.

• Journal of Communications and Networks
• /
• v.5 no.2
• /
• pp.135-140
• /
• 2003

In this paper, we investigate the error performance of a serially concatenated system using a nonrecursive convolutional code as the outer code and a recursive QPSK space-time trellis code as the inner code on quasi-static and rapid Rayleigh fading channels. At the receiver, we consider iterative decoding based on the maximum a posteriori (MAP) algorithm. The performance is evaluated by means of computer simulations and it is shown that better error performance can be obtained by using low complexity outer and/or inner codes and the Euclidean distance criterion based recursive space-time inner codes. We also obtain new systems with large number of trasmit and/or receive antennas providing good error performance.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 2004.04a
• /
• pp.139-143
• /
• 2004

Lee et al have proposed a framework for the linguistic map-based navigational planning of a mobile robot on dynamic environment and provided simulation results applied it to the static environment[1], In this paper, we extends the navigational planning of a mobile robot into dynamic environment. There are two kinds of dynamic obstacles： (1) Time-obstacles that change condition of obstacles with time. (2) Space-obstacles that move their position with time. We propose an algorithm which a mobile robot identifies and avoids the two kinds of dynamic obstacles. The proposed algorithm consists of two stages： (1) The fuzzy logic-based perception stage which identifies the dynamic obstacles around a mobile robot by using sensory data and fuzzy rules, (2) The planning stage which plans the path to goal by avoiding the dynamic obstacles[2-6]. We provide computer simulation results for a mobile robot in order to show the validity of the proposed algorithm.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.32 no.11
• /
• pp.930-936
• /
• 2008

This paper studies the effect of pad at initial stage and wear during braking on the dynamic contact pressure distribution. Wear is influenced by variable factor (contact pressure, sliding speed, radius, temperature) during dynamic braking and variation in contact pressure distribution. Many researchers have conducted complex eigenvalue analysis considering wear characteristic with Lim and Ashby wear map. The conventional analysis method is assumed the pad has smooth and flat surfaces. The purpose of this paper is to validate that wear rate induced by braking is considered for the precise squeal prediction. After obtaining pad wear from experiment, it is incorporated with FE model of brake system. Finally, the comparisons in fugitive nature of squeal will be carried out between the complex eigenvalue analysis and noise dynamometer experiment.

• Proceedings of the Korea Inteligent Information System Society Conference
• /
• 2004.11a
• /
• pp.331-339
• /
• 2004

The preferences of customers change over time. However, existing collaborative filtering (CF) systems are static, since they only incorporate information regarding whether a customer buys a product during a certain period and do not make use of the purchase sequences of customers. Therefore, the quality of the recommendations of the typical CF could be improved through the use of information on such sequences. In this paper, we propose a new methodology for enhancing the quality of CF recommendation that uses customer purchase sequences. The proposed methodology is applied to a large department store in Korea and compared to existing CF techniques. Various experiments using real-world data demonstrate that the proposed methodology provides higher quality recommendations than do typical CF techniques, with better performance, especially with regard to heavy users.

• Journal of Ocean Engineering and Technology
• /
• v.19 no.1 s.62
• /
• pp.26-32
• /
• 2005

Recent earthquakes, measuring over a magnitude of 5.0, on the eastern coast of Korea, have aroused interest in earthquake analyses and the seismic design of caisson-type breakwaters. Most earthquake analysis methods, such as equivalent static analysis, response spectrum analysis, nonlinear analysis, and capacity analysis, are deterministic and have been used for seismic design and performance evaluation of coastal structures. However, deterministic methods are difficult for reflecting on one of the most important characteristics of earthquakes, i.e. the uncertainty of earthquakes. This paper presents results of probabilistic seismic hazard assessment(PSHA) of an actual caisson-type breakwater, considering uncertainties of earthquake occurrences and soil properties. First, the seismic vulnerability of a structure and the seismic hazard of the site are evaluated, using earthquake sets and a seismic hazard map; then, the seismic risk of the structure is assessed.

• Proceedings of the KAIS Fall Conference
• /
• 2006.11a
• /
• pp.203-207
• /
• 2006

Mobile Ip 환경에서 모바일 노드가 외부 네트워크로 이동하는 경우, 이동할 때마다 매번 Binding Update(BU) 메시지를 시그널링 하게 되면 Registration latency가 길어져, 이로 인해 불필요한 네트워크 트래픽을 유발한다. 따라서 HMIPv6가 고안되었는데 지역적인 이동성을 관리하는 MAP을 두어 계층적인 관리가 가능하게 되었다. HMIPv6는 이동단말을 구분할 수 있는 주소로 지역적인 LCoA와 외부에 노출되는 RCoA를 가지게 된다. 여기서, Mobile IP 환경에서 노드가 이동시 발생하게 되는 BU 메시지는 보안 취약성이 제안되어 왔는데 HMIPv6 에서는 두개의 CoA를 가지게 되므로 보안위협이 늘어나게 된다. 본 논문에서는 Static Shared Key를 사용하여 LCoA의 BU 시그널링 메시지를 인증함으로써 보안 취약성을 개선하였다.

• Journal of KIISE:Databases
• /
• v.35 no.5
• /
• pp.447-458
• /
• 2008

In this paper, we address an efficient processing scheme for k-nearest neighbor queries to retrieve k static objects in road network databases. Existing methods cannot expect a query processing speed-up by index structures in road network databases, since it is impossible to build an index by the network distance, which cannot meet the triangular inequality requirement, essential for index creation, but only possible in a totally ordered set. Thus, these previous methods suffer from a serious performance degradation in query processing. Another method using pre-computed network distances also suffers from a serious storage overhead to maintain a huge amount of pre-computed network distances. To solve these performance and storage problems at the same time, this paper proposes a novel approach that creates an index for moving objects by approximating their network distances and efficiently processes k-nearest neighbor queries by means of the approximate index. For this approach, we proposed a systematic way of mapping each moving object on a road network into the corresponding absolute position in the m-dimensional space. To meet the triangular inequality this paper proposes a new notion of average network distance, and uses FastMap to map moving objects to their corresponding points in the m-dimensional space. After then, we present an approximate indexing algorithm to build an R*-tree, a multidimensional index, on the m-dimensional points of moving objects. The proposed scheme presents a query processing algorithm capable of efficiently evaluating k-nearest neighbor queries by finding k-nearest points (i.e., k-nearest moving objects) from the m-dimensional index. Finally, a variety of extensive experiments verifies the performance enhancement of the proposed approach by performing especially for the real-life road network databases.