• Journal of the Korean Society for information Management
• /
• v.21 no.1
• /
• pp.173-186
• /
• 2004

This study examines coverage and coverage overlap of the three major Korean web directories, Naver, Yahoo Korea, and Empas. This study also suggests a methodology for collecting and processing web sites provided by these web directories. A method for napping main categories was developed. Each directory provided registered web pages in a slightly different way. Reference links had a significant influence on the coverage of each web directory. The overlap of pages among three directories was quite low, It is expected that this study could contribute to the field of web research by providing insights to how directories provide web pages and suggesting a methodology for the analysis of directory coverage.

• Journal of the Korean Society for information Management
• /
• v.11 no.1
• /
• pp.17-29
• /
• 1994

Ths study was prformed to measure the indexmg coverage of the periol~cal literature on a sub'||'&'||' area inKorean language policy. A bibliography of 675 citations dated 1977-1990 was obtained through Xugohaknonpmongnokjip'.Coverage was determined by checlung the citations against 2 indexmg services, Ch-dg~idm"and Xugogungrnunhaknonmunmongrok". For the period 1977-1990, T h o n g g g a n h a n g m s consistentlyprovided coverage of about 63%. For the pencd 1986-1990, Xugogungmunhaknonmunmongrok" providedcoverage of about 33% and the combined coverage of the two services was abut 78%. The extent of overlap anduniqueness of both indexmg services are measured. The analysis also includes the subst of the indexed art~cles andthe type of perid'||'&'||' Omitted.rid& Omitted.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.11
• /
• pp.5574-5591
• /
• 2017

Inspired by the idea of Artificial Immune System, many researches of wireless sensor network (WSN) intrusion detection is based on the artificial intelligent system (AIS). However, a large number of generated detectors, black hole, overlap problem of NSA have impeded further used in WSN. In order to improve the anomaly detection performance for WSN, detector generation mechanism need to be improved. Therefore, in this paper, a Differential Evolution Constraint Multi-objective Optimization Problem based Negative Selection Algorithm (DE-CMOP based NSA) is proposed to optimize the distribution and effectiveness of the detector. By combining the constraint handling and multi-objective optimization technique, the algorithm is able to generate the detector set with maximized coverage of non-self space and minimized overlap among detectors. By employing differential evolution, the algorithm can reduce the black hole effectively. The experiment results show that our proposed scheme provides improved NSA algorithm in-terms, the detectors generated by the DE-CMOP based NSA more uniform with less overlap and minimum black hole, thus effectively improves the intrusion detection performance. At the same time, the new algorithm reduces the number of detectors which reduces the complexity of detection phase. Thus, this makes it suitable for intrusion detection in WSN.

• Proceedings of the KSRS Conference
• /
• v.2
• /
• pp.946-949
• /
• 2006

With repeated coverage, spaceborne SAR (Synthetic Aperture Radar) instruments provide the most efficient means to monitor and study the changes in important elements of the marine environment. Due to highresolution of SAR data, the coverage of SAR sensor is always limited, especially for a repeat cycle. With more SAR sensors from various satellites, new data products such as ocean surface drift can be derived when two SARs' tracks overlap in a short time over coastal areas. Currently, there are two SAR sensors on different satellites with almost the exactly same path. That is, ERS-2 is following ENVISAT with a 30-minutes delay, which will be a good timing for ocean mesosclae feature tracking. For another application, a mystery ship near a big eddy with strong ship wake has been tracked between ERS-2 and ENVISAT SAR images to estimate its ship speed.

• Journal of the Korea Society of Computer and Information
• /
• v.19 no.8
• /
• pp.63-71
• /
• 2014

This paper proposes an algorithm that forms the clusters on the basis of hop distance in order to improve the actor coverage and connectivity in the sink-based wireless sensor and actor networks. The proposed algorithm forms the clusters that are distributed evenly in the target area by electing the CHs(Cluster Heads) at regular hop intervals from a sink. The CHs are elected sequentially from the sink in order to ensure the connectivity between the sink and the actors that are located on the CHs. Additionally, the electing are achieved from the area of the higher rate of the sensors density in order to improve the actor coverage. The number of clusters that are created in the target area and the number of the actors that are placed on the positions of the CHs are reduced by forming the clusters with regular distribution and minimizing the overlap of them through the proposed algorithm. Simulations are performed to verify that the proposed algorithm constructs the actor network that is connected to the sink. Moreover, we shows that the proposed algorithm improves the actor coverage and, therefore, reduces the amount of the actors that will be deployed in the region by 9~20% compared to the IDSC algorithm.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.44 no.1
• /
• pp.10-18
• /
• 2007

