• Proceedings of the Korea Information Processing Society Conference
• /
• 2014.11a
• /
• pp.767-770
• /
• 2014

대용량 데이터를 분석하기 위한 맵리듀스 기반 k-NN 조인 질의처리 알고리즘은 최근 데이터 마이닝 및 분석을 기반으로 하는 응용 분야에서 매우 중요하게 활용되고 있다. 그러나, 대표적인 연구인 보로노이 기반 k-NN 조인 질의처리 알고리즘은 보로노이 인덱스 구축 비용이 매우 크기 때문에 대용량 데이터에 적합하지 못하다. 아울러 보로노이 셀 정보를 저장하기 위해 사용하는 R-트리는 맵리듀스 환경의 분산 병렬 처리에 적합하지 않다. 따라서 본 논문에서는 새로운 그리드 인덱스 기반의 k-NN 조인 질의 처리 알고리즘을 제안한다. 첫째, 높은 인덱스 구축 비용 문제를 해결하기 위해, 데이터 분포를 고려한 동적 그리드 인덱스 생성 기법을 제안한다. 둘째, 맵리듀스 환경에서 효율적으로 k-NN 조인 질의를 수행하기 위해, 인접셀 정보를 시그니처로 활용하는 후보영역 탐색 및 필터링 알고리즘을 제안한다. 마지막으로 성능 평가를 통해 제안하는 기법이 질의 처리 시간 측면에서 기존 기법에 비해 최대 3배 높은 질의 처리 성능을 나타냄을 보인다.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2015.05a
• /
• pp.603-605
• /
• 2015

Recent IoT (Internet Of Things) development of the technology is growing rapidly. When multiple devices to perform operations on the IoT environment, it is possible to improve the efficiency of operations by different devices to join the collaborative relationship (Relation) between. Research on existing methods and has been used and the user to issue commands to each device P2M (Person to Machine) method, is now being replaced by effective M2M (Machine to Machine) manner than by way bring forth the relationship between the device P2M. In this paper, we define the relationship between the device and bring forth proposals for collaborative data transfer algorithms. To block the operation duplicated between different work through the proposed algorithm and is believed to improve the efficiency of work to do.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.12 no.5
• /
• pp.870-878
• /
• 2008

The level of security of most sensor nodes that comprise the sensor networks is low, but because of the low computing power and small storage capacity, it is even very difficult to apply a security algorithm efficiently to the sensor nodes. Therefore, preventing the join of an illegal node to a sensor network is impossible, and the transmitting information is easily exposed and overheard when the transmitting algorithm of the sensor node is hewn. In this paper, we propose a group key management scheme for the sensor network using polar coordinates, so that the sensor nodes can deliver information securely inside a cluster and any illegal node is prevented from joining to the cluster where a sensor network is composed of many clusters. In the proposed scheme, all of the sensor nodes in a cluster set up the authentication keys based on the pivot value provided by the CH. The intensive simulations show that the proposed scheme outperforms the pair-wise scheme in terms of the secure key management and the prevention of the illegal nodes joining to the network.

• Journal of Korean Society for Geospatial Information Science
• /
• v.7 no.2 s.14
• /
• pp.123-132
• /
• 1999

With the rapid increases of the amount of data and computing, the parallelization of the computing algorithm becomes necessary more than ever. However the parallelization had been conducted mostly in a super-computer until the rod 1990s, it was not for the general users due to the high price, the complexity of usage, and etc. A new concept for the parallel processing has been emerged in the form of K-clustering form the late 1990s, it becomes an excellent alternative for the applications need high computer power with a relative low cost although the installation and the usage are still difficult to the general users. The mapping algorithms (cut, join, resizing, warping, conversion from raster to vector and vice versa, etc) in GIS are well suited for the parallelization due to the characteristics of the data structure. If those algorithms are manipulated using PC-clustering, the result will be satisfiable in terms of cost and performance since they are processed in real flu with a low cos4 In this paper the tools and the libraries for the parallel processing and PC-clustering we introduced and how those tools and libraries are applied to mapping algorithms in GIS are showed. Parallel programs are developed for the mapping algorithms and the result of the experiments shows that the performance in most algorithms increases almost linearly according to the number of node.

• Journal of the Korea Society of Computer and Information
• /
• v.14 no.11
• /
• pp.1-12
• /
• 2009

Mobbing is going the rounds through a society rapidly and Military is not exception. Because mobbing of military is expressed not only psychology exclusion that is mobbing pattern of adult society but also sometimes psychologic and physical mobbing, is possible to join serious military discipline like a suicide and outrageous behavior. Specially military try to protect occurrence of victims that is public service through various rules and management plan but victims is going on happen. It means importance of grasp not only current mobbing victims but also potential mobbing victims better than preparation of various rules and management plans. Therefore this paper extracts seven factors and fifty attributes that are related to this matter mobbing. Next, by using Gunwoo's Social Network Service that is made for oneself and expressing extracting factors as '1' if they are related me or not '0'. And apply similarity function(Dice's coefficient) to attributes summation included in factors to calculate similarity between the users. Third, calculate optimizing weight choosing factors included attributes by applying neural network algorithm of SPSS Clementine and propose Mobbing Value(MV) Algorithm through this total summation. Finally through this algorithm which will contribute to efficient personnel management, we can grasp mobbing victims and tentative mobbing victims.

• The KIPS Transactions:PartC
• /
• v.10C no.5
• /
• pp.625-634
• /
• 2003

