• Journal of Korean Institute of Industrial Engineers
• /
• v.19 no.3
• /
• pp.123-137
• /
• 1993

In this paper, an integrated approach is proposed to generate gouging-free Cartesian tool paths for machining sculptured surfaces from 3D measurement data. The integrated CAD/CAM system consists of two modules : offset surface module an Carteian tool path module. The offset surface module generates an offset surface of an object from its 3D measurement data, using an offsetting method and a surface fitting method. The offsetting is based on the idea that the envelope of an inversed tool generates an offset surface without self-intersection as the center of the inversed tool moves along on the surface of an object. The surface-fitting is the process of constructing a compact representation to model the surface of an object based on a fairly large number of data points. The resulting offset surtace is a composite Bezier surface without self-intersection. When an appropriate tool-approach direction is selected, the tool path module generates the Cartesian tool paths while the deviation of the tool paths from the surface stays within the user-specified tolerance. The tool path module is a two-step process. The first step adaptively subdivides the offset surface into subpatches until the thickness of each subpatch is small enough to satisfy the user-defined tolerance. The second step generates the Cartesian tool paths by calculating the intersection of the slicing planes and the adaptively subdivided subpatches. This tool path generation approach generates the gouging-free Cartesian CL tool paths, and optimizes the cutter movements by minimizing the number of interpolated points.

• Journal of KIISE
• /
• v.42 no.1
• /
• pp.86-92
• /
• 2015

A level set tree provides a useful representation of a multidimensional density function. Visualizing the data structure as a tree offers many advantages for data analysis and clustering. In this paper, we present a level set tree estimation algorithm for use with a set of data points. The proposed algorithm creates a level set tree from a family of level sets estimated over a whole range of levels from zero to infinity. Instead of estimating density function then thresholding, we directly estimate the density level sets using one-class support vector machines (OC-SVMs). The level set estimation is facilitated by the OC-SVM solution path algorithm. We demonstrate the proposed level set tree algorithm on benchmark data sets.

• Journal of information and communication convergence engineering
• /
• v.5 no.2
• /
• pp.83-87
• /
• 2007

This research studies real time interaction and dynamic data shared through 3D scenes in virtual network environments. In a distributed virtual environment of client-server structure, consistency is maintained by the static information exchange; as jerks occur by packet delay when updating messages of dynamic data exchanges are broadcasted disorderly, the network bottleneck is reduced by predicting the movement path by using the Dead-reckoning algorithm. In Dead-reckoning path prediction, the error between the estimated and the actual static values which is over the threshold based on the shared object location requires interpolation and multicasting of the previous location by the ESPDU of DIS. The shared dynamic data of the 3D virtual environment is implementation using the VRML.

• Journal of the Institute of Convergence Signal Processing
• /
• v.14 no.2
• /
• pp.105-109
• /
• 2013

There are the free space model, the direct-path and ground reflected model, Egli model, Okumura-Hata model in the representative propagational models. The measured results at the area of PNG area were used as the experimental data in this paper. The new proposed partial interval analysis method is applied on the measured propagation data in the cellular band. The interval for the analysis is divided from the entire 30 Km distance to 5 Km, and next to 1 Km. The best-fit propagation models are chosen on all partial intervals. The means and standard deviations are calculated for the differences between the measured data and all partial interval models. By using the 5 Km- or 1 Km- partial interval analysis, the standard deviation between the measured data and the partial propagation models was improved more than 1.7 dB.

• Proceedings of the KSR Conference
• /
• 2011.10a
• /
• pp.607-613
• /
• 2011

This paper reviews search methods of multiple reasonable paths to implement multimodal public transportation network of Seoul. Such a large scale multimodal public transportation network as Seoul, the computation time of path finding algorithm is a key and the result of path should reflect route choice behavior of public transportation passengers. Search method of alternative path is divided by removing path method and deviation path method. It analyzes previous researches based on the complexity of algorithm for large-scale network. Applying path finding algorithm in public transportation network, transfer and loop constraints must be included to be able to reflect real behavior. It constructs the generalized cost function based on the smart card data to reflect travel behavior of public transportation. To validate the availability of algorithm, experiments conducted with Seoul metropolitan public multimodal transportation network consisted with 22,109 nodes and 215,859 links by using the deviation path method, suitable for large-scale network.

