• 제목/요약/키워드: transmission map

검색결과 257건 처리시간 0.032초

Flashover Prediction of Polymeric Insulators Using PD Signal Time-Frequency Analysis and BPA Neural Network Technique

  • Narayanan, V. Jayaprakash;Karthik, B.;Chandrasekar, S.
    • Journal of Electrical Engineering and Technology
    • /
    • 제9권4호
    • /
    • pp.1375-1384
    • /
    • 2014
  • Flashover of power transmission line insulators is a major threat to the reliable operation of power system. This paper deals with the flashover prediction of polymeric insulators used in power transmission line applications using the novel condition monitoring technique developed by PD signal time-frequency map and neural network technique. Laboratory experiments on polymeric insulators were carried out as per IEC 60507 under AC voltage, at different humidity and contamination levels using NaCl as a contaminant. Partial discharge signals were acquired using advanced ultra wide band detection system. Salient features from the Time-Frequency map and PRPD pattern at different pollution levels were extracted. The flashover prediction of polymeric insulators was automated using artificial neural network (ANN) with back propagation algorithm (BPA). From the results, it can be speculated that PD signal feature extraction along with back propagation classification is a well suited technique to predict flashover of polymeric insulators.

Selective Encryption Algorithm Using Hybrid Transform for GIS Vector Map

  • Van, Bang Nguyen;Lee, Suk-Hwan;Kwon, Ki-Ryong
    • Journal of Information Processing Systems
    • /
    • 제13권1호
    • /
    • pp.68-82
    • /
    • 2017
  • Nowadays, geographic information system (GIS) is developed and implemented in many areas. A huge volume of vector map data has been accessed unlawfully by hackers, pirates, or unauthorized users. For this reason, we need the methods that help to protect GIS data for storage, multimedia applications, and transmission. In our paper, a selective encryption method is presented based on vertex randomization and hybrid transform in the GIS vector map. In the proposed algorithm, polylines and polygons are focused as the targets for encryption. Objects are classified in each layer, and all coordinates of the significant objects are encrypted by the key sets generated by using chaotic map before changing them in DWT, DFT domain. Experimental results verify the high efficiency visualization by low complexity, high security performance by random processes.

Dispersion-Managed Link Configured with Repetitively Shaped Dispersion Maps and Embedded with Mid-span Spectral Inversion

  • Chung, Jae-Pil;Lee, Seong-Real
    • Journal of information and communication convergence engineering
    • /
    • 제20권4호
    • /
    • pp.235-241
    • /
    • 2022
  • A dispersion map was proposed to improve the compensation effect of a distorted WDM (wavelength division multiplexed) channel in a dispersion-managed link coupled with optical phase conjugation. The dispersion map is an origin-symmetric structure around the optical phase conjugator in the middle of the transmission path. In addition, the dispersion map has a form in which a constant dispersion accumulation pattern is repeated regularly. Through simulation, we confirmed that the application of the origin-symmetric dispersion map with a repetitively shaped configuration was more effective in compensating for the distorted WDM channel than in the dispersion-managed link with a conventional dispersion map. In addition, we confirmed that the compensation effect could be increased when the cumulative dispersion distribution of the origin-symmetric distribution map had a positive value in the first half section and a negative value in the second half section. Further, we observed that as the number of repeated dispersion accumulation patterns increased, the residual dispersion per span should also be increased.

IPv6 네트웍 환경에서 지수가중적 이동평균 기법을 이용한 성능향상에 관한 연구 (A Study for Improvement Performance on Using Exponentially Weighted Moving Average at IPv6 networks)

  • 오지현;정충교
    • 한국정보통신설비학회:학술대회논문집
    • /
    • 한국정보통신설비학회 2007년도 학술대회
    • /
    • pp.323-326
    • /
    • 2007
  • Mobility Anchor Points are used for the mobility management in HMIPv6 networks. Currently a mobile node selects the MAP farthest away from itself as a new MAP among available candidates when it undertakes a macro handoff. With this technique, however, the traffic tends to be concentrated at a MAP with the largest domain size and the communication cost increases due to the distance between the mobile node and the MAP. In this work, we proposed a cost effective MAP selection scheme. When leaving the current MAP domain. the mobile node calculates the optimum MAP domain size to minimize the local mobility cost at the new MAP domain considering mobile node's velocity and packet transmission rate. The mobile node then selects a MAP domain of size close to the optimum domain size calculated among the candidate MAP domains. In this way, it is possible for the mobile node to select an optimal MAP adaptively taking the network and node states into account, thus reducing the communication cost.

  • PDF

