• Journal of the Korea Society of Computer and Information
• /
• v.17 no.1
• /
• pp.61-69
• /
• 2012

Smart Grid is the next-generation intelligent power grid that maximizes energy efficiency with the convergence of IT technologies and the existing power grid. Smart Grid is created solution for standardization and interoperability. Smart Grid industry enables consumers to check power rates in real time for active power consumption. It also enables suppliers to measure their expected power generation load, which stabilizes the operation of the power system. Smart industy was ecolved actively cause Wireless communication is being considered for AMI system and wireless communication using ZigBee sensor has been applied in various industly. In this paper, we proposed efficient addressing scheme for improving the performance of the routing algorithm using ZigBee in Smart Grid environment. A distributed address allocation scheme used an existing algorithm has wasted address space. Therefore proposing x, y coordinate axes from divide address space of 16 bit to solve this problem. Each node was reduced not only bitwise but also multi hop using the coordinate axes while routing than Cskip algorithm. I compared the performance between the standard and the proposed mechanism through the numerical analysis. Simulation verify performance about decrease averaging multi hop count that compare proposing algorithm and another. The numerical analysis results show that proposed algorithm reduce multi hop than ZigBee distributed address assignment and another.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.52 no.10
• /
• pp.82-94
• /
• 2015

In this paper, we propose hardware prefetch mechanism with an efficient cache replacement policy by giving priority to the trigger block in which a spatial region and producing a spatial region by using the displacement field. It could be taken into account the sequence of the program since a history is based on the trigger block of history record, and it could be quickly prefetching the instructions or data address by adding a stored value to the trigger address and displacement field since a history is stored as a displacement value. Also, we proposed a method of replacing at random by the cache replacement policy from the low priority block when the cache area is full after giving priority to the trigger block. We analyzed using the memory simulator program gem5 and PARSEC benchmark to assess the performance of the hardware prefetcher. As a result, compared to the existing hardware prefecture to generate the spatial region using a bit vector, L1 data cache miss rate was reduced about 44.5% on average and an average of 26.1% of L1 instruction misses occur. In addition, IPC (Instruction Per Cycle) showed an improvement of about 23.7% on average.

• Proceedings of the Korean Association of Geographic Inforamtion Studies Conference
• /
• 2010.06a
• /
• pp.183-183
• /
• 2010