More than a decade after its initial proposal, deployment of IP Multicast has been limited due to the problem of traffic control in multicast routing, multicast address allocation in global internet, reliable multicast transport techniques etc. Lately, according to increase of multicast application service such as internet broadcast, real time security information service etc., overlay multicast is developed as a new internet multicast technology. In this paper, we describe an overlay multicast protocol and propose fast join mechanism that considers switching of the tree. To find a potential parent, an existing search algorithm descends the tree from the root by one level at a time, and it causes long joining latency. Also, it is try to select the nearest node as a potential parent. However, it can't select the nearest node by the degree limit of the node. As a result, the generated tree has low efficiency. To reduce long joining latency and improve the efficiency of the tree, we propose searching two levels of the tree at a time. This method forwards joining request message to own children node. So, at ordinary times, there is no overhead to keep the tree. But the joining request came, the increasing number of searching messages will reduce a long joining latency. Also searching more nodes will be helpful to construct more efficient trees. In order to evaluate the performance of our fast join mechanism, we measure the metrics such as the search latency and the number of searched node and the number of switching by the number of members and degree limit. The simulation results show that the performance of our mechanism is superior to that of the existing mechanism.

• Journal of Information Technology Services
• /
• v.19 no.1
• /
• pp.145-158
• /
• 2020

With the development and widespread application of online shopping, the number of online consumers has increased. With one click of a mouse, people can buy anything they want without going out and have it sent right to the doors. As consumers benefit from online shopping, people are becoming more concerned about protecting their privacy. In the group buying scenario described in our paper, online shopping was regarded as intra-group communication. To protect the sensitive information of consumers, the polynomial-based encryption key sharing method (Piao et al., 2013; Piao and Kim, 2018) can be applied to online shopping communication. In this paper, we analyze security problems by using a polynomial-based scheme in the following ways : First, in Kamal's attack, they said it does not provide perfect forward and backward secrecy when the members leave or join the group because the secret key can be broken in polynomial time. Second, for simultaneous equations, the leaving node will compute the new secret key if it can be confirmed that the updated new polynomial is recomputed. Third, using Newton's method, attackers can successively find better approximations to the roots of a function. Fourth, the Berlekamp Algorithm can factor polynomials over finite fields and solve the root of the polynomial. Fifth, for a brute-force attack, if the key size is small, brute force can be used to find the root of the polynomial, we need to make a key with appropriately large size to prevent brute force attacks. According to these analyses, we finally recommend the use of a relatively reasonable hash-based mechanism that solves all of the possible security problems and is the most suitable mechanism for our application. The study of adequate and suitable protective methods of consumer security will have academic significance and provide the practical implications.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.16 no.4
• /
• pp.752-758
• /
• 2012

SNS(Social Networking Services) is oneline service that enable users to construct human network through their relation on web, such as following relation, friend relation, and etc. Recently, owing to the advent of digital devices (smart phone, tablet PC) which embedded GPS some applications which provide services with spatial relevance and social relevance have been released. Such an online service is called LBSNS. It is required to use spatial filtering so as to build the LBSNS system that enable users to subscribe information of interesting area. For spatial filtering, user and tweet attaches location information which divide into static property presenting fixed area and dynamic property presenting user's area changed along the moving user. In the case of using a location information including dynamic property, Continuous query occurred from the moving user causes the problem in server. In this paper, we propose spatial filtering algorithm using Virtual Grid for reducing frequency of query, and conclude that frequency of query on using Virtual Grid is 93% decreased than frequency of query on not using Virtual Grid.

• Journal of KIISE:Databases
• /
• v.30 no.3
• /
• pp.286-295
• /
• 2003

The shape of query windows for spatial selection queries is a rectangle in many cases. However, it can be issued for spatial selection queries with not only rectangular query widow, but also polygonal query window. Moreover, as the applications like GIS can manage much more spatial data, they can support the more various applications. Therefore it is valuable for considering about the query processing method suitable for not only rectangle query window, but also general polygonal one. It is the general state-of-the-art approach to use the plane- sweep technique as the computation algorithm in the refinement step as the spatial join queries do. However, from the observation on the characteristics of spatial data and query windows, we can find in many cases that the shape of query window is much simpler than that of spatial data. From these observations, we suggest a new refinement process approach which is suitable for this situation. Our experiments show that, if the number of vertices composing the query window is less than about 20, the new approach we suggest is superior to the state-of-the-art approach by about 20% in general cases.

• Proceedings of the KWS Conference
• /
• 2002.10a
• /
• pp.320-323
• /
• 2002

This paper presents a new generation of system for pressure vessel and shipbuilding. Typical pressure vessel and ship building weld joint preparations are either traditional V, butt, fillet grooves or have narrow or semi narrow gap profiles. The fillet and U groove are prevalently used in heavy industries and shipbuilding to melt and join the parts. Since the wall thickness can be up to 6" or greater, welds must be made in many layers, each layer containing several passes. However, the welding time for the conventional processes such as SAW(Submerged Arc Welding) and FCAW(Flux Cored Arc Welding) can be many hours. Although SAW and FCAW are normally a mechanized process, pressure vessel and ship structures welding up to now have usually been controlled by a full time operator. The operator has typically been responsible for positioning each individual weld run, for setting weld process parameters, for maintaining flux and wire levels, for removing slag and so on. The aim of the system is to develop a high speed welding system with multitorch for increasing the production speed on the line and to remove the need for the operator so that the system can run automatically for the complete multi-torch multi-layer weld. To achieve this, a laser vision sensor, a rotating torch and an image processing algorithm have been made. Also, the multitorch welding system can be applicable for the fine grained steel because of the high welding speed and lower heat input compare to a conventional welding process.