Selective Encryption Algorithm for Vector Map using Geometric Objects in Frequency Domain

  • Pham, Ngoc-Giao;Kwon, Ki-Ryong;Lee, Suk-Hwan;Woo, Chong-Ho
    • 한국멀티미디어학회논문지
    • /
    • 제20권8호
    • /
    • pp.1312-1320
    • /
    • 2017
  • Recently, vector map data is developed and used in many domains widely. In the most cases, vector map data contains confidential information which must be kept away from unauthorized users. Moreover, the production process of vector maps is considerably complex and consumes a lot of money and human resources. Therefore, the secured storage and transmission are necessary to prevent the illegal copying and distribution from hacker. This paper presents a selective encryption algorithm using geometric objects in frequency domain for vector map data. In the proposed algorithm, polyline and polygon data in vector map is the target of the selective encryption process. Experimental results verified that proposed algorithm is effectively and adaptive the requirements of security.

The Effects of Image Dehazing Methods Using Dehazing Contrast-Enhancement Filters on Image Compression

  • Wang, Liping;Zhou, Xiao;Wang, Chengyou;Li, Weizhi
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제10권7호
    • /
    • pp.3245-3271
    • /
    • 2016
  • To obtain well-dehazed images at the receiver while sustaining low bit rates in the transmission pipeline, this paper investigates the effects of image dehazing methods using dehazing contrast-enhancement filters on image compression for surveillance systems. At first, this paper proposes a novel image dehazing method by using a new method of calculating the transmission function—namely, the direct denoising method. Next, we deduce the dehazing effects of the direct denoising method and image dehazing method based on dark channel prior (DCP) on image compression in terms of ringing artifacts and blocking artifacts. It can be concluded that the direct denoising method performs better than the DCP method for decompressed (reconstructed) images. We also improve the direct denoising method to obtain more desirable dehazed images with higher contrast, using the saliency map as the guidance image to modify the transmission function. Finally, we adjust the parameters of dehazing contrast-enhancement filters to obtain a corresponding composite peak signal-to-noise ratio (CPSNR) and blind image quality assessment (BIQA) of the decompressed images. Experimental results show that different filters have different effects on image compression. Moreover, our proposed dehazing method can strike a balance between image dehazing and image compression.

Selective Encryption Algorithm Based on DCT for GIS Vector Map

  • Giao, Pham Ngoc;Kwon, Gi-Chang;Lee, Suk-Hwan;Kwon, Ki-Ryong
    • 한국멀티미디어학회논문지
    • /
    • 제17권7호
    • /
    • pp.769-777
    • /
    • 2014
  • With the rapid interest in Geographic Information System (GIS) contents, a large volume of valuable GIS dataset has been distributed illegally by pirates, hackers, or unauthorized users. Therefore the problem focus on how to protect the copyright of GIS vector map data for storage and transmission. At this point, GIS security techniques focusing on secure network and data encryption have been studied and developed to solve the copyright protection and illegal copy prevention for GIS digital map. But GIS vector map data is very large and current data encryption techniques often encrypt all components of data. That means we have encrypted large amount of data lead to the long encrypting time and high complexity computation. This paper presents a novel selective encryption scheme for GIS vector map data protection to store, transmit or distribute to authorized users using K-means algorithm. The proposed algorithm only encrypts a small part of data based on properties of polylines and polygons in GIS vector map but it can change whole data of GIS vector map. Experimental results verified the proposed algorithm effectively and error in decryption is approximately zero.

Selective Encryption Scheme for Vector Map Data using Chaotic Map

  • Bang, N.V.;Moon, Kwang-Seok;Lim, Sanghun;Lee, Suk-Hwan;Kwon, Ki-Ryong
    • 한국멀티미디어학회논문지
    • /
    • 제18권7호
    • /
    • pp.818-826
    • /
    • 2015
  • With the rapid interest in Geographic Information System (GIS) contents, a large volume of valuable GIS dataset has been distributed illegally by pirates, hackers, or unauthorized users. Therefore the problem focus on how to protect the copyright of GIS vector map data for storage and transmission. But GIS vector map data is very large and current data encryption techniques often encrypt all components of data. That means we have encrypted large amount of data lead to the long encrypting time and high complexity computation. This paper presents the selective encryption scheme using hybrid transform for GIS vector map data protection to store, transmit or distribute to authorized users. In proposed scheme, polylines and polygons in vector map are targets of selective encryption. We select the significant objects in polyline/polygon layer, and then they are encrypted by the key sets generated by using Chaotic map before changing them in DWT, DFT domain. Experimental results verified the proposed algorithm effectively and error in decryption is approximately zero.