위치기반서비스(Location Based Service)는 갈수록 고도화 되어 가고 있다. 특히 최근의 대형 포털을 중심으로 지오웹 서비스가 활성화 되어 있고 이를 스마트폰과 같은 개인용 이용기기를 통해 연속적으로 제공하려는 경향이 뚜렷하다. 이와 같은 시점에서 정부와 민간에서 구축 중이거나 보유 중인 전국적 규모의 데이터 간 상호 연동과 융합을 도모하려는 시도 또한 불가결하다. 이는 고도화된 LBS를 위하여 반드시 필요한 과정이기 때문이다. 이에 따라 몇 가지 주요한 전국 데이터를 대상으로 상호 연동과 융합을 위한 기술개발을 시도하였다. 우선 도로명주소기본도와 수치지형도 간 POI의 연계를 위한 연구를 수행하고 있다. 이 연구에서는 두도면 내의 POI를 대상으로 다양한 매칭과 이에 기반 한 의사결정 방법론을 이용하여 자동으로 상호 인식 및 연계가 될 수 있도록 하고 있다. 다음으로 지적도와 수치지형도 간의 객체 매칭에 관한 연구이다. 수치지형도와 지적도의 불부합으로 인하여 그 동안 지적도를 수치지형도에 맞춘 형태의 편집지적도를 지속적으로 생산하여 왔고 앞으로도 그럴 것이다. 문제는 여기에 필요한 많은 예산이다. 만일 수치지형도와 지적도를 자동으로 매칭하여 편집지적도를 자동으로 생산할 수 있게 된다면 많은 예산 절감과 함께 편집지적도의 현시성을 확보할 수 있게 될 것이다. 다음으로 항공사진과 도로망도의 매칭이다. 현재 주요 포털에서 제공하고 있는 항공사진 기반의 도로망도는 기복변위와 같은 문제로 인하여 시각적으로 많은 위치오차를 보이고 있다. 만일 항공사진의 도로영역을 자동으로 추출하여 벡터 도로망도와 매칭을 할 수 있다면 보다 시각적으로 안정된 항공사진 상의 도로망도를 제공할 수 있게 되고 나아가 이는 차량이나 보행자 네비게이션에 매우 요긴하게 이용될 수 있을 것이다. 다음으로 서로 LOD가 다른 도로망도의 매칭 문제이다. 많은 기관에서 독자적으로 생산한 도로망도는 LOD의 상이에 기인한 문제가 많아 서로 연계 활용되지 않는다. 이를 자동으로 매칭하여 서로 연계할 수 있다면 두 도로망도가 보유하고 있는 속성정보를 공동으로 이용할 수 있는 이익을 얻게 된다. 다음으로 지도 일반화 기술이다. 지도일반화는 지적도내 수치지형도와 같은 대규모 데이터를 스마트폰과 같은 저용량 사양의 기기에 서비스 할 때 불가결한 기술이다. 지도상 객체들의 기하학적 정보 손실을 최소화하면서 메모리 측면에서 경량의 지도를 자동으로 만들어 낸다면 이는 매우 요긴하게 이용될 것이다. 마지막으로 보행자 네트워크의 생성기술이다. 보행자 네트워크는 그 상세함과 정보용량에 있어서 차량용 네트워크에 견줄 수 없다. 이를 현행의 차량용 네트워크와 같이 수동으로 생성하는 데에는 경제적으로나 시간적으로 막대한 투자가 필요하다. 따라서 이를 기존의 공간정보들을 활용하여 자동으로 생성해 낼 수 있다면 그 파급효과는 매우 크리라 판단된다. 본 발표에서는 위와 같은 주제에 관하여 그간의 연구 성과를 개략적으로 소개해본다.

• 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 Institute of Electronics and Information Engineers
• /
• v.50 no.6
• /
• pp.62-71
• /
• 2013

The passive emitter location method using TDOA and FDOA measurements has higher accuracy comparing to the single TDOA or FDOA based method. Moreover, it is able to estimate the velocity vector of a moving platform. Recently, several non-iterative methods were suggested using the nuisance parameter but the common reference sensor is needed for each pair of sensors. They show also relatively low performance in the case of a long range between the sensor groups and the emitter. To solve this, we derive the estimation method of the position and velocity of a moving platform based on the Gauss-Newton method. In addition, to analyze the estimation performance of the position and velocity, respectively, we decompose the CRLB matrix into each subspace. Simulation results show the estimation performance of the derived method and the CEP planes according to the given geometry of the sensors.

• Journal of Korean Tunnelling and Underground Space Association
• /
• v.9 no.2
• /
• pp.171-182
• /
• 2007

For minimizing the effect on the focus of civil traffic and environment conditions related to the excavation at the traffic jamming points, an underground station tunnel was planned with 35.5 m in length and bigger area than $200\;m^2$ in sedimentary rock mass. It faced the case that the overburden was just under 13 m. Not based on a pattern design but on the case histories of similar projects and arching effect, the design of large section tunnel under shallow overburden was investigated on three design subjects which are shape effect on the section area, application method of support pressure, and supporting and tunnel safety. According to the mechanical effect from section shape, a basic design and a preliminary design was obtained, and then supporting method of large section was planned by the supporting of NATM and a pipe roof method for subsidence prevention and mechanical stability. From the comparative study between both designs, it was found that the basic design was suitable and acceptable for the steel alignment of tunnel lining, safety and the design parameter restricted by the limit considered as partition of the excavation facilities. Through the analysis result of preliminary design showing the mechanical stability without stress concentration in tunnel arch level, it also was induced that shape effect of the large section area and yielding load obtained from deformation zone in the surrounding rock mass of tunnel have to be considered as major topics for the further development of design technique on the large section tunnel.

