• Title/Summary/Keyword: Data Transmission Processing

Search Result 901, Processing Time 0.027 seconds

Stability evaluation of a proportional valve controller for forward-reverse power shuttle control of agricultural tractors

  • Jeon, Hyeon-Ho;Kim, Taek-Jin;Kim, Wan-Soo;Kim, Yeon-Soo;Choi, Chang-Hyun;Kim, Yong-Hyeon;Kim, Yong-Joo
    • Korean Journal of Agricultural Science
    • /
    • v.48 no.3
    • /
    • pp.597-606
    • /
    • 2021
  • Due to the characteristics of the farmland in Korea, forward and reverse shift is the most used. The fatigue of farmers is caused by forward and reverse shifting with a manual transmission. Therefore, it is necessary to improve the convenience of forward and backward shifting. This study was a basic study on the development of a current control system for forward and reverse shifting of agricultural tractors using proportional control valves and a controller. A test bench was fabricated to evaluate the current control accuracy of the control system, and the stability of the controller was evaluated through CPU (central processing unit) load measurements. A controller was selected to evaluate the stability of the proportional valve controller. The stability evaluation was performed by comparing and analyzing the command current of the controller and the actual current measured. The command current was measured using a CAN (controller area network) communication device and DAQ (data acquisition). The actual current was measured with a current probe and an oscilloscope. The control system and stability evaluation was performed by measuring the CPU load on the controller during control operations. The average load factor was 12.27%, and when 5 tasks were applied, it was shown to be 70.65%. This figure was lower than the CPU limit of 74.34%, when 5 tasks were applied and was judged to be a stable system.

Weighted Filter Algorithm based on Distribution Pattern of Pixel Value for AWGN Removal (AWGN 제거를 위한 화소값 분포패턴에 기반한 가중치 필터 알고리즘)

  • Cheon, Bong-Won;Kim, Nam-Ho
    • Journal of the Institute of Convergence Signal Processing
    • /
    • v.23 no.1
    • /
    • pp.44-49
    • /
    • 2022
  • Abstract Recently, with the development of IoT technology and communication media, various video equipment is being used in industrial fields. Image data acquired from cameras and sensors are easily affected by noise during transmission and reception, and noise removal is essential as it greatly affects system reliability. In this paper, we propose a weight filter algorithm based on the pixel value distribution pattern to preserve details in the process of restoring images damaged in AWGN. The proposed algorithm calculates weights according to the pixel value distribution pattern of the image and restores the image by applying a filtering mask. In order to analyze the noise removal performance of the proposed algorithm, it was simulated using enlarged image and PSNR compared to the existing method. The proposed algorithm preserves important characteristics of the image and shows the performance of efficiently removing noise compared to the existing method.

Modified Average Filter for Salt and Pepper Noise Removal (Salt and Pepper 잡음제거를 위한 변형된 평균필터)

  • Lee, Hwa-Yeong;Kim, Nam-Ho
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2021.10a
    • /
    • pp.115-117
    • /
    • 2021
  • Currently, as IoT technology develops, monitoring systems are being used in various fields, and image processing is being used in various forms. Image data causes noise due to various causes during the transmission and reception process, and if it is not removed, loss of image information or error propagation occurs. Therefore, denoising images is essential. Typical methods of eliminating Salt and Pepper noise in images include AF, MF, and A-TMF. However, existing methods have the disadvantage of being somewhat inadequate in high-density noise. Therefore, in this paper, we propose an algorithm for determining noise for Salt and Pepper denoising and replacing the central pixel with an original pixel if it is non-noise, and processing the filtering mask by segmenting and averaging it in eight directions. We evaluate the performance by comparing and analyzing the proposed algorithms with existing methods.

  • PDF

Design of Smart Farm Growth Information Management Model Based on Autonomous Sensors

  • Yoon-Su Jeong
    • Journal of the Korea Society of Computer and Information
    • /
    • v.28 no.4
    • /
    • pp.113-120
    • /
    • 2023
  • Smart farms are steadily increasing in research to minimize labor, energy, and quantity put into crops as IoT technology and artificial intelligence technology are combined. However, research on efficiently managing crop growth information in smart farms has been insufficient to date. In this paper, we propose a management technique that can efficiently monitor crop growth information by applying autonomous sensors to smart farms. The proposed technique focuses on collecting crop growth information through autonomous sensors and then recycling the growth information to crop cultivation. In particular, the proposed technique allocates crop growth information to one slot and then weights each crop to perform load balancing, minimizing interference between crop growth information. In addition, when processing crop growth information in four stages (sensing detection stage, sensing transmission stage, application processing stage, data management stage, etc.), the proposed technique computerizes important crop management points in real time, so an immediate warning system works outside of the management criteria. As a result of the performance evaluation, the accuracy of the autonomous sensor was improved by 22.9% on average compared to the existing technique, and the efficiency was improved by 16.4% on average compared to the existing technique.