BWA 시스템에서 적응형 버스트 프로파일링을 위한 MAC과 PHY 계층 간 인터페이스의 VLSI 설계 (VLSI Design of Interface between MAC and PHY Layers for Adaptive Burst Profiling in BWA System)

  • 송문규;공민한
    • 대한전자공학회논문지TC
    • /
    • 제42권1호`
    • /
    • pp.39-47
    • /
    • 2005
  • 고속 데이터 전송에 대한 요구가 높아질수록 고속 처리에 대한 요구가 증가하게 되고, 그 결과 통신 시스템에서 하드웨어 구현의 범위가 더 확장되고 있다. 본 논문에서 고려하는 802.16 표준을 기반으로 설계된 BWA 시스템에서는 전송할 MAC PDU를 생성하기 위해 필요한 정의를 생성하는 MAC 계층의 상위부는 소프트웨어에 의해 처리하고, 이 정보를 받아서 MAC PDU를 생성하는 단계부터 실제 전송이 이루어지는 모뎀은 하드웨어에 의해 구현한다. 본 논문에서는 MAC과 PHY 계층 간의 효율적인 메시지 전달을 수행하는 인터페이스 하드웨어를 설계한다. 이 회로는 전송수렴 부계층(transmission convergence sublayer; TC)을 포함한 다음의 기능을 수행한다. (1) MAC PDU(protocol data unit)와 TC PDU 간의 포맷팅, (2) RS 부호화 또는 복호화, (3) DL MAP과 UL MAP을 해석하여 전송 슬롯과 버스트 프로파일의 변조 기법에 맞추어 상향 링크와 하향 링크의 트래픽을 제어하고, 모뎀에 그 정보에 대한 제어 신호를 제공하는 기능을 수행한다. 이외에도 가입자국에는 경쟁 방식의 메시지 전송시 충돌을 피하기 위해 TBEB(truncated binary exponential backoff) 알고리즘을 수행하는 블록이 포함된다. 이상의 모든 기능들을 수행하는 VLSI 구조를 VHDL에 의해 구현 및 검증하였다.

인터넷을 통한 벡터 공간 데이타의 효율적 전송을 위한 최적화 기법 (An Optimization Strategy for Vector Spatial Data Transmission onover the Internet)

  • Liang Chen;Chung-Ho Lee;Hae-Young Bae
    • 한국정보과학회논문지:데이타베이스
    • /
    • 제30권3호
    • /
    • pp.273-285
    • /
    • 2003
  • 일반적으로 공간 벡터 데이타는 래스터 데이타에 비해 많은 정보를 포함하고 있으므로, 좀 더 융통적이고 효율적으로 데이타에 대한 처리가 가능하다. 그러나 인터넷을 통한 공간 벡터 데이타의 조작 시 해결해야 할 문제로 좁은 대역폭을 갖는 인터넷에서 크기가 크고 복잡한 벡터 데이타를 어떻게 효율적으로 전송하는가 라는 문제이다. 본 논문은 좁은 대역폭을 갖는 인터넷을 통한 공간 벡터 데이타를 효율적으로 전송하기 위한 새로운 전송 기법인 스케일에 기반한 전송 기법을 제안한다. 제안된 기법의 아이디어는 보여질수 있는 것만을 전송하는 것이다. 특정 스케일에서 일부 피쳐만이 사용자에게 보여지므로, 자연히 스케일은 공간 피쳐와 연관된 요소이다. 제안된 기법은 웨이블릿에 기반한 지도 일반화 알고리즘을 통해 공간 객체 중에서 출력되는 스케일에 따라 보여질 필요가 없는 피쳐들을 필터링하고, 보여지는 피쳐만을 최종적으로 전송한다. 본 논문에서는 실험을 통해 제안된 기법을 사용하는 경우, 개개의 공간 연산들에 대한 응답 시간이 대체적으로 향상됨을 보인다.