• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.26 no.10
• /
• pp.1531-1536
• /
• 2022

This paper considers a problem to find a set of intervals containing all the points for the given n points and m intervals on a line, This is a special case of the set cover problem, well known as an NP-hard problem. As optimization criteria of the problem, there are minimizing the number of intervals to cover the points, maximizing the number of points each of which is covered by exactly one interval, and so on. In this paper, the intervals have weights and the sum of weights of intervals to cover a point is defined as a membership of the point. We will study the problem to find an interval cover minimizing the maximum of memberships of points. Using the dynamic programming method, we provide an O(m²)-time algorithm to improve the time complexity O(nm log n) given in the previous work.

• Proceedings of the Korean Statistical Society Conference
• /
• 2002.11a
• /
• pp.227-230
• /
• 2002

표본의 크기가 작을 경우에 이항분포의 모수에 대한 신뢰구간을 구하는 대표적인 방법으로는 Clopper-Pearson 방법과 Blyth-Still 방법이 있다. Clopper-Pearson 방법에 의한 신뢰구간은 이항 모수가 포함되는 커버리지 확률이 목표로 하는 신뢰수준보다 상대적으로 크다는 문제점이 있다. Blyth-Still 방법은 이러한 문제점을 개선시켰다. 그러나, Blyth-Still에 의해서 표로 보고된 신뢰구간을 적용할 경우 표본의 크기와 이항 모수의 값에 따라서 커버리지 확률이 목표하는 신뢰수준보다 작은 경우가 발생한다. 그러나, 이는 Blyth-Still 방법 자체의 문제점이 아니며 단지 보고된 표의 유의한 소수점 자릿수와 관계가 있다. 본 논문은 Blyth-Still 방법에 의한 좀 더 정확한 신뢰구간을 제시한다.

• Journal of KIISE:Computer Systems and Theory
• /
• v.34 no.10
• /
• pp.539-554
• /
• 2007

In this Paper, we investigate conditions for proper interval graphs to have k-disjoint path covers of three types each: one-to-one, one-to-many, and many-to-many. It was proved that for $k{\geq}2$, a proper interval graph is one-to-one k-disjoint path coverable if and only if the graph is k-connected, and is one-to-many k-disjoint path coverable if and only if the graph is k+1-connected. For $k{\geq}3$, a Proper interval graph is (paired) many-to-many k-disjoint path coverable if and only if the graph is 2k-1-connected.

• Journal of Korea Society of Industrial Information Systems
• /
• v.29 no.2
• /
• pp.27-33
• /
• 2024

In this paper, the effects of separation distance from a thick radar cover on the performance of 24 GHz band radar was studied through experiments. When a polycarbonate radar cover with a thickness of 10 mm was placed in front of the radar, the variations in radar performance according to the change in the separation distance between the radar and the radar cover was compared with the case without the radar cover. As a radar performance indicator, the distance measured from the radar was used, and the distance was measured using the radar when a person moves away from the radar at a constant speed in the hallway of the building and then approaches again. The separation distance between the radar and radar cover was tested at 2 mm, 5 mm, and 20 mm, respectively. When there was no radar cover, the distance could be measured up to 49.64 m and the error was the lowest. When the separation distance was 2 mm, there was a section where distance measurement was not possible starting from 37.61 m, so the performance was the worst. When the separation distance was increased to 5 mm and 20 mm, the distance was measured up to 49.56 m, but the section where the error between the measured distance and the expected distance was large occurred more often than when there was no radar cover.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2003.10a
• /
• pp.707-711
• /
• 2003

상호접속원가는 통신망의 가입자 액세스 비용 인정여부에 따라 크게 달라지게 된다. 이동망은 유선망과 달리 가입자에게 할당된 직접적인 가입자 선로가 없는 대신 서비스 지역내 어디에서든지 호를 접속할 수 있는 능력 즉 커버리지를 제공하고 있으며, 이 커버리지 비용은 유선망의 가입자 선로비용에 해당하는 것으로 간주할 수 있다. 2002년 12월 개정 전기통신설비의 상호접속기준 22조의4의 장기증분비용 방식을 적용함에 있어 유선망은 각국에서 선행연구가 진행되어 왔고 실제 적용사례도 많기 때문에 비교적 사업자간 합의점을 찾기 용이한 측면이 있으나 이동망의 경우 선행연구가 부족하기 때문에 원가범위를 둘러싼 당사자간 논란의 여지가 많은 실정이다. 본 연구에서는 국내 이동시장환경을 분석하여 합리적인 이동망의 가입자 액세스 구간인 커버리지 정의와 범주를 살펴보고, 이동망 커버리지 비용 처리 방안을 살펴보고자 한다.

• Journal of Advanced Navigation Technology
• /
• v.28 no.1
• /
• pp.102-108
• /
• 2024

