• Title/Summary/Keyword: 데이터 처리율

Search Result 1,046, Processing Time 0.023 seconds

The effect of urban conditions, external influences, and O&M efficiency on urban water system from the perspective of water-energy nexus (도시 여건, 외부 영향 및 운영관리 효율이 넥서스 관점에서 도시 물순환 시스템에 미치는 영향)

  • Choi, Seo Hyung;Shin, Bongwoo;Shin, Eunher
    • Proceedings of the Korea Water Resources Association Conference
    • /
    • 2022.05a
    • /
    • pp.31-31
    • /
    • 2022
  • 기후변화, 물 부족, 인구 증가와 도시화로 인한 물 수요 증가, 수질 악화, 노후화된 인프라와 같은 세계적인 물문제의 증가로 인해, 도시 물순환 시스템 관리는 더 큰 어려움을 겪고 있다. 취수, 도·송수, 정수처리, 배·급수, 용수 사용, 하수 집수, 하수 처리, 재이용 및 배출 과정을 포함하는 도시 물순환 시스템의 과정은 매우 에너지 집약적인 활동이며, 이와 같은 에너지 소비는 탄소 배출과 양의 직접적인 상관관계가 있다. 따라서 자원 관리 및 데이터 관리를 최적화하기 위해 넥서스 관점의 접근법이 도시 물순환 시스템에 점차적으로 도입되고 있는 추세이다. 도시 물순환 시스템 넥서스에서는 일반적으로 에너지 인텐시티로 표현되는 물을 위한 에너지를 이해하는 것이 중요하다. 에너지 인텐시티의 차이는 기후(연평균 강수량, 단기 기후 변동성, 기후패턴 등), 지리적 특징(표고차, 평지비, 위치 등), 시스템 특성(총급수량, 인구, 인구밀도, 관로 연장 등) 및 운영관리 효율(수압, 누수율, 에너지 효율 등)과 밀접한 관계가 있다. 그리고 도시 물순환 시스템에서 에너지 관리를 증진시킨 방안은 유지관리 효율 개선(물·에너지 관리전략, 물손실 관리, 수요 관리 및 수요 대응 등), 신기술 도입, 그리고 에너지 회수로 나누어진다. 본 연구에서는 기존 문헌의 자료를 분석하여 도시 물순환 시스템의 각 공정별 에너지 인텐시티를 분석하였으며, 시스템 다이나믹스를 적용하여 다양한 도시 여건(인구, lpcd, 누수율, 취수원, 에너지 인텐시티)에서 외부영향(기후변화, 도시화)과 운영효율 변동(운영효율 향상, 신시술 도입)에 따른 도시 물순환 시스템 내 자원 사용 및 이동을 분석하였다. 에너지 인텐시티는 전체 도시 물순환 시스템, 상수 시스템, 하수시스템에서 각각 2.334 kWh/m3, 1.029 kWh/m3, 1.024 kWh/m3를 나타내었으며, 용수사용, 담수화, 재이용 과정에서는 매우 높은 값이 나타났다. 에너지 인틴시티의 값은 외부 영향에 크게 좌우되는 것으로 분석되었으며, 운영효율의 변동에 따라서 물 및 에너지 사용량은 변화하였지만 에너지 인텐시티의 변동은 크지 않았다. 이에 따라 도시 물순환 시스템을 넥서스 관점에서 관리하기 위해서는 에너지 인텐시티 이외에 물 및 에너지 사용량, 유수수량 관점 에너지 인텐시티, 사용수량 관점 에너지 인텐시티를 종합적으로 고려하는 것이 필요하다.

  • PDF

The Segmented Polynomial Curve Fitting for Improving Non-linear Gamma Curve Algorithm (비선형 감마 곡선 알고리즘 개선을 위한 구간 분할 다항식 곡선 접합)

  • Jang, Kyoung-Hoon;Jo, Ho-Sang;Jang, Won-Woo;Kang, Bong-Soon
    • Journal of the Institute of Convergence Signal Processing
    • /
    • v.12 no.3
    • /
    • pp.163-168
    • /
    • 2011
  • In this paper, we proposed non-linear gamma curve algorithm for gamma correction. The previous non-linear gamma curve algorithm is generated by the least square polynomial using the Gauss-Jordan inverse matrix. However, the previous algorithm has some weak points. When calculating coefficients using inverse matrix of higher degree, occurred truncation errors. Also, only if input sample points are existed regular interval on 10-bit scale, the least square polynomial is accurately works. To compensate weak-points, we calculated accurate coefficients of polynomial using eigenvalue and orthogonal value of mat11x from singular value decomposition (SVD) and QR decomposition of vandemond matrix. Also, we used input data part segmentation, then we performed polynomial curve fitting and merged curve fitting results. When compared the previous method and proposed method using the mean square error (MSE) and the standard deviation (STD), the proposed segmented polynomial curve fitting is highly accuracy that MSE under the least significant bit (LSB) error range is approximately $10^{-9}$ and STD is about $10^{-5}$.

