• Journal of KIISE:Information Networking
• /
• v.34 no.6
• /
• pp.466-474
• /
• 2007

Asymmetric networks that the downlink bandwidth is larger than the uplink bandwidth may cause the degradation of the TCP performance due to the uplink congestion. In order to solve this problem, this paper designs and implements the Dynamic Segment Size Control mechanism which offers a suitable segment size for current networks. The proposed mechanism does not require any changes in customer premises but suppress the number of ACKs using segment reassembly technique to avoid the uplink congestion. The gateway which adapted the Dynamic Segment Size Control mechanism, detects the uplink congestion condition and dynamically measures the bandwidth asymmetric ratio and the packet loss ratio. The gateway reassembles some of segments received from the server into a large segment and transmits it to the client. This reduces the number of corresponding ACKs. In this mechanism, the SACK option is used when occurs the bit error during the transmission. Based on the simulation in the GEO satellite network environment, we analyzed the performance of the Dynamic Segment Size Control mechanism.

• Journal of KIISE:Databases
• /
• v.41 no.4
• /
• pp.249-255
• /
• 2014

Copy number variations(CNVs) are a recently recognized class of human structural variations and are associated with a variety of human diseases, including cancer. To find important cancer genes, researchers identify novel CNVs in patients with a particular cancer and analyze large amounts of genomic and clinical data. We present a tool called CNVDAT which is able to detect CNVs from NGS data and systematically analyze the genomic and clinical data associated with variations. CNVDAT consists of two modules, CNV Detection Engine and Sequence Analyser. CNV Detection Engine extracts CNVs by using the multi-resolution system of scale-space filtering, enabling the detection of the types and the exact locations of CNVs of all sizes even when the coverage level of read data is low. Sequence Analyser is a user-friendly program to view and compare variation regions between tumor and matched normal samples. It also provides a complete analysis function of refGene and OMIM data and makes it possible to discover CNV-gene-phenotype relationships. CNVDAT source code is freely available from http://dblab.hallym.ac.kr/CNVDAT/.

• Journal of KIISE:Software and Applications
• /
• v.31 no.9
• /
• pp.1142-1149
• /
• 2004

Motion Estimation(ME) has been developed to reduce temporal redundancy in digital video signals and increase data compression ratio. ME is an Important part of video encoding systems, since it can significantly affect the output quality of encoded sequences. However, ME requires high computational complexity, it is difficult to apply to real time video transmission. for this reason, motion estimation algorithms with low computational complexity are viable solutions. In this paper, we present an efficient method with low computational complexity based on spatial and temporal correlations of motion vectors. The proposed method uses temporally and spatially correlated motion information, the motion vector of the block with the same coordinate in the reference frame and the motion vectors of neighboring blocks around the current block in the current frame, to decide the search pattern and the location of search starting point adaptively. Experiments show that the image quality improvement of the proposed method over MVFAST (Motion Vector Field Adaptive Search Technique) and PMVFAST (Predictive Motion Vector Field Adaptive Search Technique) is 0.01～0.3(dB) better and the speedup improvement is about 1.12～l.33 times faster which resulted from lower computational complexity.

• Journal of KIISE:Software and Applications
• /
• v.35 no.4
• /
• pp.207-218
• /
• 2008

With the growth of the Internet, multimedia streaming becomes an important means to deliver video contents over the Internet and the amount of the streaming multimedia contents is also getting increased. However, it becomes difficult to guarantee the quality of service in real-time over the IP network environment with instantaneously varying bandwidth. In this paper, we propose an optimal adaptation framework for streaming contents over the Internet in the sense that the perceptual quality of the multi-angie content with multiple visual objects is maximized given the constraints such as available bandwidth and transcoding cost. In the multi-angle video service framework, the user can select his/her preferred alternate views among the given multiple video streams captured at different view angles for a same event. This enhanced experience often entails streaming problems in real-time over the network, such as instantaneous bandwidth changes in the Internet. In order to cope with this problem, we assume that multi-angle video contents are encoded at different bitrates and the appropriate video streams are then selected or transcoded for delivery to meet such bandwidth constraints. For the user selective consumption of the various bitstreams in the multi-angle video service, the bitstream in each angle can be encoded in various bitrate, and the user can select a sub-bitrstream in the given bitrstreams or transcode the corresponding content in order to deliver the optimally adapted video contents to the instantaneously changing network condition. Therefore, we define the transcoding cost which means the time taken for transcoding the video stream and formulate a unified optimization framework which maximizes the perceptual quality of the multiple video objects in the given constraints such as the transcoding cost and the network bandwidth. Finally, we present plenty of the experimental results to show the effectiveness of the proposed method.

