• Title/Summary/Keyword: K-Means 알고리즘

Search Result 770, Processing Time 0.03 seconds

Traffic Information Extraction and Application When Utilizing Vehicle GPS Information (차량의 GPS 정보를 활용한 도로정보 추출 및 적용 방법)

  • Lee, Jong-Sung;Jeon, Min-Ho;Cho, Kyoung-Woo;Oh, Chang-Heon
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.17 no.12
    • /
    • pp.2960-2965
    • /
    • 2013
  • Customized services for individuals in analysis of recently collected GPS information have been investigated in various aspects. As the size of collected GPS data gets larger, a variety of services is being released accordingly. Existing studies, however, are limited to presenting service models for users while there is little study on developing intelligent computing technologies in the introduction of GPS information into the system. This study suggests an algorithm to analyze traffic information by introducing GPS information into the system in order to take the lead among intelligent computing technologies. The suggested algorithm analyzes a map by means of the collected vehicle GPS information and sectional traffic information interpretation method; thus, the computer judges the traffic information collected by humans. The experiment result shows that the traffic information was properly analyzed upon the utilization of the given data. Although a small quantity of analyzed data was less reliable, the system maintained high reliability as the data was sufficient.

Application and Analysis of Educational Programming Language for Elementary Informatics Education (초등학교 정보교육을 위한 EPL 적용 분석)

  • Lee, Mee-Hyun;Koo, Duk-Hoi
    • Journal of The Korean Association of Information Education
    • /
    • v.15 no.1
    • /
    • pp.85-91
    • /
    • 2011
  • Programming training in informatics education have the means that algorithm design and problem solving. However, Because learning and using programming tools that should be done first, elementary school students learning the programming tools that are interested in the process has been reduced. But programming with using an Educational Programming Language(EPL) can show results directly and coding with a drag & drop method that keeps the elementary students' interests for programming. Now that, the students are possible to enhance their creativity and reasoning skills. Therefore, through the result of this study show how to apply the EPL in the elementary information classes and comparing with before this study and after the study, we analyzed to applicate prosperity of EPL.

  • PDF

Tool Path Control Algorithm for Aspherical Surface Grinding (비구면 가공을 위한 공구 경로 제어 알고리즘)

  • Kim H.T.;Yang H.J.
    • Proceedings of the Korean Society of Precision Engineering Conference
    • /
    • 2005.06a
    • /
    • pp.100-103
    • /
    • 2005
  • In this study, tool path control algorithm for aspherical surface grinding was derived and discussed. The aspherical surface actually means contact points between lens and tool. Tool positions are generally defined at the center of a tool, so there is difference between tool path and lens surface. The path was obtained from contact angle and relative position from the contact point. The angle could be calculated after differentiating an aspheric equation and complex algebraic operations. The assumption of the control algorithm was that x moves by constant velocity while z velocity varies. X was normal to the radial direction of lens, but z was tangential. The z velocities and accelerations were determined from current error and next position in each step. In the experiment, accuracy of the control algorithm was checked on a micro-precision machine. The result showed that the control error tended to be diminished when the tool diameter increased, and the error was under sub-micro level.

  • PDF

Analysis of Internet User Features using Multi-dimensional Association Analysis (다차원 연관 분석을 이용한 인터넷 이용자의 특징 분석)

  • Lee, Su-Eun;Jung, Yong-Gyu
    • Journal of Service Research and Studies
    • /
    • v.1 no.1
    • /
    • pp.61-69
    • /
    • 2011
  • Data mining that can not be extracted with a simple query in the form of "useful" means to find information in large databases from the existing and unknown knowledge. It is based on this insight about the data can be defined as a gain. In this paper, we use the Internet to find useful patterns on the Web or saved data to the target Web site, which is to analyze the characteristics of users. A general statistical information on Internet users to the data by applying a relevance analysis, Internet use affect the amount of time to analyze the characteristics of Internet users. Only through experiments extracting data from the association rules, producing optimal results apply for the data pre-processing and algorithm for mining the Web to Internet users. characteristics were analyzed.

  • PDF

Optimal Spare Part Level in Multi Indenture and Multi Echelon Inventory Applying Marginal Analysis and Genetic Algorithm (한계분석법과 유전알고리즘을 결합한 다단계 다계층 재고모형의 적정재고수준 결정)

  • Jung, Sungtae;Lee, Sangjin
    • Korean Management Science Review
    • /
    • v.31 no.3
    • /
    • pp.61-76
    • /
    • 2014
  • There are three methods for calculating the optimal level for spare part inventories in a MIME (Multi Indenture and Multi Echelon) system : marginal analysis, Lagrangian relaxation method, and genetic algorithm. However, their solutions are sub-optimal solutions because the MIME system is neither convex nor separable by items. To be more specific, SRUs (Shop Replaceable Units) are required to fix a defected LRU (Line Replaceable Unit) because one LRU consists of several SRUs. Therefore, the level of both SRU and LRU cannot be calculated independently. Based on the limitations of three existing methods, we proposes a improved algorithm applying marginal analysis on determining LRU stock level and genetic algorithm on determining SRU stock level. It can draw optimal combinations on LRUs through separating SRUs. More, genetic algorithm enables to extend the solution search space of a SRU which is restricted in marginal analysis applying greedy algorithm. In the numerical analysis, we compare the performance of three existing methods and the proposed algorithm. The research model guarantees better results than the existing analytical methods. More, the performance variation of the proposed method is relatively low, which means one execution is enough to get the better result.