Low Cost and Acceptable Delay Unicast Routing Algorithm Based on Interval Estimation (구간 추정 기반의 지연시간을 고려한 저비용 유니캐스트 라우팅 방식)

  • Kim, Moon-Seong;Bang, Young-Cheol;Choo, Hyun-Seung
    • The KIPS Transactions:PartC
    • /
    • v.11C no.2
    • /
    • pp.263-268
    • /
    • 2004
  • The end-to-end characteristic Is an important factor for QoS support. Since network users and required bandwidths for applications increase, the efficient usage of networks has been intensively investigated for the better utilization of network resources. The distributed adaptive routing is the typical routing algorithm that is used in the current Internet. The DCLC(Delay Constrained 1.east Cost) path problem has been shown to be NP-hard problem. The path cost of LD path is relatively more expensive than that of LC path, and the path delay of LC path is relatively higher than that of LD path in DCLC problem. In this paper, we investigate the performance of heuristic algorithm for the DCLC problem with new factor which is probabilistic combination of cost and delay. Recently Dr. Salama proposed a polynomial time algorithm called DCUR. The algorithm always computes a path, where the cost of the path is always within 10% from the optimal CBF. Our evaluation showed that heuristic we propose is more than 38% better than DCUR with cost when number of nodes is more than 200. The new factor takes in account both cost and delay at the same time.

A Resource Scheduling Based on Iterative Sorting for Long-Distance Airborne Tactical Communication in Hub Network (허브 네트워크에서의 장거리 공중 전술 통신을 위한 반복 정렬 기반의 자원 스케줄링 기법)

  • Lee, Kyunghoon;Lee, Dong Hun;Lee, Dae-Hong;Jung, Sung-Jin;Choi, Hyung-Jin
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.39C no.12
    • /
    • pp.1250-1260
    • /
    • 2014
  • In this paper, a novel resource scheduling, which is used for hub network based long distance airborne tactical communication, is proposed. Recently, some countries of the world has concentrated on developing data rate and networking performance of CDL, striving to keep pace with modern warfare, which is changed into NCW. And our government has also developed the next generation high capacity CDL. In hub network, a typical communication structure of CDL, hybrid FDMA/TDMA can be considered to exchange high rate data among multiple UAVs simultaneously, within limited bandwidth. However, due to different RTT and traffic size of UAV, idle time resource and unnecessary packet transmission delay can occur. And these losses can reduce entire efficiency of hub network in long distance communication. Therefore, in this paper, we propose RTT and data traffic size based UAV scheduling, which selects time/frequency resource of UAVs by using iterative sorting algorithm. The simulation results verified that the proposed scheme improves data rate and packet delay performance in low complexity.

Improved CS-RANSAC Algorithm Using K-Means Clustering (K-Means 클러스터링을 적용한 향상된 CS-RANSAC 알고리즘)

  • Ko, Seunghyun;Yoon, Ui-Nyoung;Alikhanov, Jumabek;Jo, Geun-Sik
    • KIPS Transactions on Software and Data Engineering
    • /
    • v.6 no.6
    • /
    • pp.315-320
    • /
    • 2017
  • Estimating the correct pose of augmented objects on the real camera view efficiently is one of the most important questions in image tracking area. In computer vision, Homography is used for camera pose estimation in augmented reality system with markerless. To estimating Homography, several algorithm like SURF features which extracted from images are used. Based on extracted features, Homography is estimated. For this purpose, RANSAC algorithm is well used to estimate homography and DCS-RANSAC algorithm is researched which apply constraints dynamically based on Constraint Satisfaction Problem to improve performance. In DCS-RANSAC, however, the dataset is based on pattern of feature distribution of images manually, so this algorithm cannot classify the input image, pattern of feature distribution is not recognized in DCS-RANSAC algorithm, which lead to reduce it's performance. To improve this problem, we suggest the KCS-RANSAC algorithm using K-means clustering in CS-RANSAC to cluster the images automatically based on pattern of feature distribution and apply constraints to each image groups. The suggested algorithm cluster the images automatically and apply the constraints to each clustered image groups. The experiment result shows that our KCS-RANSAC algorithm outperformed the DCS-RANSAC algorithm in terms of speed, accuracy, and inlier rate.

