• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.18 no.11
• /
• pp.2715-2720
• /
• 2014

Median filtering is very effective to remove impulse type noises, so it has been widely used in many signal processing applications. However, due to the time complexity of its non-linearity, median filtering is often used using a small filter window size. A lot of work has been done on devising fast median filtering algorithms, but most of them can be efficiently applied to input data with finite integer values like images. Little work has been carried out on fast 2-d median filtering algorithms that can deal with real-valued 2-d data. In this paper, a fast and simple median 2-d filter is presented, and its performance is compared with the Matlab's 2-d median filter and a heap-based 2-d median filter. The proposed algorithm is shown to be much faster than the Matlab's 2-d median filter and consistently faster than the heap-based algorithm that is much more complicated than the proposed one. Also, a more efficient median filtering scheme for 2-d real valued data with a finite range of values is presented that uses higher-bit integer 2-d median filtering with negligible quantization errors.

• Journal of KIISE:Information Networking
• /
• v.30 no.3
• /
• pp.407-415
• /
• 2003

As services requesting data transfer from a sender to a multiple number of receivers become popular, efficient group communication mechanisms like multicast get much attention. Since multicast is more efficient than unicast in terms of bandwidth usage and group management for group communication, many multicast protocols providing scalability and reliability have been proposed. Recently, router-supported reliable multicast protocols have been proposed because routers have the knowledge of the physical multicast tree structure and, in this scheme, repliers which retransmit lost packets are selected by routers. Repliers are selected dynamically based on the network situation, therefore, any receiver within a multicast group can become a replier Hence, all receivers within a group maintains a buffer for loss recovery within which received packets are stored. It is an overhead for all group receivers to store unnecessary packets. Therefore, in this paper, we propose a new scheme which reduces resource usage by discarding packets unnecessary for loss recovery from the receiver buffer. Our scheme performs the replier selection and the loss recovery of lost packets based on the LSM [1] model, and discards unnecessary packets determined by ACKs from erasers which represent local groups.

• Journal of KIISE:Information Networking
• /
• v.35 no.5
• /
• pp.437-452
• /
• 2008

IEEE 802.16j MR networks introduce RSs (Relay Stations) within the IEEE 802.16 system in order to enhance the data throughput and extend the coverage. However, the current standardization defines that the BS (Base Station) controls MS's (Mobile Station's) handover, not only it induces the large signaling overhead but also handover latency could increase. In this paper, we propose a handover protocol in the MR networks where the high capability RSs that can process the MS's control functions are deployed. First, we classify the handover scenarios for the MR networks with the high capability RSs. Then, we define the MAC handover procedure, corresponding MAC management messages and the transmission routes for the proposed messages so that an 802.16e MS can perform seamless handover without noticing it is attached to an MR network. The simulation results show that the proposed handover protocol not only reduces the MAC management message overhead transferred through the wireless links compared to IEEE 802.16j/D1, which is the current standard for MR networks, but also performs the rapider and more secure MS handover than IEEE 802.16e and IEEE 802.16j/D1.

• Journal of KIISE:Information Networking
• /
• v.31 no.4
• /
• pp.375-383
• /
• 2004

As wireless mobile networks have been widely adopted due to their convenience for deployment, the research for improving their performance has been actively conducted. Since their throughput is restrained by the packet corruption rate not by congestion as in wired networks, however, network simulations for performance evaluation need to select the appropriate wireless channel model representing the behavior of propagation errors for the evaluated channel. The selection of the right model should depend on various factors such as the adopted frequency band, the level of signal power, the existence of obstacles against signal propagation, the sensitivity of protocols to bit errors, and etc. This paper analyzes 10-day bit traces collected from real sensor channels exhibiting the high bit error rate to determine a suitable sensor channel model. For selection, it also evaluates the performance of two error recovery algorithms such as a link layer FEC algorithm and three TCPs (Tahoe, Reno, and Vegas) over several channel models. The comparison analysis shows that CM(Chaotic Map) model predicts 3-time less BER variance and 10-time larger PER(Packet Error Rate) than traces while these differences between the other models and traces are larger than 10-time. The simulation experiments, furthermore, prove that CM model evaluates the performance of these algorithms over sensor channels with the precision at least 10-time more accurate than any other models.

• Journal of The Korean Association of Information Education
• /
• v.1 no.1
• /
• pp.38-48
• /
• 1997

This study is an attempt to present a usage of the Web as CAI in the classroom and to give a direction to the future education in the face of information age. Characteristcs of information society, current curriculum, educational and teacher education are first analyzed in this article. The features of internet and 'Web are then summarized to present benefits of usage in the classroom as a CAI tool. The literature shows several characteristics of information society as follows : a technological computer, a provision and sharing of information, multi functional society, a participative democracy', an autonomy, a time value..A problem solving and 4 Cs(e.g., cooperation, copying, communication, creativity) are newly needed in this learning environment. The Internet is a large collection of networks that are tied together so that users can share their vast resources, a wealth of information, and give a key to a successful, efficient. individual study over a time and space. The 'Web increases an academic achievement, a creativity, a problem solving, a cognitive thinking, and a learner's motivation through an easy access to : documents available on the Internet, files containing programs, pictures, movies, and sounds from an FTP site, Usenet newsgroups, WAIS seraches, computers accessible through telnet, hypertext document, Java applets and other multimedia browser enhancements, and much more, In the Web browser will be our primary tool in searching for information on the Internet in this information age.

