• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.11B
• /
• pp.1200-1206
• /
• 2009

In this paper, we propose an energy-efficient MAC(Medium Access Control) protocol for processing context information in ubiquitous sensor network environments. CASMAC(Context Aware Sensor MAC) use context information for energy-efficient operation and its operation principle is as follows. First, we make scenarios with possible prediction for CASMAC. And then we save setted context information in server. When event occur at specific sensor node, and then it send three times sample data to server. According to context information, server process sample data. If server process sample data with event, it receive continuous data from event occur node by a transmission request signal. And then server send data transmission stop signal to event occur node when it do not need to data. If server process sample data with no event, it have not reply. Through we make energy consumption tables and an energy consumption model, we simulate analysis of CASMAC performance. In a result, we gains about 5.7 percents energy reduction compared to SMAC.

• The Transactions of the Korea Information Processing Society
• /
• v.4 no.2
• /
• pp.338-348
• /
• 1997

In this pater, we first propose a data distribution framework to resolve load imbalance and bucket oerflow in parallel hash join.Using the histogram equalization technique, the framework transforms a histogram of skewed data to the desired uniform distribution that corresponds to the relative computing power of node processors in the system.Next we propose an effcient parallel hash join algorithm for handing skwed data based on the proposed data distribution methodology.For performance comparison of our algorithm with other hash join algorithms.we perform similation experiments and actual exeution on COREDB database computer with 8-node hyperube architecture. In these experiments, skwed data distebution of the join atteibute is modeled using a Zipf-like distribution.The perfomance studies undicate that our algorithm outperforms other algorithms in the skewed cases.

• Journal of the Korean Data and Information Science Society
• /
• v.28 no.4
• /
• pp.755-768
• /
• 2017

As Big Data becomes the core of the fourth industrial revolution, big data-based processing and analysis capabilities are expected to influence the company's future competitiveness. Comparative studies of RHadoop and RHIPE that integrate R and Hadoop environment, have not been discussed by many researchers although RHadoop and RHIPE have been discussed separately. In this paper, we constructed big data platforms such as RHadoop and RHIPE applicable to large scale data and implemented the machine learning algorithms such as multiple regression and logistic regression based on MapReduce framework. We conducted a study on performance and scalability with those implementations for various sample sizes of actual data and simulated data. The experiments demonstrated that our RHadoop and RHIPE can scale well and efficiently process large data sets on commodity hardware. We showed RHIPE is faster than RHadoop in almost all the data generally.

• The Korean Journal of Applied Statistics
• /
• v.35 no.4
• /
• pp.517-525
• /
• 2022

In the era of big data, various data mining techniques have been proposed as major analysis methodologies. As complex and diverse data is mass-produced, data mining techniques have attracted attention as a method that forms the foundation of data science. In this paper, we focused on the decision tree, which is frequently used in practice and easy to understand as one of representative data mining methods. Specifically, we analyzed the effect of the splitting method of decision trees on the model performance. We compared the prediction power and structures of decision tree models with different split methods based on various simulated data. The results show that the linear combination split method can improve the prediction accuracy of decision trees in the case of data simulated from nonlinear models with complex structure.

• Journal of Korea Society of Industrial Information Systems
• /
• v.15 no.2
• /
• pp.31-39
• /
• 2010

VoD(Video-on-Demand) servers have to provide timely processing guarantees for continuous media and reduce the storage and bandwidth requirements for continuous media. The compression techniques make the bit rates of compressed video data significantly variable from frame to frame. A VoD system should be able to provide the client with interactive operations such as fast forward and fast rewind in addition to normal playback of movie. However, interactive operations require additional resources such as storage space, disk bandwidth, memory and network bandwidth. In a stored video application such as VoD system, it is possible that a priori disk access patterns can be used to reserve the system resources in advance. In addition, clients of VoD server spend most of their time in playback mode and the period of time spent in interactive mode is relatively small. In this paper, I present the new buffer management scheme that provides efficient support for interactive operations in a VoD server using variable bit rate continuous media. Simulation results show that our strategy achieves 34% increase of the number of accepted clients over the LRU strategy.

• Journal of Conservation Science
• /
• v.27 no.2
• /
• pp.181-190
• /
• 2011

A precision measurement and digital image restoration of the 5th century's gilt bronze cap of Baekje dynasty, excavated from the ancient tomb of Andong, Goheung in 2006, was undertaken. The objective of the scanning is to preserve precise feature of the artefact in the form of digital data by embodying it in 3 dimensional space. Acquirement of the data has been undertaken in the following process : 3D scanning to obtain 3D shape and color information(original data photographing)-3D modelling(joining original data and restoring non-photographed or damaged area)-CG image production. Production of restoration CG image was based on joined shape of original data and each part's measurement on CAD. Non-photographed part and area of loss was restored referring actual measurement and research result of excavated cap from the 5th to 8th century. 3D image restoration is one of artefact restoration methods which restores artefact without risk. It is also undertaken with historical research. As result, this method can enhance aesthetic and academic value of the artefact by successful restoration.