Efficient Pipeline Architecture of CABAC in H.264/AVC (H.264/AVC의 효율적인 파이프라인 구조를 적용한 CABAC 하드웨어 설계)

  • Choi, Jin-Ha;Oh, Myung-Seok;Kim, Jae-Seok
    • Journal of the Institute of Electronics Engineers of Korea SD
    • /
    • v.45 no.7
    • /
    • pp.61-68
    • /
    • 2008
  • In this paper, we propose an efficient hardware architecture and algorithm to increase an encoding process rate and implement a hardware for CABAC (Context Adaptive Binary Arithmetic Coding) which is used with one of the entropy coding ways for the latest video compression technique, H.264/AVC (Advanced Video Coding). CABAC typically provides a better high compression performance maximum 15% compared with CAVLC. However, the complexity of operation of CABAC is significantly higher than the CAVLC. Because of complicated data dependency during the encoding process, the complexity of operation is higher. Therefore, various architectures were proposed to reduce an amount of operation. However, they have still latency on account of complicated data dependency. The proposed architecture has two techniques to implement efficient pipeline architecture. The one is quick calculation of 7, 8th bits used to calculate a probability is the first step in Binary arithmetic coding. The other is one step reduced pipeline arcbitecture when the type of the encoded symbols is MPS. By adopting these two techniques, the required processing time was reduced about 27-29% compared with previous architectures. It is designed in a hardware description language and total logic gate count is 19K using 0.18um standard cell library.

Design and Implementation of the Channel Adaptive Broadband MODEM (채널 적응형 광대역 모뎀 설계 및 구현)

  • Chang, Dae-Ig;Kim, Nae-Soo
    • The KIPS Transactions:PartC
    • /
    • v.11C no.1
    • /
    • pp.141-148
    • /
    • 2004
  • Recently, the demand of broadband communications such as high-speed internet, HDTV, 3D-HDTV and ATM backbone network has been increased drastically. For transmitting the broad-bandwidth data using wireless network, it is needed to use ka-band frequency. However, the use of this ka-band frequency is seriously affected to the received data performance by rain fading and atmospheric propagation loss at the Ka-band satellite communication link. So, we need adaptive MODEM to endure the degraded performance by channel environment. In this paper, we will present the structure and design of the 155Mbps adaptive Modem adaptively compensated against channel environment. In order to compensate the rain attenuation over the ka-band wireless channel link, the adaptive coding schemes with variable coding rates and the multiple modulation schemes such as trellis coded 8-PSK, QPSK, and BPSK are adopted. And the blind demodulation scheme is proposed to demodulate without Information of modulation mode at the multi-mode demodulator, and the fast phase ambiguity resolving scheme is proposed. The design and simulation results of adaptive Modem by SPW model are provided. This 155Mbps adaptive MODEM was designed and implemented by single ASIC chip with the $0.25\mu{m}$ CMOS standard cell technology and 950 thousand gates.

Development of a Simulation Prediction System Using Statistical Machine Learning Techniques (통계적 기계학습 기술을 이용한 시뮬레이션 결과 예측 시스템 개발)

  • Lee, Ki Yong;Shin, YoonJae;Choe, YeonJeong;Kim, SeonJeong;Suh, Young-Kyoon;Sa, Jeong Hwan;Lee, JongSuk Luth;Cho, Kum Won
    • KIPS Transactions on Software and Data Engineering
    • /
    • v.5 no.11
    • /
    • pp.593-606
    • /
    • 2016
  • Computer simulation is widely used in a variety of computational science and engineering fields, including computational fluid dynamics, nano physics, computational chemistry, structural dynamics, and computer-aided optimal design, to simulate the behavior of a system. As the demand for the accuracy and complexity of the simulation grows, however, the cost of executing the simulation is rapidly increasing. It, therefore, is very important to lower the total execution time of the simulation especially when that simulation makes a huge number of repetitions with varying values of input parameters. In this paper we develop a simulation service system that provides the ability to predict the result of the requested simulation without actual execution for that simulation: by recording and then returning previously obtained or predicted results of that simulation. To achieve the goal of avoiding repetitive simulation, the system provides two main functionalities: (1) storing simulation-result records into database and (2) predicting from the database the result of a requested simulation using statistical machine learning techniques. In our experiments we evaluate the prediction performance of the system using real airfoil simulation result data. Our system on average showed a very low error rate at a minimum of 0.9% for a certain output variable. Using the system any user can receive the predicted outcome of her simulation promptly without actually running it, which would otherwise impose a heavy burden on computing and storage resources.