P2P-based divisional data transmission system for live media streaming service (라이브 미디어 스트리밍 서비스를 위한 P2P기반 데이터 분할 전송 시스템)

  • Sun Choi;Heasun Byun;Meejeong Lee
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2008.11a
    • /
    • pp.1348-1351
    • /
    • 2008
  • 최근 인터넷 사용자들의 요구는 멀티미디어로 집중되고 있으며 그중 라이브 미디어 스트리밍 서비스에 대한 요구가 증가하고 있다. 라이브 서비스에서는 적절한 시간에 사용자에게 데이터가 도착하는 것이 중요하다. 따라서 라이브의 시간적절성을 충족시켜 줄 효율적이고 신속한 데이터 전달구조와 전송기법이 요구된다. 이에 본 논문에서는 트리와 메시 구조를 혼합한 하이브리드 방식으로 네트워크 자원을 효율적으로 사용하면서 빠른 데이터 전송으로 라이브의 시간적절성을 충족시킬 수 있는 데이터 분할 전송 방식의 P2P(Peer-to-Peer) 오버레이 구조를 제안한다. 제안하는 ToG(Tree of Groups)는 n개의 피어들이 메시로 그룹을 형성하고, 그렇게 형성된 그룹들이 트리를 이루는 구조이다. ToG에서 그룹 내의 각 피어들은 상위그룹의 피어 한 개와 부모-자식으로 연결되어 있어서 그룹 사이에 여러 개의 연결이 존재하게 된다. 따라서 그룹 내에서 어느 한 피어가 그룹을 빠져 나가더라도 상위그룹과의 여러 연결에 의해서 서비스 지속성을 보장 할 수 있다. ToG는 그룹단위로 트리가 형성되기 때문에 피어의 개수가 같을 때 피어단위로 트리를 형성하는 구조보다 트리의 깊이가 줄어든다. 그에 따라 말단에 있는 피어들에게까지 빠른 시간에 데이터가 전달 될 수 있다. ToG의 데이터 전달은 소스로부터 세그먼트가 일정한 값 n으로 나뉘어져 각 피어들에게 전달된다. 세그먼트 조각은 소스로부터 나뉘어져 전송 될 때 책임적으로 전달해야할 피어와 전달 순서가 정해져있고, 데이터 전송 스케줄링을 위한 버퍼 맵 교환은 필요하지 않다.

A Partial Encryption Method for the Efficiency and the Security Enhancement of Massive Data Transmission in the Cloud Environment (클라우드 환경에서의 대용량 데이터 전송의 효율성과 보안성 강화를 위한 부분 암호화 방법)

  • Jo, Sung-Hwan;Han, Gi-Tae
    • KIPS Transactions on Computer and Communication Systems
    • /
    • v.6 no.9
    • /
    • pp.397-406
    • /
    • 2017
  • In case of using the existing encrypted algorithm for massive data encryption service under the cloud environment, the problem that requires much time in data encryption come to the fore. To make up for this weakness, a partial encryption method is used generally. However, the existing partial encryption method has a disadvantage that the encrypted data can be inferred due to the remaining area that is not encrypted. This study proposes a partial encryption method of increasing the encryption speed and complying with the security standard in order to solve this demerit. The proposed method consists of 3 processes such as header formation, partial encryption and block shuffle. In step 1 Header formation process, header data necessary for the algorithm are generated. In step 2 Partial encryption process, a part of data is encrypted, using LEA (Lightweight Encryption Algorithm), and all data are transformed with XOR of data in the unencrypted part and the block generated in the encryption process. In step 3 Block shuffle process, the blocks are mixed, using the shuffle data stored with the random arrangement form in the header to carry out encryption by transforming the data into an unrecognizable form. As a result of the implementation of the proposed method, applying it to a mobile device, all the encrypted data were transformed into an unrecognizable form, so the data could not be inferred, and the data could not be restored without the encryption key. It was confirmed that the proposed method could make prompt treatment possible in encrypting mass data since the encryption speed is improved by approximately 273% or so compared to LEA which is Lightweight Encryption Algorithm.