A Satellite Tracking Method Using Rotation of Sub-Reflector for Naval Vessels Satellite Antenna System (부반사판 회전에 의한 함정용 위성 안테나의 위성 추적 방법)

  • Eom, Kwang-Sik;Park, Myung-Kwan
    • Journal of the Institute of Electronics Engineers of Korea SC
    • /
    • v.44 no.3
    • /
    • pp.39-44
    • /
    • 2007
  • In this paper, satellite searching and tracking method for the satellite antenna in naval vessels system are proposed. For fast searching satellite, Wide Range Search(WRS) algorithm is proposed where the signal strength of side-lobe is utilized as well as that of main-lobe. Satellite tracking algorithm to stabilize satellite antenna is based on conical-scanning which is accomplished by the use of the sub-reflector located in front of the focus of the reflector. The sub-reflector rotates about a slightly tilted axis by means of a motor and shapes the antenna beam to utilize stabilization. To show the validity of the proposed method, an experimental example is represented.

Performance of Spatial Join Operations using Multi-Attribute Access Methods (다중-속성 색인기법을 이용한 공간조인 연산의 성능)

  • 황병연
    • Spatial Information Research
    • /
    • v.7 no.2
    • /
    • pp.271-282
    • /
    • 1999
  • In this paper, we derived an efficient indexing scheme, SJ tree, which handles multi-attribute data and spatial join operations efficiently. In addition, a number of algorithms for manipulating multi-attribute data are given , together with their computational and I/O complexity . Moreover , we how that SJ tree is a kind of generalized B-tree. This means that SJ-tree can be easily implemented on existing built-in B-tree in most storage managers in the sense that the structure of SJ tree is like that of B-tree. The spatial join operation with spatial output is benchmarked using R-tree, B-tree, K-D-B tree, and SJ tree. Results from the benchmark test indicate that SJ tree out performance other indexing schemes on spatial join with point data.

  • PDF

Application of BASIN 4.0 and WinHSPF to a Small Stream in Total Water Pollution Load Management Area and Calibration of Model Parameter using Genetic Algorithm (오염총량관리지역내 소하천에 대한 BASINS 4.0 및 WinHSPF의 적용과 유전알고리즘을 이용한 매개변수의 보정)

  • Cho, Jae-Heon;Yun, Seoung-Jin
    • Journal of Environmental Impact Assessment
    • /
    • v.21 no.1
    • /
    • pp.161-169
    • /
    • 2012
  • Recently various attempts have been made to apply HSPF model to calculate runoff and diffuse pollution loads of stream and reservoir watersheds. Because the role of standard flow is very important in the water quality modelling of Total Water Pollution Load Management, HSPF was used as a means of estimating standard flow. In this study, BASINS 4.0 and WinHSPF was applied to the Gomakwoncheon watershed, genetic algorithm(GA) and influence coefficient algorithm were used to calibrate the runoff parameters of the WinHSPF. The objective function is the sum of the squares of the normalized residuals of the observed and calculated flow and it is optimized using GA. Estimates of the optimum runoff parameters are made at each iteration of the influence coefficient algorithm. The calibration results showed a relatively good correspondence between the observed and the calculated values. The standard flow(Q275) of the Gomakwoncheon watershed was estimated using the ten years of weather data.

Real-Time Decoding of Multi-Channel Peripheral Nerve Activity (다채널 말초 신경신호의 실시간 디코딩)

  • Jee, In-Hyeog;Lee, Yun-Jung;Chu, Jun-Uk
    • Journal of IKEEE
    • /
    • v.24 no.4
    • /
    • pp.1039-1049
    • /
    • 2020
  • Neural decoding is important to recognize the user's intention for controlling a neuro-prosthetic hand. This paper proposes a real-time decoding method for multi-channel peripheral neural activity. Peripheral nerve signals were measured from the median and radial nerves, and motion artifacts were removed based on locally fitted polynomials. Action potentials were then classified using a k-means algorithm. The firing rate of action potentials was extracted as a feature vector and its dimensionality was reduced by a self-organizing feature map. Finally, a multi-layer perceptron was used to classify hand motions. In monkey experiments, all processes were completed within a real-time constrain, and the hand motions were recognized with a high success rate.

Cluster Topology Algorithm for Efficient Data Transmission in Wireless Body Area Network based on Mobile Sink (WBAN 환경에서 효율적인 데이터 전송을 위한 모바일 싱크기반의 클러스터 토폴로지 알고리즘)

  • Lee, Jun-Hyuk
    • Journal of the Institute of Electronics and Information Engineers
    • /
    • v.49 no.12
    • /
    • pp.56-63
    • /
    • 2012
  • The WBAN technology means a short distance wireless network which provides each device interactive communication by connecting devices inside and outside of body. Standardization on the physical layer, data link layer, network layer and application layer is in progress by IEEE 802.15.6 TG BAN. Wireless body area network is usually configured in energy efficient using sensor and zigbee device due to the power limitation and the characteristics of human body. Wireless sensor network consist of sensor field and sink node. Sensor field are composed a lot of sensor node and sink node collect sensing data. Wireless sensor network has capacity of the self constitution by protocol where placed in large area without fixed position. Mobile sink node distribute energy consumption therefore network life time was increased than fixed sink node. The energy efficient is important matter in wireless body area network because energy resource was limited on sensor node. In this paper we proposed cluster topology algorithm for efficient data transmission in wireless body area network based mobile sink. The proposed algorithm show good performance under the advantage of grid routing protocol and TDMA scheduling that minimized overlap area on cluster and reduced amount of data on cluster header in error prone wireless sensor network based on mobile sink.