In the initial stages of urban air mobility (UAM) operations, compliance with existing visual flight rules and instrument flight regulations for conventional human-crewed aircraft is crucial. Additionally, voice communication between the on board pilot and relevant UAM stakeholders, including vertiports, is essential. Consequently, very high frequency (VHF) aviation voice communication must be consistently provided throughout all phases of UAM operations. This paper presents the results of the VHF communication coverage analysis for the initial UAM demonstration areas, encompassing the Hangang River and Incheon Ara-Canal corridors, as well as potential vertiport candidate locations. By considering the influence of terrain and buildings through the utilization of a digital surface model (DSM), communication quality prediction results are obtained for the analysis areas. The three-dimensional coverage analysis results indicate that stable coverage can be achieved within altitude corridors ranging from 300 m to 600 m. However, there are shaded areas in the low-altitude vertiport regions due to the impact of high-rise buildings. Therefore, additional research to ensure stable coverage around vertiports in the lower altitude areas is required.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.27 no.3A
• /
• pp.180-187
• /
• 2002

The decoding method using covering polynomials is an extended form of error-trapping decoding, and is a simple and effective means to implement decoders for cyclic codes. Covering polynomials can be used for soft-decision decoding as well as for decoding beyond the bounded distance of the code. The implementation complexity is proportional to the number of covering polynomials employed. In this paper, the soft-decision decoding procedure using covering polynomials is described, and the procedure is applied to the [23,12] Golay code. A new set of covering polynomials is derived for the procedure, which is presented as a generalized closed-form solution. The set can be efficiently utilized for decoding a class of cyclic codes including the Golay code. Computer simulation of the described procedure is performed to show the trade-offs between the decoder performance and complexity. It is demonstrated that soft-decision decoding of the Golay code using the derived set of covering polynomials has less than 0.2dB deviation from the optimal performance of maximum-likelihood decoding, with a reduced complexity when compared to the Chase Algorithm 2 combined with hard-decision decoding that has nearly identical performance.

• Journal of Korean Society of Steel Construction
• /
• v.18 no.6
• /
• pp.717-726
• /
• 2006

Traditional external post-tensioning method using either steel bars or tendons is commonly used as a retrofitting method for steel composite bridges. However, the method has some disadvantages such as stress concentration at anchorages and inefficient load-carrying capability of live loads. Multi-stepwise prestressing method using thermal expanded coverplate is a newly proposed prestressing method, which was originally developed for prestressing steel structures. A new retrofitting method for steel girder bridges founded on a simple concept of thermal expansion and contraction of cover plate, the method is a hybrid of and combines the advantages of external post-tensioning and thermal prestressing. In this paper, basic concepts of the method are presented and an illustrative experiment is introduced. From actual experimental data, the thermal prestressing effect was substantiated and the FEM approach for its analysis was verified. The retrofitting effects ofa single-span bridge were analyzed and the feasibility of the developed method was examined.

• Proceedings of the Korean Information Science Society Conference
• /
• 2008.06d
• /
• pp.62-65
• /
• 2008

Mobile IPv6에서 단말이 이동을 하게 되면 경로 최적화를 위한 바인딩 업데이트를 하게 된다. 안전한 바인딩 업데이트를 위해 RFC 3775에서 Return Routability가 제안 되었다. 그러나 Return Routability는 MN과 HA 사이에는 IPSec으로 Secure Path를 보장 받지만, MN과 CN 사이에는 바인딩 업데이트 과정에 공격자가 개입할 경우 다양한 공격에 노출될 수 있다. 이에 본 논문에서는CN도 MN과 같이 HA와 Secure Channel을 보유한 이동 단말일 경우, 각 HA 사이에 커버로스 서버를 이용한 키 분배를 통해 바인딩 업데이트 메시지가 전달되는 전 구간에 걸쳐 안전한 경로를 확보하는 아키텍쳐를 제안한다.

• 한국정보통신설비학회:학술대회논문집
• /
• 2003.08a
• /
• pp.137-140
• /
• 2003

1996. 1월 CDMA방식을 이용한 이동전화서비스가 국내에 소개된 이후 커버리지를 지상에서 지하나 건물 내로 확장하기 위해 RF중계기가 보편적으로 사용되고 있다. RF중계기는 지하 등 전파가 도달하지 않는 곳에 기지국으로부터 RF로 신호를 받아 증폭시켜서 커버리지를 만들어 주는 장치로 가격과 품질 측면에서 유용한 방법이다. WCDMA는 무선구간의 기술방식이 CDMA와 유사하기 때문에 향후 CDMA와 같은 개념의 WCDMA RF중계기가 보편적으로 사용될 것으로 예상된다. 본 논문에서는 WCDMA 전파특성과 향후 제공될 서비스를 바탕으로 WCDMA RF중계기의 용량에 영향을 주는 요인들을 분석하고 새로운 용량 설계 개념을을 정의한다. 본 논문의 결과는 그 WCDMA RF중계기를 설계, 설치하는 분야, WCDMA RF중계기 기능 및 성능분석, 개발, 최적화 분야 등에 활용될 수 있다.