A Design of PRESENT Crypto-Processor Supporting ECB/CBC/OFB/CTR Modes of Operation and Key Lengths of 80/128-bit (ECB/CBC/OFB/CTR 운영모드와 80/128-비트 키 길이를 지원하는 PRESENT 암호 프로세서 설계)

  • Kim, Ki-Bbeum;Cho, Wook-Lae;Shin, Kyung-Wook
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.20 no.6
    • /
    • pp.1163-1170
    • /
    • 2016
  • A hardware implementation of ultra-lightweight block cipher algorithm PRESENT which was specified as a standard for lightweight cryptography ISO/IEC 29192-2 is described. The PRESENT crypto-processor supports two key lengths of 80 and 128 bits, as well as four modes of operation including ECB, CBC, OFB, and CTR. The PRESENT crypto-processor has on-the-fly key scheduler with master key register, and it can process consecutive blocks of plaintext/ciphertext without reloading master key. In order to achieve a lightweight implementation, the key scheduler was optimized to share circuits for key lengths of 80 bits and 128 bits. The round block was designed with a data-path of 64 bits, so that one round transformation for encryption/decryption is processed in a clock cycle. The PRESENT crypto-processor was verified using Virtex5 FPGA device. The crypto-processor that was synthesized using a $0.18{\mu}m$ CMOS cell library has 8,100 gate equivalents(GE), and the estimated throughput is about 908 Mbps with a maximum operating clock frequency of 454 MHz.

A study on hyperspectral image processing for geographical origin discrimination of domestic and chinese rice (국내산과 중국산 쌀의 원산지 판별을 위한 초분광 영상 처리에 관한 연구)

  • Mo, Changyeun;Lim, Jongguk;Kim, Giyoung;Kwon, Sung Won;Lim, Dong Kyu;Min, Hyun Jung;Kwon, Kyungdo
    • Proceedings of the Korean Society for Agricultural Machinery Conference
    • /
    • 2017.04a
    • /
    • pp.147-147
    • /
    • 2017
  • 우리나라에서는 수입 개방화 추세에 따라 공정한 유통질서 확립하고 국내 생산자와 소비자를 보호하기 위하여 원산지 표시제가 시행되고 있다. 그러나 수입 농산물과 국산 농산물의 큰 가격차이로 인하여 원산지를 허위 표시하는 경우가 증가하고 있다. 특히 쌀 관세화 전환 의무에 따른 수입산 쌀 증가하고 있으며 단립종과 중립종 수입산 쌀은 국내산 쌀과 외관이 유사하여 육안식별이 어려워 국내산 쌀로 둔갑할 우려가 있다. 이에 신속하고 비파괴적으로 쌀의 원산지를 판별할 수 있는 기술 개발이 요구되고 있다. 따라서 본 연구에서는 국내산 쌀과 중국산 쌀의 원산지를 신속하게 판별가능한 영상 처리기술을 개발하였다. 쌀은 국내에서 생산된 중립종 50점과 중국에서 생산된 단립종 및 중립종 51점이 수집되어 사용되었다. 쌀의 분광 영상은 초분광 가시광 및 근적외선 영상 시스템을 이용하여 측정하였다. 이 시스템은 할로겐-텅스텐 라인광, 시료 이송부, 초분광 영상 획득부로 구성되어 있다. 텅스텐-할로겐 라인광은 $15^{\circ}$ 각도로 대칭으로 시료에 조사되고 400 ~ 1000 nm 파장 영역의 반사광 영상 스펙트럼이 측정되었다. 초분광 영상 데이터는 광에 노출되지 않은 암실에서의 파장별 영상과 반사율이 99% 이상인 기준판의 파장별 영상을 이용하여 교정되었다. 부분최소제곱회귀법을 이용하여 쌀 원산지 판별모델 식을 개발하였고, 이 판별 모델식을 교정된 초분광 영상에 적용하여 영상처리 판별 모델을 개발하였다. 그 결과, 원산지 판별정확도가 97.4% 이상으로 나타났으며, 국내산과 중국산 쌀의 원산지 판별이 가능하였다.

  • PDF