• Journal of Broadcast Engineering
• /
• v.19 no.2
• /
• pp.184-194
• /
• 2014

The CBS methodology has been utilized in order to make a rapid broadcast of emergency alert based on cellular systems. We present a synchronous cooperative communication method for the CBS. Especially, we suggest a synchronization scheme and a data recovery approach for high-rate cooperative communications. For the high-rate transfer of emergency alert, the cyclic prefix is added to the preamble for the synchronization. For the data recovery, the Alamouti technique is utilized on frequency domain, which is similar to SC-FDE. The simulation results confirm that our proposed scheme is very suitable for the CBS.

• Proceedings of the Korean Association of Geographic Inforamtion Studies Conference
• /
• 2010.09a
• /
• pp.95-98
• /
• 2010

수질오염총량제가 도입되면서 각 지방자치단체는 허용배출량을 산정하기 위하여 QUAL2E 수질모델을 이용한 수질모의를 적극적으로 활용하고 있다. 그러나 수질모의 수행에 필요한 입력 자료를 작성하기 위하여 많은 시간이 소요되기 때문에 시간 및 경제적 손실을 가져오고 있다. 따라서 본 연구에서는 수질모의 입력 자료를 자동으로 작성하기 위하여 오염원 DB와 수리계수 DB 및 한국형 리치파일을 연계할 수 있는 데이터모델을 수립하였다. 모델을 이용하여 수질모의 대상하천의 기본 정보를 한국형 리치파일에서 얻은 후 오염원 DB와 표준유역명으로 연계하여 오염원 정보를 추출토록 하였다. 아울러 수리계수 DB에서 하천코드와 상류지점으로부터 누적거리를 이용하여 대상 하천의 수리계수를 추출하였다. 이는 모의대상하천을 선택하였을 때 자동으로 수질모의 입력 자료를 작성할 수 있는 모듈을 개발할 수 있도록 지원이 가능하다. 이러한 모델의 개발을 통하여 다양한 기관에서 중복 구축하던 수질모의 자료의 통합관리가 가능하며, 나아가 수질모의 입력 자료의 작성을 자동화함으로써 시간 및 비용 절감에 기여가 클 것으로 사료된다.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 1996.06a
• /
• pp.229-232
• /
• 1996

본 논문에서는 공간적 보간을 응용하여 손상된 영상 구획의 데이터를 복원하는 기법을 제시한다. 이러한 기법은 손상된 영상을 부가 정보 없이 복원하는 오류 은폐의 핵심으로 Park[3], Wang[4], Sun[9], Lee[7], Hemami[8] 등에 의해서 여러 가지 기법들이 제안되었다. 그러나 이러한 기법들은 단순히 주변 구획과의 경계면에서의 연속성만을 고려하여 복원하므로 구획 내부의 데이터를 복원하는데 한계가 있으며 계산량도 많은 단점이 있다. 따라서 본 논문에서는 이러한 기존의 기법들의 단점을 극복하기 위하여 Non-Unform Rational B-Spline(NURBS)을 응용한 복원 기법을 제안한다. 제시된 주변 구획의 오류 유무와 윤곽선의 방향에 따라 주변 구획의 화소 정보에 할당되는 가중치를 적절히 변경하여 NURBS를 적용한다. 따라서 윤곽선의 방향을 더욱 견실하게 복원함으로써 주관적, 객관적 관점에서 기존의 기법보다 우수한 영상 구획 복원 성능을 얻을 수 있다. 정지 영상에 대한 컴퓨터 모의 실험 결과 제안하는 알고리듬을 기존의 기법보다 30% 구획 손실율에서 0.5 dB이상 성능 향상을 얻을 수 있음을 관찰하였다.

• Proceedings of the IEEK Conference
• /
• 2001.09a
• /
• pp.41-44
• /
• 2001

삼각형 메쉬(triangular mesh)로 이루어진 삼차원 영상의 큰 데이터량을 줄이기 위한 메쉬 부호화의 연구가 활발히 진행되고 있다. 그리고, 최근에는 삼차원 부호화 데이터의 네트워크 전송 문제가 대두되어, 점진적 부호화(proressive mesh compression)에 대한 알고리듬들도 제안되고 있다. 본 논문은 꼭지점의 위치 정보 및 간략화 과정의 꼭지점 패턴(vertex pattern) 규칙을 이용하여, 기존의 점진적 부호화 알고리듬의 부호화 성능을 개선한 알고리듬을 제안한다. 꼭지점의 위치 정보를 이용하여 기존의 알고리듬에 비해 낮은 엔트로피(entropy)를 얻었으며, 꼭지점 패턴 정보를 이용하여 복원시 분할 꼭지점(split vertex)의 탐색 범위를 한정하였다. 전산 모의 실험을 통해, 제안하는 알고리듬이 기존의 점진적 메쉬 부호화 연구에 비해, 연결 정보 부호화에서 대략 30%정도 향상된 부호화 성능을 가짐을 확인할 수 있었다.