• Proceedings of the Korea Water Resources Association Conference
• /
• 2006.05a
• /
• pp.1121-1125
• /
• 2006

급속한 산업화와 도시화로 인하여 이상기후의 발생빈도가 높아지고 기후가 불안정해져서 예전보다 많은 집중호우가 발생되고 있다. 그리고 최근 홍수의 규모와 발생빈도가 증가하면서 홍수로 인한 인명과 재산상의 손실이 반복되고 있다. 이에 따른 홍수피해의 위험을 줄이기 위한 홍수방지시스템의 구축이 절실히 요구되고 있으며 홍수범람구역의 정확한 추정을 위해서는 홍수범람도 작성이 필요하다. 또한 정보통신산업이 급속도로 발전하면서 인터넷 사용의 증가로 많은 사용자들이 웹(Web)을 통해 다양한 데이터를 공유할 수 있고 정보를 검색할 수 있게 되면서 수자원 분야에도 정보의 공유와 자료의 통합을 위하여 Open GIS(The Open Geodata Interoperability Specification) 개념이 도입되고 있다. 따라서 본 연구에서는 Web기반으로 홍수범람모의 시스템을 구축하기 위한 기초연구로서 홍수 발생시 침수피해지역을 대상으로 실시간 3차원 홍수범람모의해석이 가능하도록 함으로써 연안지역 피해주민들의 피해를 줄일 수 있도록 하였다. 먼저, 본 연구에서는 이전의 시스템 상에서 정적인 지도로서 표현만 가능하던 것을 시공간적으로 유동성 있는 자료의 분석을 시각화하는 GIS 공간정보기술과 접목시켜 Web상에 동적인 지도형태로 표현함으로써 피해주민들이 쉽게 접할 수 있도록 하여 다양한 정보의 제공이 가능하게 될 것이다. 둘째, Web을 이용함으로써 실시간 홍수재해 정보를 수집하고 분석할 수 있어 인명과 재산의 피해를 줄일 수 있을 것으로 판단된다. 본 논문은 홍수범람시스템을 구축하기 위한 기초연구로서 현재는 GIS DB를 구축하는 단계에 있으며, 향후 다양한 유역을 대상으로 홍수범람모의시스템을 구축하여 분석결과를 피해지역주민 및 관련기관 실무자들에게 제공함으로써 시간과 공간에 구애받지 않는 재해관리와 신속한 재해 상황 대처가 가능해 질 것으로 사료된다.는 또 다른 형태의 주제도라고 볼 수 있으며, 이를 구축하기 위해서는 자료변환 및 가공이 필요하다. 즉, 각 상습침수지구에 필요한 지형도는 국립지리원에서 제작된 1:5,000 수치지형도가 있으나 이는 자료가 방대하고 상습침수지구에 필요하지 않은 자료들을 많이 포함하고 있으므로 상습침수지구의 데이터를 인터넷을 통해 서비스하기 위해서는 많은 불필요한 레이어의 삭제, 서비스 속도를 고려한 데이터의 일반화작업, 지도의 축소.확대 등 자료제공 방식에 따른 작업 그리고 가시성을 고려한 심볼 및 색채 디자인 등의 작업이 수반되어야 하며, 이들을 고려한 인터넷용 GIS기본도를 신규 제작한다. 상습침수지구와 관련된 각종 GIS데이타와 각 기관이 보유하고 있는 공공정보 가운데 공간정보와 연계되어야 하는 자료를 인터넷 GIS를 이용하여 효율적으로 관리하기 위해서는 단계별 구축전략이 필요하다. 따라서 본 논문에서는 인터넷 GIS를 이용하여 상습침수구역관련 정보를 검색, 처리 및 분석할 수 있는 상습침수 구역 종합정보화 시스템을 구축토록 하였다.N, 항목에서 보 상류가 높게 나타났으나, 철거되지 않은 검전보나 안양대교보에 비해 그 차이가 크지 않은 것으로 나타났다.의 기상변화가 자발성 기흉 발생에 영향을 미친다고 추론할 수 있었다. 향후 본 연구에서 추론된 기상변화와 기흉 발생과의 인과관계를 확인하고 좀 더 구체화하기 위한 연구가 필요할 것이다.게 이루어질 수 있을 것으로 기대된다.는 초과수익률이 상승하지만, 이후로는 감소하므로, 반전거래전략을 활용하는 경우 주식투자기간은 24개월이하의 중단기가 적합함을 발견하였다. 이상의 행태적 측면과 투자성과측면의 실증결과를 통하여 한국주식시장에 있어서 시장수익률을 평균적으로 초과할 수 있는 거래전략은 존재하므로 이러한 전략을 개발 및 활용할 수 있으며, 특히, 한국주식시장에 적합한 거래전략은 반전거래전략이고, 이 전략의 유용성은 투자자가