• 제어로봇시스템학회:학술대회논문집
• /
• 2003.10a
• /
• pp.1621-1624
• /
• 2003

This paper presents a new method that generates a path that has no collision with the obstacles or the characters by using the three motion parameters, and automatically creates natural motions of characters that are confined to the path. Our method consists of three parameters: the joint information parameter, the behavior information parameter, and the environment information parameter. The joint information parameters are extracted from the joint angle data of the character and this information is used when creating a path following motion by finding the relation-function of the parameters on each joint. A user can set the behavior information parameter such as velocity, status, and preference and this information is used for creating different paths, motions, and collision avoidance patterns. A user can create the virtual environment such as road and obstacle, also. The environment is stored as environment information parameters to be used later in generating a path without collision. The path is generated using Hermit-curve and each control point is set at important places.

• Proceedings of the Korean Information Science Society Conference
• /
• 2003.10c
• /
• pp.400-402
• /
• 2003

Ad­hoc Network는 Mobile Node들 간에 Multi­hop 무선 링크로 구성되는 Network을 일컫는 말이며, 동시에 Network를 통제하는 Infrastructure없이 Node들 간의 상호 통신에 의해서 Network이 구성되기도 하고, Node들이 이동하거나 환경적인 장애에 의해서 일시적으로 Network이 구성되지 않기도 한다. 이 논문에서는 대표적인 On­demand Routing Algorithm인 DSR를 이용하여, 두 개의 경로를 유지하여 Primary Path에 문제가 발생하는 경우, Secondary Path가 Primary Path로 전환되어 Data를 전송하고, 이 전 Primary Path에 대하여 지역적으로 복구(Repair)를 수행하고, 설정된 Secondary Path에 대해서도 특정한 조건에서 복구작업을 수행함으로써 Ad­hoc Network에서 경로를 찾고 설정하는데 필요한 Routing Overhead를 줄이고 Ad­hoc Network의 특성상 반드시 보완하여야 하는 전송 Route에 대한 Robustness를 강화하는 방법이다.

• Proceedings of the IEEK Conference
• /
• 2004.08c
• /
• pp.585-587
• /
• 2004

Diameter base protocol is intended to provide an AAA framework for applications such as IP mobility. Currently Diameter base protocol is standardized to RFC 3588, but there are some problems. One of them, path authorization is already argued at IETF WG Mailing List. According to RFC 3588, path authorization function causes inefficient data traffic and conflicts with RFC 3588 itself. In this paper, we analysis these problems about path authorization function and propose more improved solution.

• Journal of Digital Convergence
• /
• v.11 no.12
• /
• pp.367-380
• /
• 2013

A secure data gathering in a Wireless Sensor Network(WSN) has given attention to one of security issues. In general, the process of secure data gathering causes difficulties: one process is exchanging the secured data and the other is constructing secured data path. The previous studies have been resolving the difficulties in terms of two problems: security and data gathering in WSNs. However, a WSN requires a protocol that has to guarantee a security of path between sensors and sink, or a cluster head. Thus how to gather data securely is an important issue. In this paper, we propose a secure data gathering protocol over WSNs, which consists of hierarchical key settlement and secure path construction, and aims at tackling two problems. The proposed protocol causes little overhead to sensor nodes for secured key settlement and path construction. This work provides security analysis focused on the key settlement protocol and evaluates network performance for the proposed data gathering protocol through simulation.

• Journal of Creative Information Culture
• /
• v.7 no.3
• /
• pp.157-165
• /
• 2021

As the use of various application services utilizing Web and IoT and the need for large amounts of data management expand accordingly, the importance of efficient data expression and exchange scheme and data query processing is increasing. JSON, characterized by its simplicity, is being used in various fields as a format for data exchange and data storage instead of XML, which is a standard data expression and exchange language on the Web. This means that it is important to develop indexing and query processing techniques to effectively access and search large amounts of data expressed in JSON. Therefore, in this paper, we modeled JSON data with a hierarchical structure in a tree form, and proposed indexing and query processing using the path concept. In particular, we designed an index structure using a suffix array widely used in text search and introduced simple and complex path-based JSON data query processing methods.