In this paper, we address the node positioning method for minimizing the overlap sensing areas in wireless sensor networks with adjustable sensing ranges. To find a optimal node position, we derive a optimal equations by using the overlapped areas, each node's radiuses and expended angles of opposite neighboring nodes. Based on it, we devise a new node positioning method, called as ASRC(Adjustable Sensing Ranges Control). Unlike existing condition based model, our proposed method is derived from mathematical formula, and we confirm its validity through various simulations.

• The Korean Journal of Applied Statistics
• /
• v.36 no.5
• /
• pp.381-397
• /
• 2023

The most representative design used in clinical trials is randomization, which is used to accurately estimate the treatment effect. However, comparison between the treatment group and the control group in an observational study without randomization is biased due to various unadjusted differences, such as characteristics between patients. Propensity score weighting is a widely used method to address these problems and to minimize bias by adjusting those confounding and assess treatment effects. Inverse probability weighting, the most popular method, assigns weights that are proportional to the inverse of the conditional probability of receiving a specific treatment assignment, given observed covariates. However, this method is often suffered by extreme propensity scores, resulting in biased estimates and excessive variance. Several alternative methods including trimming, overlap weights, and matching weights have been proposed to mitigate these issues. In this paper, we conduct a simulation study to compare performance of various propensity score weighting methods under diverse situation, such as limited overlap, misspecified propensity score, and treatment contrary to prediction. From the simulation results overlap weights and matching weights consistently outperform inverse probability weighting and trimming in terms of bias, root mean squared error and coverage probability.

• Proceedings of the KIEE Conference
• /
• 1999.11b
• /
• pp.9-11
• /
• 1999

This paper presents the problems of design and theoretical model of electrostatically driven axial-gap type wobble motor. The motor design benefits from large axial rotor-to-stator overlap and large gear ratios, and motor designs with rotor radii of 50 and $100{\mu}m$ are capable of generating torques in the [nNm] range at high electrostatic fields. Because of the large gear ratio, smaller angular steps and lower rotational speed are obtained, compared to radial-gap motor design. Aspects like gear ratio, torque generation, excitation schemes and torque coverage, normal forces, friction are addressed.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2022.05a
• /
• pp.110-113
• /
• 2022

인터넷을 통해 주위 사물과 연결된 차량은 사용자에게 편리성을 제공하기 위해 다양한 콘텐츠를 요구하는데 클라우드로부터 가져오는 시간이 비교적 오래 걸리기 때문에 차량과 물리적으로 가까운 위치에 캐싱하는 기법들이 등장하고 있다. 본 논문에서는 기반 시설이 밀집하게 설치된 도시 환경에서 maximum distance separable(MDS) 코딩을 사용해 road side unit(RSU)에 캐싱하는 방법에 대해 연구하였다. RSU의 중복된 서비스 커버리지 지역을 고려하여 차량의 콘텐츠 요구에 대한 RSU hit ratio를 높이기 위해 deep Q-learning(DQN)를 사용하였다. 실험 결과 비교 알고리즘보다 hit raito 측면에서 더 높은 성능을 보이는 것을 증명하였다.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.9 no.4
• /
• pp.47-52
• /
• 2009

The transmitted signal from a source is transmitted to a destination through wireless channels. But if the mobile destination is out of the coverage of the source or exists in the shady side of the coverage, the destination can not receiver the signal from the source and they can not maintain communication. In order to overcome these problems, we adopt relays. A system employing relays is a multi-hop relay system. In the multi-hop relay system, coverages of each relay that is used for different systems can overlap each other in some place. When there is a destination in this place, interference occurs at the destination. In this paper, we study on the efficient co-channel interference (CCI) cancellation algorithm. In the proposed strategy, CCI is mitigated by zero forcing (ZF) or minimum mean square error (MMSE) receivers. Moreover, successive interference cancellation (SIC) with optimal ordering algorithm is applied for rejecting CCI efficiently. And we analyzed and simulated the proposed system performance in Rayleigh fading channel. In order to justify the benefit of the proposed strategy, the overall system performance is illustrated in terms of bit error probability.