• The Transactions of the Korea Information Processing Society
• /
• v.4 no.1
• /
• pp.215-223
• /
• 1997

The advantages of service in satellite links are representatively a long distance and large capacity transfer and simultaneous communication. And terrestrial links are of high speed and high quality data transfer Therefore a combined form of characteristics of satellite and terrestrial links is desirable to furnish a good quality service to subscribers. And in satellite links an analysis method and a simulation method of file transfer are conducted to evaluate the efficiency of file transfer. The parameters are used the message length and transmission time, and the number of chain record and transmission time. From the results of evaluation, in satellite links, it is found that when the message length is shorter than 512 bytes, the file transmission time becomes extremely long and when the message length is set at 1024 bytes, the file transmission time abruptly increase from 2048 bytes. Also it is confirmed that when the number of chain record is under 15, the file transmission time becomes extremely long and if the number increase up to 90,the time becomes gradually short and over 90,it becomes constant.Therefore,from the result of file transmission in th case of utilizing satelite links,it is confirmed that the optimum message length in the minmum transmission time is present closely at 1024 bytes.Also it is confirmed that when the satelite transmission sped becoms smaller from 24kbps to2400bps,the optimum message length also becomes smaller from 640 bytes to 256bytes.

• Journal of KIISE:Information Networking
• /
• v.35 no.6
• /
• pp.497-509
• /
• 2008

Various algorithms and architectures for efficient packet classification have been widely studied. Packet classification algorithms based on a decision tree structure such as HiCuts and HyperCuts are known to be the best by exploiting the geometrical representation of rules in a classifier. However, the algorithms are not practical since they involve complicated heuristics in selecting a dimension of cuts and determining the number of cuts at each node of the decision tree. Moreover, the cutting is not efficient enough since the cutting is based on regular interval which is not related to the actual range that each rule covers. In this paper, we proposed a new efficient packet classification algorithm using a range cutting. The proposed algorithm primarily finds out the ranges that each rule covers in 2-dimensional prefix plane and performs cutting according to the ranges. Hence, the proposed algorithm constructs a very efficient decision tree. The cutting applied to each node of the decision tree is optimal and deterministic not involving the complicated heuristics. Simulation results for rule sets generated using class-bench databases show that the proposed algorithm has better performance in average search speed and consumes up to 3-300 times less memory space compared with previous cutting algorithms.

• Journal of KIISE:Information Networking
• /
• v.35 no.3
• /
• pp.173-182
• /
• 2008

Promoting quality of streaming service in wireless networks has attracted intensive research over the years. Instable wireless channel condition causes high transmission delay and packet loss, due to fading and interference. Therefore, they lead to degrade quality of video streaming service. The IEEE 802.11 Working Group is currently working on a new standard called IEEE 802.11e to support quality of service in WLANs. And several schemes were proposed in order to guarantee QoS. However, they are not adaptable to network condition. Accordingly, they suffered video quality degradation, due to buffer overflow or packet loss. In this paper, to promote quality of video streaming service in WLANs, we propose a cross-layer architecture based on IEEE 802.11e EDCA model. Our cross-layer architecture provides differentiated transmission mechanism of IEEE 802.11e EDCA based on priority of MPEG-4 video frames and adaptively controls the transmission rate by dropping video frames through the efficient bandwidth estimation based on distinction of each AC. Through the simulation, proposed scheme is shown to be able to improve end-to-end qualify for video streaming service in WLANs.

• Journal of KIISE:Information Networking
• /
• v.35 no.3
• /
• pp.215-226
• /
• 2008

As sensor networks are used in various and dynamic applications, the function of sink-to-sensors reliable multicasting such as for task reprogramming is newly required. NAK-based error recovery schemes have been proposed for energy efficient reliable multicasting. However, these schemes have incompleteness problems such as the last packet loss. This paper introduces an ACK-based error recovery scheme, RM2I(Reliable Multicast with Implicit ACK and Indirect Recovery). It utilizes wireless multicast advantage in which a packet may be delivered to all of its omni-directional neighbor nodes. When a sender overhears a packet which its receiver forwards to the next nodes, it may interpret it as an ACK from the receiver. We call it an Implicit ACK. In Indirect Recovery, when a node receives a packet from neighbor nodes which are not its direct upstream node, it saves and utilizes it for error recovery. Using NS-2 simulator, we have analyzed their effects. We have also compared RM2I with the NAK-based error recovery scheme. In results, RM2I shows comparable performances to the ideal NAK-based scheme, except where Implicit ACK and Indirect Recovery do not occur at the edges of the networks.