Efficient Parallel Spatial Join Processing Method in a Shared-Nothing Database Cluster System (비공유 공간 클러스터 환경에서 효율적인 병렬 공간 조인 처리 기법)

  • Chung, Warn-Ill;Lee, Chung-Ho;Bae, Hae-Young
    • The KIPS Transactions:PartD
    • /
    • v.10D no.4
    • /
    • pp.591-602
    • /
    • 2003
  • Delay and discontinuance phenomenon of service are cause by sudden increase of the network communication amount and the quantity consumed of resources when Internet users are driven excessively to a conventional single large database sewer. To solve these problems, spatial database cluster consisted of several single nodes on high-speed network to offer high-performance is risen. But, research about spatial join operation that can reduce the performance of whole system in case process at single node is not achieved. So, in this paper, we propose efficient parallel spatial join processing method in a spatial database cluster system that uses data partitions and replications method that considers the characteristics of space data. Since proposed method does not need the creation step and the assignment step of tasks, and does not occur additional message transmission between cluster nodes that appear in existent parallel spatial join method, it shows performance improvement of 23% than the conventional parallel R-tree spatial join for a shared-nothing architecture about expensive spatial join queries. Also, It can minimize the response time to user because it removes redundant refinement operation at each cluster node.

Operation and Analysis of Network for Multivendor PLC Group Management in the Wall Paper Process (발포 벽지 공정에서 이기종 PLC 그룹 관리를 위한 네트워크 운영과 해석)

  • Gang, Seong-Deok;Lee, Dong-Chun;Kim, Jeong-Ho;Lee, Sang-Beom
    • The Transactions of the Korea Information Processing Society
    • /
    • v.3 no.2
    • /
    • pp.283-294
    • /
    • 1996
  • To operate the automatic devices of manufacturing process more effectively and to solve the needs of the resource sharing, network technology is applied to the unit control devices located in common manufacturing zone and operated by connecting them. This paper introduces deign and test operation of cell system for the management of multivendor PLC by applying to wall paper process based on the manufacturing standardization of CIM. The analysis of designed multivendor PLC group is performed by selecting the parameters such as variation of data packet size and node number of PLC ladder logic program and variation by analyzing the corresponding variation values of token rotation time and waiting time for the system operation. For the method of the analysis,the equation is considering the overhead such as indicated packet service time and transmission safety margin for PLC network connection in M/G/1 queue model,and it is applied to the cell system and PLC group manage-ment for operation .Through the experiment,it is found that the realtime processing is possible with expanded and better result than the resuit obtained by Jayasumana.Browaka with PLC scan time considered,response lower limit of 10-20 msec. data packet size not more than 50 bytes.and the number of nodes less than 40.

  • PDF

Dynamic Query Processing Using Description-Based Semantic Prefetching Scheme in Location-Based Services (위치 기반 서비스에서 서술 기반의 시멘틱 프리페칭 기법을 이용한 동적 질의 처리)

  • Kang, Sang-Won;Song, Ui-Sung
    • Journal of KIISE:Databases
    • /
    • v.34 no.5
    • /
    • pp.448-464
    • /
    • 2007
  • Location-Based Services (LBSs) provide results to queries according to the location of the client issuing the query. In LBS, techniques such as caching and prefetching are effective approaches to reducing the data transmission from a server and query response time. However, they can lead to cache inefficiency and network overload due to the client's mobility and query pattern. To solve these drawbacks, we propose a semantic prefetching (SP) scheme using prefetching segment concept and improved cache replacement policies. When a mobile client enters a new service area, called semantic prefetching area, proposed scheme fetches the necessary semantic information from the server in advance. The mobile client maintains the information in its own cache for query processing of location-dependent data (LDD) in mobile computing environment. The performance of the proposed scheme is investigated in relation to various environmental variables, such as the mobility and query pattern of user, the distributions of LDDs and applied cache replacement strategies. Simulation results show that the proposed scheme is more efficient than the well-known existing scheme for range query and nearest neighbor query. In addition, applying the two queries dynamically to query processing improves the performance of the proposed scheme.

Developement of Small 360° Oral Scanner Embedded Board for Image Processing (소형 360° 구강 스캐너 영상처리용 임베디드 보드 개발)

  • Ko, Tae-Young;Lee, Sun-Gu;Lee, Seung-Ho
    • Journal of IKEEE
    • /
    • v.22 no.4
    • /
    • pp.1214-1217
    • /
    • 2018
  • In this paper, we propose the development of a Small $360^{\circ}$ Oral Scanner embedded board. The proposed small $360^{\circ}$ oral scanner embedded board consists of image level and transfer method changing part FPGA part, memory part and FIFO to USB transfer part. The image level and transmission mode change unit divides the MIPI format oral image received through the small $360^{\circ}$ oral cavity image sensor and the image sensor into low power signal mode and high speed signal mode and distributes them to the port and transfers the level shift to the FPGA unit. The FPGA unit performs functions such as $360^{\circ}$ image distortion correction, image correction, image processing, and image compression. In the FIFO to USB transfer section, the RAW data transferred through the FIFO in the FPGA is transferred to the PC using USB 3.0, USB 3.1, etc. using the transceiver chip. In order to evaluate the efficiency of the proposed small $360^{\circ}$ oral scanner embedded board, it has been tested by an authorized testing institute. As a result, the frame rate per second is over 60 fps and the data transfer rate is 4.99 Gb/second