• Journal of KIISE:Databases
• /
• v.36 no.4
• /
• pp.263-279
• /
• 2009

Shape features in a content-based image retrieval (CBIR) system are divided into two classes: contour-based and region-based. Contour-based shape features are simple but they are not as efficient as region-based shape features. Most systems using the region-based shape feature have to extract the region firs t. The prior works on region-based systems still have shortcomings. They are complex to implement, particularly with respect to region extraction, and do not sufficiently use the spatial relationship between regions in the distance model In this paper, a region extraction method that is the combination of an edge-based method and a region growing method is proposed to accurately extract regions inside an object. Edges inside an object are accurately detected based on the Canny edge detector and the Hough transform. And the modified Integrated Region Matching (IRM) scheme which includes the adjacency relationship of regions is also proposed. It is used to compute the distance between images for the similarity search using shape features. The experimental results show the effectiveness of our region extraction method as well as the modified IRM. In comparison with other works, it is shown that the new region extraction method outperforms others.

• Journal of Korea Spatial Information System Society
• /
• v.9 no.2
• /
• pp.13-23
• /
• 2007

Recently there is growing Interest in LBS(Location Based Service) requiring real-time services and the spatial main memory DBMS for efficient Telematics services. In order to optimize existing disk-based multi-dimensional Indexes of the spatial main memory DBMS in the main memory, multi-dimensional index structures have been proposed, which minimize failures in cache access by reducing the entry size. However, because the reduction of entry size requires compression based on the MBR of the parent node or the removal of redundant MBR, the cost of MBR reconstruction increases in index update and the efficiency of search is lowered in index search. Thus, to reduce the cost of MBR reconstruction, this paper proposed the RSMBR(Relative-Sized MBR) compression technique, which applies the base point of compression differently in case of broad distribution and narrow distribution. In case of broad distribution, compression is made based on the left-bottom point of the extended MBR of the parent node, and in case of narrow distribution, the whole MBR is divided into cells of the same size and compression is made based on the left-bottom point of each cell. In addition, MBR was compressed using a relative coordinate and size to reduce the cost of search in index search. Lastly, we evaluated the performance of the proposed RSMBR compression technique using real data, and proved its superiority.

• Journal of KIISE:Databases
• /
• v.29 no.1
• /
• pp.44-57
• /
• 2002

Multiple spatial queries are defined as two or more spatial range queries to be executed at the same time. The primary processing of internet-based map services is to simultaneously execute multiple spatial queries. To improve the throughput of multiple queries, the time of disk I/O in processing spatial queries significantly should be reduced. The declustering scheme of a spatial dataset of the MIMD architecture cannot decrease the disk I/O time because of random seeks for processing multiple queries. This thesis presents query scheduling strategies to ease the problem of inter-query random seeks. Query scheduling is achieved by dynamically re-ordering the priority of the queued spatial queries. The re-ordering of multiple queries is based on the inter-query spatial relationship and the latency of query processing. The performance test shows that the time of multiple query processing with query scheduling can be significantly reduced by easing inter-query random seeks as a consequence of enhanced hit ratio of disk cache.

• Journal of KIISE:Databases
• /
• v.31 no.6
• /
• pp.664-674
• /
• 2004

The trajectory preservation property that stores only one trajectory in a leaf node is the most important feature of an index structure, such as the TB-tree for retrieving object's moving paths in the spatio-temporal space. It performs well in trajectory-related queries such as navigational queries and combined queries. But, the MBR of non-leaf nodes in the TB-tree have large amounts of dead space because trajectory preservation is achieved at the sacrifice of the spatial locality of trajectories. As dead space increases, the overlap between nodes also increases, and, thus, the classical range query cost increases. We present a new split policy and entry relocation policies, which have no deterioration of the performance for trajectory-related queries, for improving the performance of range queries. To maximally reduce the dead space of a non-leaf node's MBR, the Maximal Area Reduction (MAR) policy is used as a split policy for non-leaf nodes. The entry relocation policy induces entries in non-leaf nodes to exchange each other for the purpose of reducing dead spaces in these nodes. We propose two algorithms for the entry relocation policy, and evaluate the performance studies of new algorithms comparing to the TB-tree under a varying set of spatio-temporal queries.

• The Journal of Korea Institute of Information, Electronics, and Communication Technology
• /
• v.11 no.6
• /
• pp.638-644
• /
• 2018