• Journal of KIISE:Computing Practices and Letters
• /
• v.8 no.6
• /
• pp.736-745
• /
• 2002

In network delivery of compressed video, packets may be lost if the channel is unreliable like Internet. Such losses tend to of cur in burst like continuous bit-stream error. In this paper, we propose an effective error-concealment approach to which an error resilient video encoding approach is applied against burst errors and which reduces a complexity of error concealment at the decoder using data hiding. To improve the performance of error concealment, a temporal and spatial error resilient video encoding approach at encoder is developed to be robust against burst errors. For spatial area of error concealment, block shuffling scheme is introduced to isolate erroneous blocks caused by packet losses. For temporal area of error concealment, we embed parity bits in content data for motion vectors between intra frames or continuous inter frames and recovery loss packet with it at decoder after transmission While error concealment is performed on error blocks of video data at decoder, it is computationally costly to interpolate error video block using neighboring information. So, in this paper, a set of feature are extracted at the encoder and embedded imperceptibly into the original media. If some part of the media data is damaged during transmission, the embedded features can be extracted and used for recovery of lost data with bi-direction interpolation. The use of data hiding leads to reduced complexity at the decoder. Experimental results suggest that our approach can achieve a reasonable quality for packet loss up to 30% over a wide range of video materials.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.16 no.12
• /
• pp.2762-2770
• /
• 2012

In this paper, we propose a novel approach to effectively compress the sub-images transformed from the picked-up elemental images in integral imaging, in which motion vectors of the object in each sub-image are fast and accurately estimated and compensated by combined use of MSE(mean square error)-based TSS(tree-step search) and FS(full search) schemes. This is, the possible object areas in each sub-image are searched by using the fast TSS algorithm in advance, then the these selected object areas are fully searched with the accurate FS algorithm. Furthermore, the sub-images in which all object's motion vectors are compensated, are transformed into the residual images by using the difference image method and finally compressed with the MPEG-4 algorithm. Experimental results reveal that the proposed method shows 214% improvement in the compression time per each image frame compared to that of the conventional method while keeping the same compression ratio with the conventional method. These successful results confirm the feasibility of the proposed method in the practical application.

• Journal of Digital Contents Society
• /
• v.15 no.6
• /
• pp.663-673
• /
• 2014

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. In this paper, we proposed the efficient addressing scheme for improving the performance of routing algorithm by using ZigBee in WBAN environment. A distributed address allocation scheme used an existing algorithm that has wasted in address space. Therefore proposing x, y and z coordinate axes from divided address space of 16 bit to solve this problems. Each node was reduced not only bitwise but also multi hop using the coordinate axes while routing than Cskip algorithm. I compared the performance between the standard and the proposed mechanism through the numerical analysis. Simulation verified performance about decrease averaging multi hop count that compare proposing algorithm and another. The numerical analysis results show that proposed algorithm reduced the multi hop better than ZigBee distributed address assignment

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.25 no.3
• /
• pp.239-247
• /
• 2007

The 3D spatial information projects have been processed and utilized in varied fields. However, the research of the 3D digital map for a role of national base map is not enough. The draft maps, which are raw data for generating 2D digital map, shows problems in generating 3D digital map. The objective of this research is to develop 3D digital map editing system for modifying and editing of 3D digital map from 2D vector and raster information such as a draft map, 2D digital map, DEM, aerial photo and so forth. This 3D digital map editing system was designed to include data structure of geometric and attribute object under provision of ISO/TC211 and OGC standard. This system was developed to implement the function of 3D stereo editing based on stereo viewing, 3D view editing based on projective, and 3D spatial operation. Using this system, 3D digital maps were able to be successfully produced from not only existing draft maps but also modified or edited draft maps and then application results were compared and analyzed.