Relay systems have recently gained attentions because of its capability of cell coverage extension and the power gain as the one of key technologies for 5G. Relays can be exploited for small-cell base stations and the autonomous network, where communication devices communicate with each other cooperatively. Therefore, the relay technology is expected to enable the low power and large capacity communication. In order to maximize the benefits of using a limited number of relays, the efficient relay selection method is required. Especially, when two nodes exchange their data with each other via relay, the relay selection can maximize the average data rate by the spatial location of the relay. For this purpose, the average data rate is analyzed first according to the relay selection. In this paper, we analyzed the average data rate when two nodes exchange their data via dual-hop decode and forward relaying considering the interference by the concurrent transmission under Nakagami-m fading channel. The correctness of the analysis is verified by the Monte Carlo simulation. The results show that the concurrent transmission is superior to the non-concurrent transmission in the high required data rate region rather than in the low required data rate region.

• Proceedings of the Korea Water Resources Association Conference
• /
• 2007.05a
• /
• pp.532-536
• /
• 2007

급속한 도시화 및 지구온난화로 인한 집중호우로 홍수피해가 해마다 증가하고 있다. 홍수피해를 최소화하기 위하여 4대강 중심의 홍수예경보시스템이 구축되는 등 다양한 제도적 장치가 마련되고 있으나 중소하천이 분포되어 있는 도시유역에서의 홍수예측기능은 부족한 실정이다. 본 연구에서는 중소 도시하천에 적용 가능한 실시간 도시홍수예측서비스 시스템(Realtime Urban Flood Forecasting Service, U-FFS)을 개발하였다. 경기도 성남에 위치한 탄천을 대상유역으로 선정하고 실시간 강우 및 수위관측소를 설치하여 수문데이타를 수집하였으며 이를 바탕으로 수위예측모형을 구축하였다. 모형구축에는 이미 국내외 학계에서 그 정확도가 입증된 바 있는 Data-driven 모델의 일종인 ANFIS(Adaptive Neuro-Fuzzy Inference System)를 이용하였다. 개발된 수위예측모형은 지정된 시간에 자동으로 작동 가능한 실행파일로 프로그래밍되어 최종적으로 홍수예측 웹서비스와 연동된다. U-FFS는 집중호우 발생 시 최종 유출구의 30분, 1시간, 2시간 후의 수위 예측값을 웹 상을 통해 제공함으로써 언제 어디서나 홍수예측 정보를 누구나 손쉽게 획득할 수 있는 장점이 있다. 시범운영 결과, 30분 및 1시간 후의 수위 예측은 정확도가 매우 뛰어났으며 2시간 후의 수위 예측의 정확성은 다소 떨어지는 것으로 확인되었으나 전반적인 홍수예측 판단에는 무리가 없을 것으로 예상된다. 본 시스템의 홍수예측모형은 생성 및 수정이 간편하여 그 활용성이 매우 높을 것으로 기대된다. 특히 안전함을 지향하는 각종 U-City나 홍수피해가 빈번한 도시유역에 적용하면 기존 시스템과 차별화된 실시간 홍수예측 서비스가 가능해져 홍수피해를 최소화할 수 있을 것이다. 취수구 직경 D의 3.3배를 벗어나지 않는다는 결과를 도출할 수 있었다.링 목적으로 사용될 수 있다. 본 연구에서 개발한 영상수위계는 한강홍수통제소 관할의 전류, 청담대교 등 4개소 낙동강 홍수통제소 2개소, 지자체 등에 적용되었으며, 적용 결과 비교적 안정적이면서 정확하게 수위를 측정하는 것으로 나타났다. 한편 기존 CCD 카메라 이외에 CCTV를 이용한 영상수위계를 개발하여 영상의 화질 개선뿐 아니라 하천화상 감시 기능을 강화하였다.소류의 섭취율은 높았다. 집단간의 상관도를 보면 교육별로 김치, 장아찌, 콩이 각각 p>0.5 수준에서 유의한 차가 없었고, 나머지는 유의한 차가 있었다. 연령별로는 멸치가 유의한 차가 없었고(p>0.5), 수입별로는 콩이 유의한 차가 없었다(p>0.5). 4. 영양지식(營養知識) 검토 가정생활(家庭生活)에 필요(必要)한 일반적(一般的)인 영양지식(營養知識)은 대체적으로 낮은 편이었다. 어린이 영양, 편식의 해로움, 비만증의 해로움, 임신부 그리고 수유부 영양에 대하여는 일반적으로 알고 있다고 하였으며, 그다음으로 이유기 영양, 어린이 발육에 필요한 식품, 식품과 영양소와의 관계, 우유의 성분, 노인영양에 대하여 잘 알고 있는 비율이 낮았으며, 인체의 영양소, 식단작성여부, 간식의 이론, 식품감별법에 대하여는 가장 낮은 비율을 나타냈다. 각 영양지식은 교육정도가 높을수록 영양지식이 높았고, 교육별 집단간의 유의한 차가 나타났다. (0.001